./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:44:01,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:44:01,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:44:01,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:44:01,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:44:01,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:44:01,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:44:01,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:44:01,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:44:01,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:44:01,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:44:01,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:44:01,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:44:01,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:44:01,812 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:44:01,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:44:01,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:44:01,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:44:01,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:44:01,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:44:01,813 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:44:01,816 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:44:01,817 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:44:01,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:44:01,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:44:01,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:44:01,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:44:01,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:44:01,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:44:01,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:44:01,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:44:01,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:44:01,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:44:01,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:44:01,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:44:01,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:44:01,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:44:01,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:44:01,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:44:01,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:44:01,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:44:01,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:44:01,822 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 -> 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 [2024-11-17 02:44:02,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:44:02,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:44:02,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:44:02,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:44:02,097 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:44:02,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2024-11-17 02:44:03,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:44:03,769 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:44:03,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2024-11-17 02:44:03,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65714a359/adf93776dd6f4257b87f30aa3315a9da/FLAGf4dedf454 [2024-11-17 02:44:04,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65714a359/adf93776dd6f4257b87f30aa3315a9da [2024-11-17 02:44:04,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:44:04,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:44:04,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:44:04,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:44:04,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:44:04,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:44:04" (1/1) ... [2024-11-17 02:44:04,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb0747a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:04, skipping insertion in model container [2024-11-17 02:44:04,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:44:04" (1/1) ... [2024-11-17 02:44:04,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:44:04,563 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,603 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,610 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,617 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,624 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,663 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,664 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,666 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,667 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,668 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,670 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,672 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,672 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,673 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,680 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:04,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:44:04,706 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 02:44:04,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6ba27910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:04, skipping insertion in model container [2024-11-17 02:44:04,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:44:04,708 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 02:44:04,709 INFO L158 Benchmark]: Toolchain (without parser) took 675.04ms. Allocated memory is still 184.5MB. Free memory was 122.8MB in the beginning and 145.9MB in the end (delta: -23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 02:44:04,711 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 02:44:04,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 672.97ms. Allocated memory is still 184.5MB. Free memory was 122.2MB in the beginning and 145.9MB in the end (delta: -23.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 02:44:04,713 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.16ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 672.97ms. Allocated memory is still 184.5MB. Free memory was 122.2MB in the beginning and 145.9MB in the end (delta: -23.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 833]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:44:06,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:44:06,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 02:44:06,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:44:06,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:44:06,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:44:06,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:44:06,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:44:06,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:44:06,898 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:44:06,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:44:06,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:44:06,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:44:06,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:44:06,900 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:44:06,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:44:06,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:44:06,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:44:06,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:44:06,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:44:06,902 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:44:06,903 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:44:06,903 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:44:06,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:44:06,904 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:44:06,904 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 02:44:06,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:44:06,905 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 02:44:06,905 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:44:06,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:44:06,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:44:06,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:44:06,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:44:06,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:44:06,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:44:06,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:44:06,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:44:06,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:44:06,908 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 02:44:06,908 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 02:44:06,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:44:06,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:44:06,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:44:06,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:44:06,909 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 -> 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 [2024-11-17 02:44:07,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:44:07,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:44:07,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:44:07,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:44:07,251 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:44:07,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2024-11-17 02:44:08,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:44:09,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:44:09,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2024-11-17 02:44:09,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f45bdd1/1e6189e1b78341459598e50c23cbe070/FLAG0a822a321 [2024-11-17 02:44:09,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f45bdd1/1e6189e1b78341459598e50c23cbe070 [2024-11-17 02:44:09,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:44:09,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:44:09,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:44:09,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:44:09,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:44:09,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:44:09" (1/1) ... [2024-11-17 02:44:09,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8c57d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:09, skipping insertion in model container [2024-11-17 02:44:09,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:44:09" (1/1) ... [2024-11-17 02:44:09,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:44:09,985 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,023 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,032 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,037 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,042 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,082 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,084 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,087 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,090 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,092 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,096 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,098 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,098 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,100 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,109 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:44:10,139 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 02:44:10,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:44:10,187 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,219 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,221 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,223 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,230 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,260 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,260 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,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:44:10,263 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,265 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,267 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,269 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,270 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,271 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,277 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:10,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:44:10,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:44:10,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:44:10,429 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:44:10,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10 WrapperNode [2024-11-17 02:44:10,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:44:10,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:44:10,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:44:10,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:44:10,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,547 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1047 [2024-11-17 02:44:10,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:44:10,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:44:10,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:44:10,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:44:10,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,656 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 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:44:10,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:44:10,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:44:10,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:44:10,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:44:10,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (1/1) ... [2024-11-17 02:44:10,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:44:10,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:44:10,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 02:44:10,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 02:44:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 02:44:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 02:44:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 02:44:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 02:44:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 02:44:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 02:44:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 02:44:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 02:44:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:44:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:44:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 02:44:10,815 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:44:10,815 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:44:10,815 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 02:44:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 02:44:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:44:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:44:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 02:44:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 02:44:10,816 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:44:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:44:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 02:44:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:44:10,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:44:11,046 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:44:11,048 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:44:14,378 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 02:44:14,526 INFO L? ?]: Removed 1100 outVars from TransFormulas that were not future-live. [2024-11-17 02:44:14,526 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:44:14,565 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:44:14,565 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 02:44:14,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:44:14 BoogieIcfgContainer [2024-11-17 02:44:14,566 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:44:14,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:44:14,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:44:14,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:44:14,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:44:09" (1/3) ... [2024-11-17 02:44:14,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d6c027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:44:14, skipping insertion in model container [2024-11-17 02:44:14,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:10" (2/3) ... [2024-11-17 02:44:14,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d6c027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:44:14, skipping insertion in model container [2024-11-17 02:44:14,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:44:14" (3/3) ... [2024-11-17 02:44:14,575 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-2.i [2024-11-17 02:44:14,591 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:44:14,592 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-17 02:44:14,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:44:14,673 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;@4520bf5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:44:14,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-17 02:44:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 1109 states, 569 states have (on average 2.154657293497364) internal successors, (1226), 1102 states have internal predecessors, (1226), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-17 02:44:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:44:14,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:14,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:44:14,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:14,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1276965, now seen corresponding path program 1 times [2024-11-17 02:44:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227374184] [2024-11-17 02:44:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:14,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:14,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:14,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:14,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 02:44:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:14,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:44:14,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:14,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:44:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:14,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:14,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:14,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227374184] [2024-11-17 02:44:14,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227374184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:14,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:14,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:44:14,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121312239] [2024-11-17 02:44:14,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:14,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:44:14,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:14,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:44:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:14,958 INFO L87 Difference]: Start difference. First operand has 1109 states, 569 states have (on average 2.154657293497364) internal successors, (1226), 1102 states have internal predecessors, (1226), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:16,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:16,427 INFO L93 Difference]: Finished difference Result 1279 states and 1356 transitions. [2024-11-17 02:44:16,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:44:16,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 02:44:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:16,446 INFO L225 Difference]: With dead ends: 1279 [2024-11-17 02:44:16,446 INFO L226 Difference]: Without dead ends: 1276 [2024-11-17 02:44:16,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:16,451 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1006 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:16,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 843 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:44:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-17 02:44:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1091. [2024-11-17 02:44:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 569 states have (on average 2.0052724077328645) internal successors, (1141), 1084 states have internal predecessors, (1141), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 02:44:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1159 transitions. [2024-11-17 02:44:16,543 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1159 transitions. Word has length 3 [2024-11-17 02:44:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:16,543 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1159 transitions. [2024-11-17 02:44:16,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1159 transitions. [2024-11-17 02:44:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:44:16,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:16,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:44:16,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 02:44:16,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:16,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:16,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1276966, now seen corresponding path program 1 times [2024-11-17 02:44:16,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:16,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197687792] [2024-11-17 02:44:16,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:16,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:16,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:16,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:16,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 02:44:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:16,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:44:16,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:16,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:44:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:16,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:16,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:16,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197687792] [2024-11-17 02:44:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197687792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:16,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:16,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:44:16,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627645789] [2024-11-17 02:44:16,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:16,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:44:16,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:16,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:44:16,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:16,895 INFO L87 Difference]: Start difference. First operand 1091 states and 1159 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:18,627 INFO L93 Difference]: Finished difference Result 1532 states and 1643 transitions. [2024-11-17 02:44:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:44:18,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 02:44:18,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:18,633 INFO L225 Difference]: With dead ends: 1532 [2024-11-17 02:44:18,633 INFO L226 Difference]: Without dead ends: 1532 [2024-11-17 02:44:18,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:18,634 INFO L432 NwaCegarLoop]: 958 mSDtfsCounter, 473 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:18,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1584 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:44:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-17 02:44:18,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1237. [2024-11-17 02:44:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 711 states have (on average 1.9620253164556962) internal successors, (1395), 1230 states have internal predecessors, (1395), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1423 transitions. [2024-11-17 02:44:18,661 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1423 transitions. Word has length 3 [2024-11-17 02:44:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:18,661 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1423 transitions. [2024-11-17 02:44:18,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1423 transitions. [2024-11-17 02:44:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 02:44:18,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:18,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:44:18,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 02:44:18,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:18,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:18,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash 826341787, now seen corresponding path program 1 times [2024-11-17 02:44:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828241536] [2024-11-17 02:44:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:18,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:18,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:18,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:18,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 02:44:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:18,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:44:18,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:19,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:44:19,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:44:19,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:44:19,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 02:44:19,125 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:44:19,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 02:44:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:19,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:19,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:19,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828241536] [2024-11-17 02:44:19,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828241536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:19,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:44:19,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506139432] [2024-11-17 02:44:19,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:19,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:19,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:19,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:19,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:19,157 INFO L87 Difference]: Start difference. First operand 1237 states and 1423 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:44:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:21,367 INFO L93 Difference]: Finished difference Result 1411 states and 1605 transitions. [2024-11-17 02:44:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:44:21,367 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:44:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:21,372 INFO L225 Difference]: With dead ends: 1411 [2024-11-17 02:44:21,372 INFO L226 Difference]: Without dead ends: 1411 [2024-11-17 02:44:21,372 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:44:21,373 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 2290 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:21,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 506 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 02:44:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-11-17 02:44:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1079. [2024-11-17 02:44:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 569 states have (on average 1.9824253075571177) internal successors, (1128), 1072 states have internal predecessors, (1128), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 02:44:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1146 transitions. [2024-11-17 02:44:21,401 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1146 transitions. Word has length 8 [2024-11-17 02:44:21,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:21,402 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1146 transitions. [2024-11-17 02:44:21,402 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:44:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1146 transitions. [2024-11-17 02:44:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:44:21,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:21,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:44:21,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 02:44:21,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:21,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr520REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:21,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:21,605 INFO L85 PathProgramCache]: Analyzing trace with hash -153207205, now seen corresponding path program 1 times [2024-11-17 02:44:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:21,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845098382] [2024-11-17 02:44:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:21,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:21,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:21,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:21,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 02:44:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:21,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:44:21,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:21,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:44:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:21,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:21,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845098382] [2024-11-17 02:44:21,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845098382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:21,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:21,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:44:21,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625820337] [2024-11-17 02:44:21,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:21,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:44:21,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:21,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:44:21,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:21,742 INFO L87 Difference]: Start difference. First operand 1079 states and 1146 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:44:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:22,907 INFO L93 Difference]: Finished difference Result 1267 states and 1366 transitions. [2024-11-17 02:44:22,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:44:22,911 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:44:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:22,915 INFO L225 Difference]: With dead ends: 1267 [2024-11-17 02:44:22,915 INFO L226 Difference]: Without dead ends: 1267 [2024-11-17 02:44:22,915 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:44:22,916 INFO L432 NwaCegarLoop]: 948 mSDtfsCounter, 781 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:22,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1240 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:44:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2024-11-17 02:44:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1032. [2024-11-17 02:44:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 569 states have (on average 1.8998242530755711) internal successors, (1081), 1025 states have internal predecessors, (1081), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 02:44:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1099 transitions. [2024-11-17 02:44:22,938 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1099 transitions. Word has length 9 [2024-11-17 02:44:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:22,938 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1099 transitions. [2024-11-17 02:44:22,938 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:44:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1099 transitions. [2024-11-17 02:44:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:44:22,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:22,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:44:22,943 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:44:23,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:23,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:23,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash -153207204, now seen corresponding path program 1 times [2024-11-17 02:44:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:23,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17250538] [2024-11-17 02:44:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:23,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:23,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:23,143 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:23,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 02:44:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:23,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:44:23,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:23,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:44:23,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:23,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:23,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:23,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17250538] [2024-11-17 02:44:23,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17250538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:23,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:23,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:44:23,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386553853] [2024-11-17 02:44:23,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:23,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:44:23,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:23,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:44:23,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:23,281 INFO L87 Difference]: Start difference. First operand 1032 states and 1099 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:44:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:24,993 INFO L93 Difference]: Finished difference Result 1345 states and 1447 transitions. [2024-11-17 02:44:24,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:44:24,994 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:44:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:24,997 INFO L225 Difference]: With dead ends: 1345 [2024-11-17 02:44:24,997 INFO L226 Difference]: Without dead ends: 1345 [2024-11-17 02:44:24,998 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:44:24,998 INFO L432 NwaCegarLoop]: 1127 mSDtfsCounter, 528 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:24,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1596 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:44:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-17 02:44:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1061. [2024-11-17 02:44:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 608 states have (on average 1.886513157894737) internal successors, (1147), 1054 states have internal predecessors, (1147), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 02:44:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1165 transitions. [2024-11-17 02:44:25,021 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1165 transitions. Word has length 9 [2024-11-17 02:44:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:25,022 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1165 transitions. [2024-11-17 02:44:25,022 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:44:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1165 transitions. [2024-11-17 02:44:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 02:44:25,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:25,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:44:25,028 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:44:25,226 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:44:25,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:25,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:25,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1263046435, now seen corresponding path program 1 times [2024-11-17 02:44:25,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:25,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625928419] [2024-11-17 02:44:25,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:25,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:25,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:25,229 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:44:25,230 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:44:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:25,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:44:25,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:25,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:25,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:25,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625928419] [2024-11-17 02:44:25,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625928419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:25,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:25,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:44:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247135055] [2024-11-17 02:44:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:25,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:44:25,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:25,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:44:25,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:25,426 INFO L87 Difference]: Start difference. First operand 1061 states and 1165 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:25,648 INFO L93 Difference]: Finished difference Result 1527 states and 1697 transitions. [2024-11-17 02:44:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:44:25,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 02:44:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:25,654 INFO L225 Difference]: With dead ends: 1527 [2024-11-17 02:44:25,654 INFO L226 Difference]: Without dead ends: 1527 [2024-11-17 02:44:25,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:25,655 INFO L432 NwaCegarLoop]: 1151 mSDtfsCounter, 490 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:25,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2148 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:44:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-11-17 02:44:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1253. [2024-11-17 02:44:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 795 states have (on average 1.838993710691824) internal successors, (1462), 1246 states have internal predecessors, (1462), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1490 transitions. [2024-11-17 02:44:25,704 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1490 transitions. Word has length 13 [2024-11-17 02:44:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:25,704 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1490 transitions. [2024-11-17 02:44:25,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1490 transitions. [2024-11-17 02:44:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 02:44:25,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:25,707 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:44:25,713 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:44:25,908 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:44:25,908 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr196REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:25,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash 172708241, now seen corresponding path program 1 times [2024-11-17 02:44:25,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:25,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185684139] [2024-11-17 02:44:25,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:25,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:25,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:25,912 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:44:25,918 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:44:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:26,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:44:26,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:26,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:26,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:26,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185684139] [2024-11-17 02:44:26,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185684139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:26,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:26,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:44:26,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068239025] [2024-11-17 02:44:26,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:26,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:44:26,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:26,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:44:26,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:26,037 INFO L87 Difference]: Start difference. First operand 1253 states and 1490 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:26,066 INFO L93 Difference]: Finished difference Result 1193 states and 1404 transitions. [2024-11-17 02:44:26,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:44:26,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 02:44:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:26,070 INFO L225 Difference]: With dead ends: 1193 [2024-11-17 02:44:26,070 INFO L226 Difference]: Without dead ends: 1193 [2024-11-17 02:44:26,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:26,072 INFO L432 NwaCegarLoop]: 1026 mSDtfsCounter, 71 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1988 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:44:26,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1988 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:44:26,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-17 02:44:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2024-11-17 02:44:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 759 states have (on average 1.8129117259552041) internal successors, (1376), 1186 states have internal predecessors, (1376), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1404 transitions. [2024-11-17 02:44:26,095 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1404 transitions. Word has length 16 [2024-11-17 02:44:26,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:26,095 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1404 transitions. [2024-11-17 02:44:26,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1404 transitions. [2024-11-17 02:44:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 02:44:26,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:26,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:44:26,102 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:44:26,297 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:44:26,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:26,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:26,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1189723966, now seen corresponding path program 1 times [2024-11-17 02:44:26,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:26,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591847694] [2024-11-17 02:44:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:26,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:26,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:26,302 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:44:26,303 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:44:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:26,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:44:26,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:26,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:26,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591847694] [2024-11-17 02:44:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591847694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:26,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:26,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:44:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042982033] [2024-11-17 02:44:26,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:26,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:26,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:26,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:26,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:26,490 INFO L87 Difference]: Start difference. First operand 1193 states and 1404 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:27,027 INFO L93 Difference]: Finished difference Result 1446 states and 1614 transitions. [2024-11-17 02:44:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:44:27,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-17 02:44:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:27,031 INFO L225 Difference]: With dead ends: 1446 [2024-11-17 02:44:27,032 INFO L226 Difference]: Without dead ends: 1446 [2024-11-17 02:44:27,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:44:27,032 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 451 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 3062 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:27,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 3062 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:44:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-11-17 02:44:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1196. [2024-11-17 02:44:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 762 states have (on average 1.8097112860892388) internal successors, (1379), 1189 states have internal predecessors, (1379), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1407 transitions. [2024-11-17 02:44:27,063 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1407 transitions. Word has length 17 [2024-11-17 02:44:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:27,063 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1407 transitions. [2024-11-17 02:44:27,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1407 transitions. [2024-11-17 02:44:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 02:44:27,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:27,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:44:27,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-17 02:44:27,265 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:44:27,266 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:27,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:27,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1773504806, now seen corresponding path program 1 times [2024-11-17 02:44:27,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:27,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153024818] [2024-11-17 02:44:27,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:27,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:27,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:27,271 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:44:27,272 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:44:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:27,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 02:44:27,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:27,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:44:27,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:44:27,435 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:44:27,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 02:44:27,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 02:44:27,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 02:44:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:27,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:27,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:27,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153024818] [2024-11-17 02:44:27,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153024818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:27,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:27,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:44:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13600788] [2024-11-17 02:44:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:27,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:27,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:27,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:27,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:27,519 INFO L87 Difference]: Start difference. First operand 1196 states and 1407 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:27,737 INFO L93 Difference]: Finished difference Result 2045 states and 2279 transitions. [2024-11-17 02:44:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:44:27,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-17 02:44:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:27,745 INFO L225 Difference]: With dead ends: 2045 [2024-11-17 02:44:27,745 INFO L226 Difference]: Without dead ends: 2045 [2024-11-17 02:44:27,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:44:27,746 INFO L432 NwaCegarLoop]: 1236 mSDtfsCounter, 955 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:27,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 3471 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:44:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2024-11-17 02:44:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1195. [2024-11-17 02:44:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 761 states have (on average 1.80946123521682) internal successors, (1377), 1188 states have internal predecessors, (1377), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1405 transitions. [2024-11-17 02:44:27,767 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1405 transitions. Word has length 18 [2024-11-17 02:44:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:27,767 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1405 transitions. [2024-11-17 02:44:27,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1405 transitions. [2024-11-17 02:44:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 02:44:27,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:27,769 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:44:27,776 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:44:27,969 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:44:27,970 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr512REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:27,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1956995277, now seen corresponding path program 1 times [2024-11-17 02:44:27,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:27,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311733657] [2024-11-17 02:44:27,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:27,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:27,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:27,972 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:44:27,973 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:44:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:28,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:44:28,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:28,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:28,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:28,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311733657] [2024-11-17 02:44:28,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311733657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:28,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:28,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:44:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720221432] [2024-11-17 02:44:28,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:28,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:44:28,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:44:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:28,145 INFO L87 Difference]: Start difference. First operand 1195 states and 1405 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:44:28,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:28,181 INFO L93 Difference]: Finished difference Result 1135 states and 1319 transitions. [2024-11-17 02:44:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:44:28,181 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:44:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:28,185 INFO L225 Difference]: With dead ends: 1135 [2024-11-17 02:44:28,185 INFO L226 Difference]: Without dead ends: 1135 [2024-11-17 02:44:28,185 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:44:28,186 INFO L432 NwaCegarLoop]: 983 mSDtfsCounter, 71 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1902 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:44:28,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1902 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:44:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-17 02:44:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2024-11-17 02:44:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 725 states have (on average 1.7806896551724138) internal successors, (1291), 1128 states have internal predecessors, (1291), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1319 transitions. [2024-11-17 02:44:28,205 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1319 transitions. Word has length 20 [2024-11-17 02:44:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:28,205 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1319 transitions. [2024-11-17 02:44:28,205 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:44:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1319 transitions. [2024-11-17 02:44:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 02:44:28,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:28,206 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:44:28,213 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:44:28,410 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:44:28,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr488REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:28,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash -523248223, now seen corresponding path program 1 times [2024-11-17 02:44:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:28,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217977858] [2024-11-17 02:44:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:28,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:28,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:28,413 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:44:28,414 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:44:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:28,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:44:28,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:28,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:28,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:28,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217977858] [2024-11-17 02:44:28,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217977858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:28,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:28,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:44:28,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164480028] [2024-11-17 02:44:28,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:28,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:28,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:28,586 INFO L87 Difference]: Start difference. First operand 1135 states and 1319 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:44:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:28,640 INFO L93 Difference]: Finished difference Result 1105 states and 1261 transitions. [2024-11-17 02:44:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:44:28,640 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:44:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:28,643 INFO L225 Difference]: With dead ends: 1105 [2024-11-17 02:44:28,643 INFO L226 Difference]: Without dead ends: 1105 [2024-11-17 02:44:28,643 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:44:28,643 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 48 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:28,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2787 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:44:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-17 02:44:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1105. [2024-11-17 02:44:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 709 states have (on average 1.7390691114245416) internal successors, (1233), 1098 states have internal predecessors, (1233), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1261 transitions. [2024-11-17 02:44:28,658 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1261 transitions. Word has length 22 [2024-11-17 02:44:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:28,659 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1261 transitions. [2024-11-17 02:44:28,660 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:44:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1261 transitions. [2024-11-17 02:44:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 02:44:28,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:28,661 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:44:28,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 02:44:28,861 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:44:28,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr474REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:28,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1858419639, now seen corresponding path program 1 times [2024-11-17 02:44:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:28,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832278037] [2024-11-17 02:44:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:28,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:28,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:28,864 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:44:28,865 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:44:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:29,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:44:29,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:29,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:44:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:29,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:29,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:29,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832278037] [2024-11-17 02:44:29,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832278037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:29,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:29,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:44:29,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543097140] [2024-11-17 02:44:29,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:29,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:29,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:29,088 INFO L87 Difference]: Start difference. First operand 1105 states and 1261 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:44:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:30,539 INFO L93 Difference]: Finished difference Result 1109 states and 1261 transitions. [2024-11-17 02:44:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:44:30,540 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:44:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:30,542 INFO L225 Difference]: With dead ends: 1109 [2024-11-17 02:44:30,542 INFO L226 Difference]: Without dead ends: 1109 [2024-11-17 02:44:30,543 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:44:30,543 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 671 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:30,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1204 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:44:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-11-17 02:44:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1101. [2024-11-17 02:44:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 709 states have (on average 1.7277856135401974) internal successors, (1225), 1094 states have internal predecessors, (1225), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1253 transitions. [2024-11-17 02:44:30,558 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1253 transitions. Word has length 36 [2024-11-17 02:44:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:30,559 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1253 transitions. [2024-11-17 02:44:30,559 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:44:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1253 transitions. [2024-11-17 02:44:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 02:44:30,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:30,560 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:44:30,567 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:44:30,760 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:44:30,761 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr475REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:30,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:30,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1858419640, now seen corresponding path program 1 times [2024-11-17 02:44:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:30,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275080825] [2024-11-17 02:44:30,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:30,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:30,765 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:44:30,766 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:44:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:30,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:44:30,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:30,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:44:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:31,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:31,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:31,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275080825] [2024-11-17 02:44:31,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275080825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:31,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:31,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:44:31,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911179126] [2024-11-17 02:44:31,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:31,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:31,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:31,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:31,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:31,102 INFO L87 Difference]: Start difference. First operand 1101 states and 1253 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:44:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:33,011 INFO L93 Difference]: Finished difference Result 1430 states and 1624 transitions. [2024-11-17 02:44:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:44:33,012 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:44:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:33,015 INFO L225 Difference]: With dead ends: 1430 [2024-11-17 02:44:33,015 INFO L226 Difference]: Without dead ends: 1430 [2024-11-17 02:44:33,015 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:44:33,016 INFO L432 NwaCegarLoop]: 1113 mSDtfsCounter, 414 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:33,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 2245 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:44:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-17 02:44:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1097. [2024-11-17 02:44:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 709 states have (on average 1.7165021156558533) internal successors, (1217), 1090 states have internal predecessors, (1217), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1245 transitions. [2024-11-17 02:44:33,032 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1245 transitions. Word has length 36 [2024-11-17 02:44:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:33,034 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1245 transitions. [2024-11-17 02:44:33,034 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:44:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1245 transitions. [2024-11-17 02:44:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 02:44:33,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:33,039 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:44:33,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-17 02:44:33,239 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:44:33,240 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr431REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:33,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash -889133902, now seen corresponding path program 1 times [2024-11-17 02:44:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:33,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405879739] [2024-11-17 02:44:33,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:33,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:33,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:33,245 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:44:33,249 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:44:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:33,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:44:33,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:33,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:33,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405879739] [2024-11-17 02:44:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405879739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:33,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:33,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:44:33,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567079846] [2024-11-17 02:44:33,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:33,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:33,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:33,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:33,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:33,535 INFO L87 Difference]: Start difference. First operand 1097 states and 1245 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:44:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:33,590 INFO L93 Difference]: Finished difference Result 1085 states and 1225 transitions. [2024-11-17 02:44:33,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:44:33,590 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:44:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:33,594 INFO L225 Difference]: With dead ends: 1085 [2024-11-17 02:44:33,594 INFO L226 Difference]: Without dead ends: 1085 [2024-11-17 02:44:33,594 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:44:33,595 INFO L432 NwaCegarLoop]: 932 mSDtfsCounter, 21 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2764 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:44:33,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2764 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:44:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-11-17 02:44:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1085. [2024-11-17 02:44:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 697 states have (on average 1.7173601147776183) internal successors, (1197), 1078 states have internal predecessors, (1197), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1225 transitions. [2024-11-17 02:44:33,610 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1225 transitions. Word has length 56 [2024-11-17 02:44:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:33,610 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1225 transitions. [2024-11-17 02:44:33,611 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:44:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1225 transitions. [2024-11-17 02:44:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-17 02:44:33,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:33,614 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:44:33,621 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:44:33,817 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:44:33,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr431REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:33,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:33,818 INFO L85 PathProgramCache]: Analyzing trace with hash 447351546, now seen corresponding path program 1 times [2024-11-17 02:44:33,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:33,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117616868] [2024-11-17 02:44:33,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:33,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:33,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:33,820 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:44:33,821 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:44:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:34,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:44:34,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:34,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:44:34,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:44:34,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:44:34,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 02:44:34,667 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:44:34,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 02:44:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:34,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:34,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:34,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117616868] [2024-11-17 02:44:34,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117616868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:34,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:34,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:44:34,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601167228] [2024-11-17 02:44:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:34,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:34,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:34,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:34,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:34,685 INFO L87 Difference]: Start difference. First operand 1085 states and 1225 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:44:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:35,888 INFO L93 Difference]: Finished difference Result 1047 states and 1187 transitions. [2024-11-17 02:44:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:44:35,888 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:44:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:35,891 INFO L225 Difference]: With dead ends: 1047 [2024-11-17 02:44:35,891 INFO L226 Difference]: Without dead ends: 1047 [2024-11-17 02:44:35,891 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:44:35,892 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 1190 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:35,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 629 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 02:44:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-11-17 02:44:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1008. [2024-11-17 02:44:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 658 states have (on average 1.6458966565349544) internal successors, (1083), 1001 states have internal predecessors, (1083), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1111 transitions. [2024-11-17 02:44:35,905 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1111 transitions. Word has length 64 [2024-11-17 02:44:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:35,905 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1111 transitions. [2024-11-17 02:44:35,905 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:44:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1111 transitions. [2024-11-17 02:44:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-17 02:44:35,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:35,907 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:44:35,917 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:44:36,107 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:44:36,108 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:36,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash -255960520, now seen corresponding path program 1 times [2024-11-17 02:44:36,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:36,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245115022] [2024-11-17 02:44:36,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:36,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:36,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:36,113 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:44:36,114 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:44:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:36,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:44:36,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:36,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:44:36,365 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:44:36,383 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:44:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:36,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:36,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245115022] [2024-11-17 02:44:36,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245115022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:36,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:44:36,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753506027] [2024-11-17 02:44:36,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:36,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:44:36,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:36,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:44:36,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:44:36,392 INFO L87 Difference]: Start difference. First operand 1008 states and 1111 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:44:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:37,809 INFO L93 Difference]: Finished difference Result 1007 states and 1110 transitions. [2024-11-17 02:44:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:44:37,809 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:44:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:37,812 INFO L225 Difference]: With dead ends: 1007 [2024-11-17 02:44:37,812 INFO L226 Difference]: Without dead ends: 1007 [2024-11-17 02:44:37,812 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:44:37,812 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 2 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:37,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2398 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:44:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-11-17 02:44:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2024-11-17 02:44:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 658 states have (on average 1.6443768996960486) internal successors, (1082), 1000 states have internal predecessors, (1082), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1110 transitions. [2024-11-17 02:44:37,824 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1110 transitions. Word has length 69 [2024-11-17 02:44:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:37,824 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1110 transitions. [2024-11-17 02:44:37,825 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:44:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1110 transitions. [2024-11-17 02:44:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-17 02:44:37,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:37,826 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:44:37,834 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:44:38,026 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:44:38,026 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr425REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:38,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash -255960519, now seen corresponding path program 1 times [2024-11-17 02:44:38,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:38,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795411641] [2024-11-17 02:44:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:38,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:38,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:38,030 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:44:38,032 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:44:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:38,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 02:44:38,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:38,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:44:38,295 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:44:38,300 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:44:38,330 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:44:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:38,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:38,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:38,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795411641] [2024-11-17 02:44:38,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795411641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:38,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:38,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:44:38,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850870478] [2024-11-17 02:44:38,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:38,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:44:38,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:38,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:44:38,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:44:38,343 INFO L87 Difference]: Start difference. First operand 1007 states and 1110 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:44:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:40,082 INFO L93 Difference]: Finished difference Result 1006 states and 1109 transitions. [2024-11-17 02:44:40,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:44:40,082 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:44:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:40,085 INFO L225 Difference]: With dead ends: 1006 [2024-11-17 02:44:40,085 INFO L226 Difference]: Without dead ends: 1006 [2024-11-17 02:44:40,085 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:44:40,086 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 1 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:40,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2442 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:44:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2024-11-17 02:44:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2024-11-17 02:44:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 657 states have (on average 1.6453576864535768) internal successors, (1081), 999 states have internal predecessors, (1081), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 02:44:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1109 transitions. [2024-11-17 02:44:40,098 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1109 transitions. Word has length 69 [2024-11-17 02:44:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:40,098 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1109 transitions. [2024-11-17 02:44:40,099 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:44:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1109 transitions. [2024-11-17 02:44:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 02:44:40,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:40,100 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:44:40,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-17 02:44:40,300 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:44:40,300 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:40,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash 781590357, now seen corresponding path program 1 times [2024-11-17 02:44:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:40,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936507064] [2024-11-17 02:44:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:40,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:40,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:40,307 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:44:40,308 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:44:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:40,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:44:40,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:40,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:40,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:40,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936507064] [2024-11-17 02:44:40,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936507064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:40,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:40,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:44:40,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615267502] [2024-11-17 02:44:40,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:40,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:40,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:40,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:40,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:40,638 INFO L87 Difference]: Start difference. First operand 1006 states and 1109 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:44:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:40,664 INFO L93 Difference]: Finished difference Result 1009 states and 1113 transitions. [2024-11-17 02:44:40,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:44:40,665 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:44:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:40,672 INFO L225 Difference]: With dead ends: 1009 [2024-11-17 02:44:40,672 INFO L226 Difference]: Without dead ends: 1009 [2024-11-17 02:44:40,672 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:44:40,673 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 0 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2710 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:44:40,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2710 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:44:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-11-17 02:44:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2024-11-17 02:44:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 659 states have (on average 1.644916540212443) internal successors, (1084), 1002 states have internal predecessors, (1084), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 02:44:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1113 transitions. [2024-11-17 02:44:40,688 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1113 transitions. Word has length 77 [2024-11-17 02:44:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:40,688 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1113 transitions. [2024-11-17 02:44:40,688 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:44:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1113 transitions. [2024-11-17 02:44:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 02:44:40,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:40,689 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:44:40,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-17 02:44:40,889 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:44:40,890 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:40,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:40,890 INFO L85 PathProgramCache]: Analyzing trace with hash 624858892, now seen corresponding path program 1 times [2024-11-17 02:44:40,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:40,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933798003] [2024-11-17 02:44:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:40,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:40,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:40,894 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:44:40,895 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:44:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:41,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:44:41,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:41,206 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:44:41,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:44:41,282 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:44:41,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933798003] [2024-11-17 02:44:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933798003] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:44:41,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:44:41,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 02:44:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579538440] [2024-11-17 02:44:41,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:44:41,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 02:44:41,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:41,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 02:44:41,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:44:41,287 INFO L87 Difference]: Start difference. First operand 1009 states and 1113 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:44:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:41,427 INFO L93 Difference]: Finished difference Result 1021 states and 1130 transitions. [2024-11-17 02:44:41,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:44:41,428 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:44:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:41,431 INFO L225 Difference]: With dead ends: 1021 [2024-11-17 02:44:41,431 INFO L226 Difference]: Without dead ends: 1021 [2024-11-17 02:44:41,432 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:44:41,432 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 5 mSDsluCounter, 3606 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4511 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:41,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4511 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:44:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-11-17 02:44:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1019. [2024-11-17 02:44:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 668 states have (on average 1.6452095808383234) internal successors, (1099), 1011 states have internal predecessors, (1099), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 02:44:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1128 transitions. [2024-11-17 02:44:41,450 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1128 transitions. Word has length 78 [2024-11-17 02:44:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:41,450 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1128 transitions. [2024-11-17 02:44:41,450 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:44:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1128 transitions. [2024-11-17 02:44:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-17 02:44:41,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:41,451 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:44:41,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-17 02:44:41,652 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:44:41,652 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:41,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash -791554795, now seen corresponding path program 2 times [2024-11-17 02:44:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:41,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448479828] [2024-11-17 02:44:41,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 02:44:41,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:41,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:41,657 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:44:41,658 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:44:42,114 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 02:44:42,115 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:44:42,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 02:44:42,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:42,167 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:44:42,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:44:42,288 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:44:42,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:42,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448479828] [2024-11-17 02:44:42,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448479828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:44:42,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:44:42,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 02:44:42,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071531061] [2024-11-17 02:44:42,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:44:42,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:44:42,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:44:42,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:44:42,290 INFO L87 Difference]: Start difference. First operand 1019 states and 1128 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:44:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:42,631 INFO L93 Difference]: Finished difference Result 1034 states and 1150 transitions. [2024-11-17 02:44:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 02:44:42,632 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:44:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:42,635 INFO L225 Difference]: With dead ends: 1034 [2024-11-17 02:44:42,636 INFO L226 Difference]: Without dead ends: 1030 [2024-11-17 02:44:42,636 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:44:42,637 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 8 mSDsluCounter, 8112 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9017 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:42,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9017 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:44:42,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-11-17 02:44:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1028. [2024-11-17 02:44:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 677 states have (on average 1.6410635155096012) internal successors, (1111), 1020 states have internal predecessors, (1111), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 02:44:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1140 transitions. [2024-11-17 02:44:42,653 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1140 transitions. Word has length 81 [2024-11-17 02:44:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:42,654 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1140 transitions. [2024-11-17 02:44:42,654 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:44:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1140 transitions. [2024-11-17 02:44:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 02:44:42,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:42,655 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:44:42,666 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 (21)] Forceful destruction successful, exit code 0 [2024-11-17 02:44:42,856 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:44:42,856 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:42,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1146536373, now seen corresponding path program 3 times [2024-11-17 02:44:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:42,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142476769] [2024-11-17 02:44:42,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 02:44:42,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:42,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:42,860 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:44:42,861 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:44:43,524 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 02:44:43,524 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:44:43,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 02:44:43,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:43,654 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:44:43,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:44:44,106 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:44:44,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142476769] [2024-11-17 02:44:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142476769] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:44:44,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:44:44,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 02:44:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659819839] [2024-11-17 02:44:44,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:44:44,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:44:44,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:44:44,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 02:44:44,109 INFO L87 Difference]: Start difference. First operand 1028 states and 1140 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:44:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:45,600 INFO L93 Difference]: Finished difference Result 1052 states and 1179 transitions. [2024-11-17 02:44:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 02:44:45,600 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:44:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:45,604 INFO L225 Difference]: With dead ends: 1052 [2024-11-17 02:44:45,604 INFO L226 Difference]: Without dead ends: 1046 [2024-11-17 02:44:45,605 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:44:45,605 INFO L432 NwaCegarLoop]: 906 mSDtfsCounter, 26 mSDsluCounter, 9935 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10841 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:45,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10841 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:44:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-17 02:44:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2024-11-17 02:44:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 695 states have (on average 1.6316546762589927) internal successors, (1134), 1038 states have internal predecessors, (1134), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 02:44:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1163 transitions. [2024-11-17 02:44:45,623 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1163 transitions. Word has length 87 [2024-11-17 02:44:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:45,623 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1163 transitions. [2024-11-17 02:44:45,623 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:44:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1163 transitions. [2024-11-17 02:44:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:44:45,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:45,624 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:44:45,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-17 02:44:45,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:45,825 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:45,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2093396725, now seen corresponding path program 4 times [2024-11-17 02:44:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:45,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742762088] [2024-11-17 02:44:45,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 02:44:45,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:45,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:45,827 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:45,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-17 02:44:46,243 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 02:44:46,243 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:44:46,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 02:44:46,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:46,604 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:44:46,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:44:47,814 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:44:47,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:47,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742762088] [2024-11-17 02:44:47,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742762088] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:44:47,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:44:47,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 02:44:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528645846] [2024-11-17 02:44:47,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:44:47,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 02:44:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:47,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 02:44:47,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 02:44:47,817 INFO L87 Difference]: Start difference. First operand 1046 states and 1163 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:44:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:52,359 INFO L93 Difference]: Finished difference Result 1086 states and 1235 transitions. [2024-11-17 02:44:52,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 02:44:52,361 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:44:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:52,365 INFO L225 Difference]: With dead ends: 1086 [2024-11-17 02:44:52,365 INFO L226 Difference]: Without dead ends: 1082 [2024-11-17 02:44:52,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 02:44:52,368 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 32 mSDsluCounter, 20750 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 21655 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:52,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 21655 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:44:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-11-17 02:44:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2024-11-17 02:44:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 729 states have (on average 1.6186556927297668) internal successors, (1180), 1072 states have internal predecessors, (1180), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 02:44:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1209 transitions. [2024-11-17 02:44:52,384 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1209 transitions. Word has length 99 [2024-11-17 02:44:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:52,384 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1209 transitions. [2024-11-17 02:44:52,384 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:44:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1209 transitions. [2024-11-17 02:44:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-17 02:44:52,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:52,386 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:44:52,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-17 02:44:52,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:52,586 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 02:44:52,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash -520696171, now seen corresponding path program 5 times [2024-11-17 02:44:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:52,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673365743] [2024-11-17 02:44:52,588 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:44:52,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:52,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:52,589 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:52,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-17 02:44:53,701 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-17 02:44:53,701 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:44:53,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-17 02:44:53,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:53,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:44:53,827 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-17 02:44:53,827 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:44:53,852 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:44:53,922 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:44:54,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:44:54,816 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:44:54,862 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:44:54,891 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:44:54,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:44:55,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2024 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2024) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-17 02:44:55,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673365743] [2024-11-17 02:44:55,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673365743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:44:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1860417755] [2024-11-17 02:44:55,207 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:44:55,207 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 02:44:55,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 02:44:55,210 INFO L229 MonitoredProcess]: Starting monitored process 25 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:44:55,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process