./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-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 67499ec0709cfdcc368630c5b1d94f26157589b8bf16f22cf5d62554760c6dd7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:58:49,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:58:49,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:58:49,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:58:49,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:58:49,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:58:49,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:58:49,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:58:49,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:58:49,536 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:58:49,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:58:49,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:58:49,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:58:49,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:58:49,538 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:58:49,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:58:49,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:58:49,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:58:49,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:58:49,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:58:49,543 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:58:49,543 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:58:49,543 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:58:49,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:58:49,544 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:58:49,544 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:58:49,544 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:58:49,544 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:58:49,545 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:58:49,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:58:49,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:58:49,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:58:49,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:58:49,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:58:49,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:58:49,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:58:49,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:58:49,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:58:49,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:58:49,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:58:49,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:58:49,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:58:49,549 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 -> 67499ec0709cfdcc368630c5b1d94f26157589b8bf16f22cf5d62554760c6dd7 [2024-11-17 02:58:49,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:58:49,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:58:49,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:58:49,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:58:49,882 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:58:49,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i [2024-11-17 02:58:51,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:58:51,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:58:51,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i [2024-11-17 02:58:51,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c155def8/910829e845f54c03a144e17e0cdacff2/FLAG123edd7da [2024-11-17 02:58:51,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c155def8/910829e845f54c03a144e17e0cdacff2 [2024-11-17 02:58:51,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:58:51,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:58:51,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:58:51,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:58:51,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:58:51,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:58:51" (1/1) ... [2024-11-17 02:58:51,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114803dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:51, skipping insertion in model container [2024-11-17 02:58:51,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:58:51" (1/1) ... [2024-11-17 02:58:51,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:58:52,374 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,419 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,427 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,432 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,441 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,490 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,493 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,496 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,496 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,502 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,507 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,510 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,511 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,514 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:52,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:58:52,547 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 02:58:52,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@159475f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:52, skipping insertion in model container [2024-11-17 02:58:52,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:58:52,549 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 02:58:52,551 INFO L158 Benchmark]: Toolchain (without parser) took 748.62ms. Allocated memory is still 148.9MB. Free memory was 93.0MB in the beginning and 109.1MB in the end (delta: -16.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-17 02:58:52,552 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 96.5MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 02:58:52,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.24ms. Allocated memory is still 148.9MB. Free memory was 93.0MB in the beginning and 109.1MB in the end (delta: -16.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-17 02:58:52,554 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 96.5MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.24ms. Allocated memory is still 148.9MB. Free memory was 93.0MB in the beginning and 109.1MB in the end (delta: -16.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-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 67499ec0709cfdcc368630c5b1d94f26157589b8bf16f22cf5d62554760c6dd7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:58:54,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:58:54,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 02:58:54,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:58:54,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:58:54,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:58:54,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:58:54,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:58:54,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:58:54,985 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:58:54,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:58:54,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:58:54,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:58:54,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:58:54,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:58:54,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:58:54,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:58:54,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:58:54,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:58:54,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:58:54,994 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:58:54,995 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:58:54,996 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:58:54,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:58:54,996 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:58:54,997 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 02:58:54,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:58:54,998 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 02:58:54,998 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:58:54,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:58:54,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:58:55,000 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:58:55,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:58:55,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:58:55,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:58:55,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:58:55,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:58:55,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:58:55,003 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 02:58:55,003 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 02:58:55,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:58:55,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:58:55,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:58:55,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:58:55,005 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 -> 67499ec0709cfdcc368630c5b1d94f26157589b8bf16f22cf5d62554760c6dd7 [2024-11-17 02:58:55,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:58:55,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:58:55,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:58:55,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:58:55,340 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:58:55,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i [2024-11-17 02:58:57,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:58:57,370 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:58:57,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i [2024-11-17 02:58:57,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83a1c409/807c64277ad348baafc21118cbc7d3e2/FLAG763e407e1 [2024-11-17 02:58:57,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83a1c409/807c64277ad348baafc21118cbc7d3e2 [2024-11-17 02:58:57,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:58:57,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:58:57,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:58:57,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:58:57,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:58:57,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:58:57" (1/1) ... [2024-11-17 02:58:57,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21548df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:57, skipping insertion in model container [2024-11-17 02:58:57,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:58:57" (1/1) ... [2024-11-17 02:58:57,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:58:58,113 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,157 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,164 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,170 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,184 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,236 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,239 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,242 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,245 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,248 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,253 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,258 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,259 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,262 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:58:58,296 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 02:58:58,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:58:58,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,355 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,356 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,358 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,363 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,379 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,380 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,382 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,382 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,384 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,385 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,386 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,387 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,389 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:58:58,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:58:58,405 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:58:58,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:58:58,573 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:58:58,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58 WrapperNode [2024-11-17 02:58:58,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:58:58,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:58:58,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:58:58,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:58:58,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,693 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1002 [2024-11-17 02:58:58,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:58:58,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:58:58,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:58:58,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:58:58,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,816 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-17 02:58:58,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:58:58,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:58:58,913 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:58:58,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:58:58,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (1/1) ... [2024-11-17 02:58:58,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:58:58,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:58:58,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 02:58:58,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 02:58:59,021 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 02:58:59,022 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 02:58:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 02:58:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 02:58:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 02:58:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 02:58:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 02:58:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 02:58:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:58:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:58:59,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 02:58:59,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:58:59,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:58:59,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 02:58:59,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:58:59,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:58:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:58:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:58:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 02:58:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 02:58:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:58:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:58:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 02:58:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:58:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 02:58:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 02:58:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 02:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 02:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 02:58:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 02:58:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:58:59,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:58:59,286 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:58:59,289 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:59:03,221 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 02:59:03,338 INFO L? ?]: Removed 1074 outVars from TransFormulas that were not future-live. [2024-11-17 02:59:03,338 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:59:03,376 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:59:03,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 02:59:03,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:59:03 BoogieIcfgContainer [2024-11-17 02:59:03,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:59:03,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:59:03,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:59:03,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:59:03,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:58:57" (1/3) ... [2024-11-17 02:59:03,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee131df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:59:03, skipping insertion in model container [2024-11-17 02:59:03,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:58" (2/3) ... [2024-11-17 02:59:03,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee131df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:59:03, skipping insertion in model container [2024-11-17 02:59:03,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:59:03" (3/3) ... [2024-11-17 02:59:03,385 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test7-1.i [2024-11-17 02:59:03,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:59:03,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 523 error locations. [2024-11-17 02:59:03,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:59:03,477 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;@6eff0510, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:59:03,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 523 error locations. [2024-11-17 02:59:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 1079 states, 551 states have (on average 2.1669691470054446) internal successors, (1194), 1072 states have internal predecessors, (1194), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:59:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:59:03,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:03,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:59:03,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr520REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:03,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1232280, now seen corresponding path program 1 times [2024-11-17 02:59:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:03,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730525747] [2024-11-17 02:59:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:03,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:03,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:03,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:03,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 02:59:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:03,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:59:03,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:03,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:59:03,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-17 02:59:03,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:03,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:03,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730525747] [2024-11-17 02:59:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730525747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:03,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:03,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:59:03,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868356805] [2024-11-17 02:59:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:03,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:03,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:03,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:03,753 INFO L87 Difference]: Start difference. First operand has 1079 states, 551 states have (on average 2.1669691470054446) internal successors, (1194), 1072 states have internal predecessors, (1194), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:05,326 INFO L93 Difference]: Finished difference Result 1070 states and 1126 transitions. [2024-11-17 02:59:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:05,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 02:59:05,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:05,344 INFO L225 Difference]: With dead ends: 1070 [2024-11-17 02:59:05,345 INFO L226 Difference]: Without dead ends: 1067 [2024-11-17 02:59:05,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:05,349 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 980 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:05,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 705 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:59:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-11-17 02:59:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1058. [2024-11-17 02:59:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 549 states have (on average 2.0145719489981784) internal successors, (1106), 1052 states have internal predecessors, (1106), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1114 transitions. [2024-11-17 02:59:05,444 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1114 transitions. Word has length 3 [2024-11-17 02:59:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:05,444 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1114 transitions. [2024-11-17 02:59:05,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1114 transitions. [2024-11-17 02:59:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:59:05,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:05,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:59:05,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 02:59:05,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:05,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:05,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:05,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1232281, now seen corresponding path program 1 times [2024-11-17 02:59:05,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:05,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102809156] [2024-11-17 02:59:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:05,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:05,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:05,658 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:05,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 02:59:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:05,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:59:05,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:05,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:59:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:05,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:05,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:05,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102809156] [2024-11-17 02:59:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102809156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:59:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589334227] [2024-11-17 02:59:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:05,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:05,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:05,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:05,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:05,815 INFO L87 Difference]: Start difference. First operand 1058 states and 1114 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:07,870 INFO L93 Difference]: Finished difference Result 1470 states and 1558 transitions. [2024-11-17 02:59:07,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:07,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 02:59:07,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:07,875 INFO L225 Difference]: With dead ends: 1470 [2024-11-17 02:59:07,875 INFO L226 Difference]: Without dead ends: 1470 [2024-11-17 02:59:07,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:07,877 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 441 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:07,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1510 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 02:59:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2024-11-17 02:59:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1281. [2024-11-17 02:59:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 773 states have (on average 1.9961190168175937) internal successors, (1543), 1275 states have internal predecessors, (1543), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1551 transitions. [2024-11-17 02:59:07,907 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1551 transitions. Word has length 3 [2024-11-17 02:59:07,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:07,908 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1551 transitions. [2024-11-17 02:59:07,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1551 transitions. [2024-11-17 02:59:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 02:59:07,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:07,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:07,914 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 (3)] Forceful destruction successful, exit code 0 [2024-11-17 02:59:08,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:08,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:08,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1390039835, now seen corresponding path program 1 times [2024-11-17 02:59:08,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:08,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930878724] [2024-11-17 02:59:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:08,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:08,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:08,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:08,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 02:59:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:08,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:59:08,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:08,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:59:08,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:59:08,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:59:08,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 02:59:08,465 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:59:08,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 02:59:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:08,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:08,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930878724] [2024-11-17 02:59:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930878724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:08,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:08,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:59:08,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554608033] [2024-11-17 02:59:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:08,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:08,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:08,502 INFO L87 Difference]: Start difference. First operand 1281 states and 1551 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-17 02:59:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:10,855 INFO L93 Difference]: Finished difference Result 1285 states and 1557 transitions. [2024-11-17 02:59:10,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:10,856 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-17 02:59:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:10,861 INFO L225 Difference]: With dead ends: 1285 [2024-11-17 02:59:10,861 INFO L226 Difference]: Without dead ends: 1285 [2024-11-17 02:59:10,861 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-17 02:59:10,865 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1078 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:10,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 423 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 02:59:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2024-11-17 02:59:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1046. [2024-11-17 02:59:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 549 states have (on average 1.9908925318761383) internal successors, (1093), 1040 states have internal predecessors, (1093), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1101 transitions. [2024-11-17 02:59:10,891 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1101 transitions. Word has length 8 [2024-11-17 02:59:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:10,892 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1101 transitions. [2024-11-17 02:59:10,892 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-17 02:59:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1101 transitions. [2024-11-17 02:59:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:59:10,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:10,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:10,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 02:59:11,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:11,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:11,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash 141563054, now seen corresponding path program 1 times [2024-11-17 02:59:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:11,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433360562] [2024-11-17 02:59:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:11,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:11,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:11,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:11,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 02:59:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:11,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:59:11,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:11,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:59:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:11,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:11,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:11,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433360562] [2024-11-17 02:59:11,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433360562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:11,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:11,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:59:11,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276510518] [2024-11-17 02:59:11,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:11,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:11,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:11,251 INFO L87 Difference]: Start difference. First operand 1046 states and 1101 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:12,612 INFO L93 Difference]: Finished difference Result 1394 states and 1479 transitions. [2024-11-17 02:59:12,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:12,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-17 02:59:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:12,617 INFO L225 Difference]: With dead ends: 1394 [2024-11-17 02:59:12,617 INFO L226 Difference]: Without dead ends: 1394 [2024-11-17 02:59:12,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:12,618 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 947 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:12,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1231 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 02:59:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-17 02:59:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 999. [2024-11-17 02:59:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 549 states have (on average 1.9052823315118397) internal successors, (1046), 993 states have internal predecessors, (1046), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1054 transitions. [2024-11-17 02:59:12,641 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1054 transitions. Word has length 9 [2024-11-17 02:59:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:12,641 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1054 transitions. [2024-11-17 02:59:12,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1054 transitions. [2024-11-17 02:59:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:59:12,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:12,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:12,646 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-17 02:59:12,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:12,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr515REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:12,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash 141563055, now seen corresponding path program 1 times [2024-11-17 02:59:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26726980] [2024-11-17 02:59:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:12,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:12,845 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:12,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 02:59:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:12,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:59:12,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:12,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:59:12,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-17 02:59:12,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:12,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:12,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26726980] [2024-11-17 02:59:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26726980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:12,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:12,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:59:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626772768] [2024-11-17 02:59:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:12,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:12,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:12,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:12,996 INFO L87 Difference]: Start difference. First operand 999 states and 1054 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:14,769 INFO L93 Difference]: Finished difference Result 1487 states and 1575 transitions. [2024-11-17 02:59:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:14,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-17 02:59:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:14,774 INFO L225 Difference]: With dead ends: 1487 [2024-11-17 02:59:14,774 INFO L226 Difference]: Without dead ends: 1487 [2024-11-17 02:59:14,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:14,775 INFO L432 NwaCegarLoop]: 1170 mSDtfsCounter, 711 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:14,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1610 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:59:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2024-11-17 02:59:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1028. [2024-11-17 02:59:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 588 states have (on average 1.8911564625850341) internal successors, (1112), 1022 states have internal predecessors, (1112), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1120 transitions. [2024-11-17 02:59:14,796 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1120 transitions. Word has length 9 [2024-11-17 02:59:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:14,796 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1120 transitions. [2024-11-17 02:59:14,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1120 transitions. [2024-11-17 02:59:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 02:59:14,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:14,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:14,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-17 02:59:14,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:14,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash 679967983, now seen corresponding path program 1 times [2024-11-17 02:59:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008782114] [2024-11-17 02:59:15,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:15,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:15,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:15,001 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:15,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 02:59:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:15,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:59:15,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:15,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:15,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008782114] [2024-11-17 02:59:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008782114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:15,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197499503] [2024-11-17 02:59:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:15,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:15,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:15,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:15,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:15,226 INFO L87 Difference]: Start difference. First operand 1028 states and 1120 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:15,749 INFO L93 Difference]: Finished difference Result 1465 states and 1612 transitions. [2024-11-17 02:59:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:15,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 02:59:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:15,754 INFO L225 Difference]: With dead ends: 1465 [2024-11-17 02:59:15,754 INFO L226 Difference]: Without dead ends: 1465 [2024-11-17 02:59:15,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-17 02:59:15,755 INFO L432 NwaCegarLoop]: 1106 mSDtfsCounter, 458 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:15,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 3069 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:59:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2024-11-17 02:59:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1283. [2024-11-17 02:59:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 843 states have (on average 1.8766310794780545) internal successors, (1582), 1277 states have internal predecessors, (1582), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1590 transitions. [2024-11-17 02:59:15,780 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1590 transitions. Word has length 16 [2024-11-17 02:59:15,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:15,781 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1590 transitions. [2024-11-17 02:59:15,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1590 transitions. [2024-11-17 02:59:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 02:59:15,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:15,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:15,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 02:59:15,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:15,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash 678798126, now seen corresponding path program 1 times [2024-11-17 02:59:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:15,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211819531] [2024-11-17 02:59:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:15,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:15,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:15,991 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:15,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 02:59:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:16,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:59:16,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:16,139 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:59:16,140 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:59:16,143 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 33 treesize of output 31 [2024-11-17 02:59:16,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 02:59:16,200 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 62 treesize of output 22 [2024-11-17 02:59:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:16,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:16,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211819531] [2024-11-17 02:59:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211819531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:16,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:16,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:16,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074505320] [2024-11-17 02:59:16,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:16,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:16,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:16,237 INFO L87 Difference]: Start difference. First operand 1283 states and 1590 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:16,749 INFO L93 Difference]: Finished difference Result 2207 states and 2609 transitions. [2024-11-17 02:59:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:16,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 02:59:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:16,757 INFO L225 Difference]: With dead ends: 2207 [2024-11-17 02:59:16,757 INFO L226 Difference]: Without dead ends: 2207 [2024-11-17 02:59:16,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:16,759 INFO L432 NwaCegarLoop]: 997 mSDtfsCounter, 966 mSDsluCounter, 1985 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 2982 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:16,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 2982 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 02:59:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2024-11-17 02:59:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1282. [2024-11-17 02:59:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 842 states have (on average 1.8764845605700713) internal successors, (1580), 1276 states have internal predecessors, (1580), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1588 transitions. [2024-11-17 02:59:16,794 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1588 transitions. Word has length 16 [2024-11-17 02:59:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:16,795 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1588 transitions. [2024-11-17 02:59:16,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1588 transitions. [2024-11-17 02:59:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 02:59:16,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:16,796 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] [2024-11-17 02:59:16,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-17 02:59:16,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:16,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr507REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:16,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:16,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1639968910, now seen corresponding path program 1 times [2024-11-17 02:59:16,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:16,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780707799] [2024-11-17 02:59:16,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:16,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:16,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:17,002 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:17,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 02:59:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:17,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:59:17,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:17,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:17,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:17,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780707799] [2024-11-17 02:59:17,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780707799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:17,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:17,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:59:17,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047990538] [2024-11-17 02:59:17,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:17,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:17,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:17,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:17,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:17,164 INFO L87 Difference]: Start difference. First operand 1282 states and 1588 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:17,184 INFO L93 Difference]: Finished difference Result 1222 states and 1502 transitions. [2024-11-17 02:59:17,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:17,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-17 02:59:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:17,187 INFO L225 Difference]: With dead ends: 1222 [2024-11-17 02:59:17,188 INFO L226 Difference]: Without dead ends: 1222 [2024-11-17 02:59:17,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:17,188 INFO L432 NwaCegarLoop]: 981 mSDtfsCounter, 71 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:17,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1898 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:59:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-11-17 02:59:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2024-11-17 02:59:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 806 states have (on average 1.8535980148883375) internal successors, (1494), 1216 states have internal predecessors, (1494), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1502 transitions. [2024-11-17 02:59:17,209 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1502 transitions. Word has length 20 [2024-11-17 02:59:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:17,209 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1502 transitions. [2024-11-17 02:59:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1502 transitions. [2024-11-17 02:59:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 02:59:17,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:17,211 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] [2024-11-17 02:59:17,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 02:59:17,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:17,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr482REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:17,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash -242911295, now seen corresponding path program 1 times [2024-11-17 02:59:17,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:17,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78892606] [2024-11-17 02:59:17,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:17,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:17,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:17,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:17,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 02:59:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:17,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:59:17,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:17,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:17,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:17,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78892606] [2024-11-17 02:59:17,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78892606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:17,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:17,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649500032] [2024-11-17 02:59:17,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:17,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:17,581 INFO L87 Difference]: Start difference. First operand 1222 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:17,655 INFO L93 Difference]: Finished difference Result 1192 states and 1444 transitions. [2024-11-17 02:59:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:59:17,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-17 02:59:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:17,678 INFO L225 Difference]: With dead ends: 1192 [2024-11-17 02:59:17,678 INFO L226 Difference]: Without dead ends: 1192 [2024-11-17 02:59:17,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:17,679 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 48 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2781 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:17,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2781 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:59:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-17 02:59:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2024-11-17 02:59:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 790 states have (on average 1.8177215189873417) internal successors, (1436), 1186 states have internal predecessors, (1436), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1444 transitions. [2024-11-17 02:59:17,698 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1444 transitions. Word has length 22 [2024-11-17 02:59:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:17,698 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1444 transitions. [2024-11-17 02:59:17,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1444 transitions. [2024-11-17 02:59:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 02:59:17,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:17,699 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] [2024-11-17 02:59:17,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 02:59:17,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:17,900 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr469REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:17,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -783712648, now seen corresponding path program 1 times [2024-11-17 02:59:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:17,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484080853] [2024-11-17 02:59:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:17,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:17,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:17,906 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:17,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 02:59:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:18,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:59:18,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:18,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:59:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:18,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:18,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484080853] [2024-11-17 02:59:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484080853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:18,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:18,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:59:18,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378226289] [2024-11-17 02:59:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:18,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:18,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:18,319 INFO L87 Difference]: Start difference. First operand 1192 states and 1444 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:20,777 INFO L93 Difference]: Finished difference Result 1818 states and 2218 transitions. [2024-11-17 02:59:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-17 02:59:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:20,783 INFO L225 Difference]: With dead ends: 1818 [2024-11-17 02:59:20,783 INFO L226 Difference]: Without dead ends: 1818 [2024-11-17 02:59:20,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:20,784 INFO L432 NwaCegarLoop]: 1217 mSDtfsCounter, 644 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:20,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 2437 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-17 02:59:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2024-11-17 02:59:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1188. [2024-11-17 02:59:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 790 states have (on average 1.8075949367088608) internal successors, (1428), 1182 states have internal predecessors, (1428), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1436 transitions. [2024-11-17 02:59:20,807 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1436 transitions. Word has length 36 [2024-11-17 02:59:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:20,808 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1436 transitions. [2024-11-17 02:59:20,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1436 transitions. [2024-11-17 02:59:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 02:59:20,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:20,809 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] [2024-11-17 02:59:20,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 02:59:21,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:21,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr468REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:21,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:21,010 INFO L85 PathProgramCache]: Analyzing trace with hash -783712649, now seen corresponding path program 1 times [2024-11-17 02:59:21,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:21,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054974541] [2024-11-17 02:59:21,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:21,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:21,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:21,012 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:21,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 02:59:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:21,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:59:21,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:21,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:59:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:21,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:21,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:21,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054974541] [2024-11-17 02:59:21,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054974541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:21,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:59:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398016091] [2024-11-17 02:59:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:21,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:21,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:21,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:21,241 INFO L87 Difference]: Start difference. First operand 1188 states and 1436 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:22,794 INFO L93 Difference]: Finished difference Result 1663 states and 2032 transitions. [2024-11-17 02:59:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:22,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-17 02:59:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:22,798 INFO L225 Difference]: With dead ends: 1663 [2024-11-17 02:59:22,799 INFO L226 Difference]: Without dead ends: 1663 [2024-11-17 02:59:22,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:22,799 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 876 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:22,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1229 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:59:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-17 02:59:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1184. [2024-11-17 02:59:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 790 states have (on average 1.7974683544303798) internal successors, (1420), 1178 states have internal predecessors, (1420), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1428 transitions. [2024-11-17 02:59:22,823 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1428 transitions. Word has length 36 [2024-11-17 02:59:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:22,824 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1428 transitions. [2024-11-17 02:59:22,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1428 transitions. [2024-11-17 02:59:22,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 02:59:22,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:22,827 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] [2024-11-17 02:59:22,834 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 (12)] Forceful destruction successful, exit code 0 [2024-11-17 02:59:23,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:23,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr425REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:23,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:23,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1834821838, now seen corresponding path program 1 times [2024-11-17 02:59:23,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:23,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508555204] [2024-11-17 02:59:23,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:23,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:23,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:23,033 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:23,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 02:59:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:23,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:59:23,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:23,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:23,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:23,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508555204] [2024-11-17 02:59:23,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508555204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:23,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:23,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:23,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198612436] [2024-11-17 02:59:23,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:23,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:23,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:23,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:23,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:23,274 INFO L87 Difference]: Start difference. First operand 1184 states and 1428 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:23,317 INFO L93 Difference]: Finished difference Result 1172 states and 1408 transitions. [2024-11-17 02:59:23,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:59:23,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2024-11-17 02:59:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:23,320 INFO L225 Difference]: With dead ends: 1172 [2024-11-17 02:59:23,321 INFO L226 Difference]: Without dead ends: 1172 [2024-11-17 02:59:23,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:23,321 INFO L432 NwaCegarLoop]: 930 mSDtfsCounter, 21 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2758 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:23,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2758 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:59:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-11-17 02:59:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2024-11-17 02:59:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 778 states have (on average 1.7994858611825193) internal successors, (1400), 1166 states have internal predecessors, (1400), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1408 transitions. [2024-11-17 02:59:23,345 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1408 transitions. Word has length 56 [2024-11-17 02:59:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:23,345 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1408 transitions. [2024-11-17 02:59:23,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1408 transitions. [2024-11-17 02:59:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-17 02:59:23,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:23,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:23,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-17 02:59:23,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:23,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr425REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:23,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:23,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1509239046, now seen corresponding path program 1 times [2024-11-17 02:59:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:23,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734471198] [2024-11-17 02:59:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:23,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:23,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:23,551 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:23,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 02:59:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:23,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:59:23,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:23,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:59:23,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:59:24,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:59:24,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 02:59:24,527 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:59:24,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 02:59:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:24,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:24,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734471198] [2024-11-17 02:59:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734471198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:24,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:24,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:59:24,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292235469] [2024-11-17 02:59:24,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:24,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:24,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:24,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:24,537 INFO L87 Difference]: Start difference. First operand 1172 states and 1408 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:26,321 INFO L93 Difference]: Finished difference Result 1605 states and 1966 transitions. [2024-11-17 02:59:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:26,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-17 02:59:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:26,326 INFO L225 Difference]: With dead ends: 1605 [2024-11-17 02:59:26,326 INFO L226 Difference]: Without dead ends: 1605 [2024-11-17 02:59:26,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:26,327 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 1238 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:26,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 515 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:59:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-11-17 02:59:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1095. [2024-11-17 02:59:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 739 states have (on average 1.740189445196211) internal successors, (1286), 1089 states have internal predecessors, (1286), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1294 transitions. [2024-11-17 02:59:26,343 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1294 transitions. Word has length 64 [2024-11-17 02:59:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:26,343 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1294 transitions. [2024-11-17 02:59:26,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1294 transitions. [2024-11-17 02:59:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-17 02:59:26,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:26,344 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-17 02:59:26,354 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-17 02:59:26,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:26,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:26,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:26,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1687303861, now seen corresponding path program 1 times [2024-11-17 02:59:26,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:26,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795523101] [2024-11-17 02:59:26,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:26,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-17 02:59:26,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:26,550 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:26,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 02:59:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:26,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:59:26,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:26,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:59:26,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:59:26,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 02:59:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:26,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:26,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:26,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795523101] [2024-11-17 02:59:26,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795523101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:26,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:26,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131781060] [2024-11-17 02:59:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:26,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:59:26,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:26,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:59:26,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:26,892 INFO L87 Difference]: Start difference. First operand 1095 states and 1294 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:28,411 INFO L93 Difference]: Finished difference Result 1094 states and 1293 transitions. [2024-11-17 02:59:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:59:28,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-11-17 02:59:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:28,415 INFO L225 Difference]: With dead ends: 1094 [2024-11-17 02:59:28,415 INFO L226 Difference]: Without dead ends: 1094 [2024-11-17 02:59:28,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:59:28,415 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 2 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:28,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2344 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:59:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-11-17 02:59:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2024-11-17 02:59:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 739 states have (on average 1.7388362652232747) internal successors, (1285), 1088 states have internal predecessors, (1285), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1293 transitions. [2024-11-17 02:59:28,432 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1293 transitions. Word has length 69 [2024-11-17 02:59:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:28,432 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1293 transitions. [2024-11-17 02:59:28,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1293 transitions. [2024-11-17 02:59:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-17 02:59:28,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:28,434 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-17 02:59:28,446 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 (15)] Forceful destruction successful, exit code 0 [2024-11-17 02:59:28,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:28,635 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:28,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1687303860, now seen corresponding path program 1 times [2024-11-17 02:59:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:28,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262200547] [2024-11-17 02:59:28,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:28,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:28,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:28,669 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:28,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 02:59:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:29,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 02:59:29,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:29,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:59:29,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:59:29,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 02:59:29,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-17 02:59:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:29,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:29,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262200547] [2024-11-17 02:59:29,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262200547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:29,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:29,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:29,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872611207] [2024-11-17 02:59:29,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:29,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:59:29,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:29,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:59:29,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:29,122 INFO L87 Difference]: Start difference. First operand 1094 states and 1293 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:30,955 INFO L93 Difference]: Finished difference Result 1093 states and 1292 transitions. [2024-11-17 02:59:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:59:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-11-17 02:59:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:30,958 INFO L225 Difference]: With dead ends: 1093 [2024-11-17 02:59:30,958 INFO L226 Difference]: Without dead ends: 1093 [2024-11-17 02:59:30,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:59:30,959 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 1 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:30,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2394 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 02:59:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-11-17 02:59:30,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2024-11-17 02:59:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 738 states have (on average 1.7398373983739837) internal successors, (1284), 1087 states have internal predecessors, (1284), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:59:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1292 transitions. [2024-11-17 02:59:30,972 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1292 transitions. Word has length 69 [2024-11-17 02:59:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:30,972 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1292 transitions. [2024-11-17 02:59:30,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1292 transitions. [2024-11-17 02:59:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 02:59:30,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:30,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:30,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-17 02:59:31,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:31,175 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:31,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash -538567608, now seen corresponding path program 1 times [2024-11-17 02:59:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:31,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83823488] [2024-11-17 02:59:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:31,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:31,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:31,177 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:31,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-17 02:59:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:31,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:59:31,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:31,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:59:31,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83823488] [2024-11-17 02:59:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83823488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:31,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:31,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264466934] [2024-11-17 02:59:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:31,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:31,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:31,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:31,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:31,506 INFO L87 Difference]: Start difference. First operand 1093 states and 1292 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:59:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:31,539 INFO L93 Difference]: Finished difference Result 1096 states and 1296 transitions. [2024-11-17 02:59:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 77 [2024-11-17 02:59:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:31,545 INFO L225 Difference]: With dead ends: 1096 [2024-11-17 02:59:31,545 INFO L226 Difference]: Without dead ends: 1096 [2024-11-17 02:59:31,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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-17 02:59:31,546 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 0 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:31,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2704 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:59:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2024-11-17 02:59:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2024-11-17 02:59:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 740 states have (on average 1.7391891891891893) internal successors, (1287), 1090 states have internal predecessors, (1287), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:59:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1296 transitions. [2024-11-17 02:59:31,565 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1296 transitions. Word has length 77 [2024-11-17 02:59:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:31,565 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1296 transitions. [2024-11-17 02:59:31,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:59:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1296 transitions. [2024-11-17 02:59:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 02:59:31,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:31,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:31,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-17 02:59:31,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:31,769 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1592155469, now seen corresponding path program 1 times [2024-11-17 02:59:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:31,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415409200] [2024-11-17 02:59:31,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:31,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:31,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:31,772 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:31,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-17 02:59:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:32,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:59:32,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:32,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:59:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:32,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:32,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415409200] [2024-11-17 02:59:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415409200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:59:32,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:59:32,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 02:59:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130721075] [2024-11-17 02:59:32,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:59:32,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 02:59:32,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:32,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 02:59:32,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:59:32,155 INFO L87 Difference]: Start difference. First operand 1096 states and 1296 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:59:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:32,303 INFO L93 Difference]: Finished difference Result 1108 states and 1313 transitions. [2024-11-17 02:59:32,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:59:32,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-17 02:59:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:32,309 INFO L225 Difference]: With dead ends: 1108 [2024-11-17 02:59:32,310 INFO L226 Difference]: Without dead ends: 1108 [2024-11-17 02:59:32,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 02:59:32,310 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 5 mSDsluCounter, 4496 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5399 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:32,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5399 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:59:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-11-17 02:59:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106. [2024-11-17 02:59:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 749 states have (on average 1.7383177570093458) internal successors, (1302), 1099 states have internal predecessors, (1302), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:59:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1311 transitions. [2024-11-17 02:59:32,331 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1311 transitions. Word has length 78 [2024-11-17 02:59:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:32,331 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1311 transitions. [2024-11-17 02:59:32,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:59:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1311 transitions. [2024-11-17 02:59:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-17 02:59:32,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:32,335 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] [2024-11-17 02:59:32,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-17 02:59:32,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:32,536 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:32,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1405738760, now seen corresponding path program 2 times [2024-11-17 02:59:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:32,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686520867] [2024-11-17 02:59:32,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 02:59:32,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:32,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:32,538 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:32,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-17 02:59:33,017 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 02:59:33,017 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:59:33,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 02:59:33,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:33,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:59:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:33,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:33,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686520867] [2024-11-17 02:59:33,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686520867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:59:33,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:59:33,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 02:59:33,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306246370] [2024-11-17 02:59:33,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:59:33,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:59:33,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:33,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:59:33,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:59:33,211 INFO L87 Difference]: Start difference. First operand 1106 states and 1311 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:59:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:33,567 INFO L93 Difference]: Finished difference Result 1121 states and 1333 transitions. [2024-11-17 02:59:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 02:59:33,568 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-17 02:59:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:33,574 INFO L225 Difference]: With dead ends: 1121 [2024-11-17 02:59:33,574 INFO L226 Difference]: Without dead ends: 1117 [2024-11-17 02:59:33,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 02:59:33,575 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 14 mSDsluCounter, 4503 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5406 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:33,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5406 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:59:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-11-17 02:59:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1115. [2024-11-17 02:59:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 758 states have (on average 1.733509234828496) internal successors, (1314), 1108 states have internal predecessors, (1314), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:59:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1323 transitions. [2024-11-17 02:59:33,593 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1323 transitions. Word has length 81 [2024-11-17 02:59:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:33,593 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1323 transitions. [2024-11-17 02:59:33,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:59:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1323 transitions. [2024-11-17 02:59:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 02:59:33,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:33,595 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] [2024-11-17 02:59:33,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-17 02:59:33,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:33,796 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash -208949464, now seen corresponding path program 3 times [2024-11-17 02:59:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:33,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30238716] [2024-11-17 02:59:33,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 02:59:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:33,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:33,800 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:33,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-17 02:59:34,663 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 02:59:34,663 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:59:34,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 02:59:34,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:34,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:59:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:35,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:35,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30238716] [2024-11-17 02:59:35,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30238716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:59:35,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:59:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 02:59:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939982151] [2024-11-17 02:59:35,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:59:35,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:59:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:35,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:59:35,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 02:59:35,278 INFO L87 Difference]: Start difference. First operand 1115 states and 1323 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:59:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:36,670 INFO L93 Difference]: Finished difference Result 1139 states and 1362 transitions. [2024-11-17 02:59:36,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 02:59:36,671 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-11-17 02:59:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:36,679 INFO L225 Difference]: With dead ends: 1139 [2024-11-17 02:59:36,680 INFO L226 Difference]: Without dead ends: 1133 [2024-11-17 02:59:36,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 02:59:36,681 INFO L432 NwaCegarLoop]: 904 mSDtfsCounter, 21 mSDsluCounter, 11706 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12610 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:36,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12610 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:59:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-11-17 02:59:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133. [2024-11-17 02:59:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 776 states have (on average 1.722938144329897) internal successors, (1337), 1126 states have internal predecessors, (1337), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:59:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1346 transitions. [2024-11-17 02:59:36,699 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1346 transitions. Word has length 87 [2024-11-17 02:59:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:36,700 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1346 transitions. [2024-11-17 02:59:36,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:59:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1346 transitions. [2024-11-17 02:59:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:59:36,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:36,701 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] [2024-11-17 02:59:36,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-17 02:59:36,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:36,902 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:36,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:36,902 INFO L85 PathProgramCache]: Analyzing trace with hash -144472216, now seen corresponding path program 4 times [2024-11-17 02:59:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:36,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424481872] [2024-11-17 02:59:36,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 02:59:36,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:36,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:36,904 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:36,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-17 02:59:37,397 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 02:59:37,397 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:59:37,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 02:59:37,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:37,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:59:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:38,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:38,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424481872] [2024-11-17 02:59:38,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424481872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:59:38,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:59:38,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 02:59:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742145367] [2024-11-17 02:59:38,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:59:38,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 02:59:38,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:59:38,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 02:59:38,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 02:59:38,907 INFO L87 Difference]: Start difference. First operand 1133 states and 1346 transitions. Second operand has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:59:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:43,703 INFO L93 Difference]: Finished difference Result 1173 states and 1418 transitions. [2024-11-17 02:59:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 02:59:43,704 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-11-17 02:59:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:43,708 INFO L225 Difference]: With dead ends: 1173 [2024-11-17 02:59:43,708 INFO L226 Difference]: Without dead ends: 1169 [2024-11-17 02:59:43,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 02:59:43,710 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 40 mSDsluCounter, 20703 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 21606 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:43,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 21606 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 02:59:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2024-11-17 02:59:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1167. [2024-11-17 02:59:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 810 states have (on average 1.7074074074074075) internal successors, (1383), 1160 states have internal predecessors, (1383), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:59:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1392 transitions. [2024-11-17 02:59:43,727 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1392 transitions. Word has length 99 [2024-11-17 02:59:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:43,728 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1392 transitions. [2024-11-17 02:59:43,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:59:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1392 transitions. [2024-11-17 02:59:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-17 02:59:43,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:43,729 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] [2024-11-17 02:59:43,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-17 02:59:43,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:43,934 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-17 02:59:43,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:43,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1537090936, now seen corresponding path program 5 times [2024-11-17 02:59:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:59:43,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291709316] [2024-11-17 02:59:43,935 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:59:43,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:59:43,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:59:43,936 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:59:43,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-17 02:59:45,175 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-17 02:59:45,175 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:59:45,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-17 02:59:45,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:59:45,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:59:45,312 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-17 02:59:45,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-17 02:59:45,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:59:45,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-17 02:59:46,438 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:59:46,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-17 02:59:46,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-17 02:59:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-17 02:59:46,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:59:46,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:59:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291709316] [2024-11-17 02:59:46,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291709316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:59:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2081049599] [2024-11-17 02:59:46,868 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:59:46,868 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 02:59:46,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 02:59:46,869 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-17 02:59:46,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process