./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-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 6fff6eb11b5ece9f2655331435003a1af77ee5ac869f244677acc531eb435a19 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:11:06,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:11:06,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:11:06,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:11:06,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:11:06,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:11:06,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:11:06,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:11:06,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:11:06,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:11:06,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:11:06,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:11:06,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:11:06,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:11:06,169 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:11:06,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:11:06,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:11:06,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:11:06,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:11:06,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:11:06,171 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:11:06,173 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:11:06,173 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:11:06,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:11:06,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:11:06,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:11:06,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:11:06,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:11:06,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:11:06,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:11:06,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:11:06,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:11:06,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:11:06,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:11:06,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:11:06,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:11:06,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:11:06,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:11:06,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:11:06,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:11:06,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:11:06,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:11:06,183 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 -> 6fff6eb11b5ece9f2655331435003a1af77ee5ac869f244677acc531eb435a19 [2024-11-22 21:11:06,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:11:06,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:11:06,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:11:06,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:11:06,485 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:11:06,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-2.i [2024-11-22 21:11:08,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:11:08,334 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:11:08,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-2.i [2024-11-22 21:11:08,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbabac11c/4956a8d024f3405487a096ee6d883877/FLAG903f367e6 [2024-11-22 21:11:08,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbabac11c/4956a8d024f3405487a096ee6d883877 [2024-11-22 21:11:08,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:11:08,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:11:08,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:11:08,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:11:08,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:11:08,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:11:08" (1/1) ... [2024-11-22 21:11:08,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4a3a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:08, skipping insertion in model container [2024-11-22 21:11:08,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:11:08" (1/1) ... [2024-11-22 21:11:08,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:11:08,957 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:08,999 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,005 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,013 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,025 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,096 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,099 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,101 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,106 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,117 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,119 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,121 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,123 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,129 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,130 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,135 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:09,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:11:09,222 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-22 21:11:09,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5fb90ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:09, skipping insertion in model container [2024-11-22 21:11:09,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:11:09,223 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 21:11:09,229 INFO L158 Benchmark]: Toolchain (without parser) took 835.82ms. Allocated memory is still 197.1MB. Free memory was 122.3MB in the beginning and 158.4MB in the end (delta: -36.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-22 21:11:09,230 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 197.1MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:11:09,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 828.81ms. Allocated memory is still 197.1MB. Free memory was 122.1MB in the beginning and 158.4MB in the end (delta: -36.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-22 21:11:09,235 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.18ms. Allocated memory is still 197.1MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 828.81ms. Allocated memory is still 197.1MB. Free memory was 122.1MB in the beginning and 158.4MB in the end (delta: -36.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-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 6fff6eb11b5ece9f2655331435003a1af77ee5ac869f244677acc531eb435a19 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:11:11,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:11:11,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:11:11,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:11:11,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:11:11,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:11:11,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:11:11,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:11:11,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:11:11,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:11:11,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:11:11,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:11:11,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:11:11,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:11:11,550 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:11:11,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:11:11,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:11:11,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:11:11,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:11:11,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:11:11,552 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:11:11,554 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:11:11,554 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:11:11,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:11:11,555 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:11:11,555 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:11:11,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:11:11,555 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:11:11,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:11:11,556 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:11:11,556 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:11:11,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:11:11,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:11:11,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:11:11,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:11:11,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:11:11,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:11:11,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:11:11,559 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:11:11,560 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:11:11,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:11:11,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:11:11,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:11:11,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:11:11,561 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 -> 6fff6eb11b5ece9f2655331435003a1af77ee5ac869f244677acc531eb435a19 [2024-11-22 21:11:11,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:11:11,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:11:11,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:11:11,958 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:11:11,959 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:11:11,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-2.i [2024-11-22 21:11:13,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:11:13,824 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:11:13,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-2.i [2024-11-22 21:11:13,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bffd110d/37ce6e7535bf45e39a1aeb06ca8bcf86/FLAGe1572c7f6 [2024-11-22 21:11:14,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bffd110d/37ce6e7535bf45e39a1aeb06ca8bcf86 [2024-11-22 21:11:14,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:11:14,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:11:14,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:11:14,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:11:14,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:11:14,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:11:14" (1/1) ... [2024-11-22 21:11:14,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25abc082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:14, skipping insertion in model container [2024-11-22 21:11:14,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:11:14" (1/1) ... [2024-11-22 21:11:14,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:11:14,533 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,566 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,575 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,579 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,598 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,645 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,648 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,652 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,656 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,665 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,666 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,668 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,669 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,670 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,671 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,679 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:11:14,709 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 21:11:14,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:11:14,758 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,783 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,784 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,791 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,797 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,831 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,833 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,835 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,844 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,851 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,856 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,857 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,859 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,859 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,860 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,862 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:11:14,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:11:14,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:11:14,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:11:15,032 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:11:15,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15 WrapperNode [2024-11-22 21:11:15,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:11:15,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:11:15,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:11:15,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:11:15,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,161 INFO L138 Inliner]: procedures = 179, calls = 387, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1351 [2024-11-22 21:11:15,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:11:15,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:11:15,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:11:15,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:11:15,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,313 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [355, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 90 writes are split as follows [90, 0]. [2024-11-22 21:11:15,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:11:15,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:11:15,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:11:15,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:11:15,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (1/1) ... [2024-11-22 21:11:15,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:11:15,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:11:15,473 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-22 21:11:15,477 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-22 21:11:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 21:11:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 21:11:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 21:11:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 21:11:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 21:11:15,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 21:11:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 21:11:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 21:11:15,515 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 21:11:15,515 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 21:11:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:11:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:11:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 21:11:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 21:11:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 21:11:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 21:11:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 21:11:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 21:11:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 21:11:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:11:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 21:11:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:11:15,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:11:15,766 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:11:15,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:11:15,772 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:11:15,829 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:11:20,786 INFO L? ?]: Removed 1547 outVars from TransFormulas that were not future-live. [2024-11-22 21:11:20,786 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:11:20,842 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:11:20,842 INFO L316 CfgBuilder]: Removed 69 assume(true) statements. [2024-11-22 21:11:20,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:11:20 BoogieIcfgContainer [2024-11-22 21:11:20,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:11:20,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:11:20,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:11:20,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:11:20,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:11:14" (1/3) ... [2024-11-22 21:11:20,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d20410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:11:20, skipping insertion in model container [2024-11-22 21:11:20,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:15" (2/3) ... [2024-11-22 21:11:20,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d20410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:11:20, skipping insertion in model container [2024-11-22 21:11:20,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:11:20" (3/3) ... [2024-11-22 21:11:20,854 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-2.i [2024-11-22 21:11:20,871 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:11:20,872 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 733 error locations. [2024-11-22 21:11:20,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:11:20,966 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;@451a6253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:11:20,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 733 error locations. [2024-11-22 21:11:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 1451 states, 705 states have (on average 2.2411347517730498) internal successors, (1580), 1442 states have internal predecessors, (1580), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 21:11:20,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:20,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:11:20,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:20,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-22 21:11:21,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:21,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665107120] [2024-11-22 21:11:21,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:21,002 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-22 21:11:21,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:21,005 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-22 21:11:21,018 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-22 21:11:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:21,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:11:21,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:21,259 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-22 21:11:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:11:21,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:21,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665107120] [2024-11-22 21:11:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665107120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:11:21,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102980213] [2024-11-22 21:11:21,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:21,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:11:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:21,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:11:21,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:11:21,333 INFO L87 Difference]: Start difference. First operand has 1451 states, 705 states have (on average 2.2411347517730498) internal successors, (1580), 1442 states have internal predecessors, (1580), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-22 21:11:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:23,410 INFO L93 Difference]: Finished difference Result 1340 states and 1424 transitions. [2024-11-22 21:11:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:11:23,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-22 21:11:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:23,429 INFO L225 Difference]: With dead ends: 1340 [2024-11-22 21:11:23,429 INFO L226 Difference]: Without dead ends: 1338 [2024-11-22 21:11:23,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-22 21:11:23,433 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 1042 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:23,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 926 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-22 21:11:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-11-22 21:11:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1336. [2024-11-22 21:11:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 695 states have (on average 1.9956834532374101) internal successors, (1387), 1327 states have internal predecessors, (1387), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1419 transitions. [2024-11-22 21:11:23,537 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1419 transitions. Word has length 5 [2024-11-22 21:11:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:23,538 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1419 transitions. [2024-11-22 21:11:23,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-22 21:11:23,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1419 transitions. [2024-11-22 21:11:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 21:11:23,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:23,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:11:23,542 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-22 21:11:23,739 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-22 21:11:23,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:23,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-22 21:11:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874867150] [2024-11-22 21:11:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:23,742 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-22 21:11:23,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:23,744 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-22 21:11:23,745 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-22 21:11:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:23,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:11:23,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:23,918 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-22 21:11:23,940 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-22 21:11:23,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:23,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:23,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874867150] [2024-11-22 21:11:23,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874867150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:23,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:23,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:11:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950897317] [2024-11-22 21:11:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:23,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:11:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:11:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:11:23,946 INFO L87 Difference]: Start difference. First operand 1336 states and 1419 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-22 21:11:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:26,724 INFO L93 Difference]: Finished difference Result 1656 states and 1759 transitions. [2024-11-22 21:11:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:11:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-22 21:11:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:26,731 INFO L225 Difference]: With dead ends: 1656 [2024-11-22 21:11:26,731 INFO L226 Difference]: Without dead ends: 1656 [2024-11-22 21:11:26,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-22 21:11:26,733 INFO L432 NwaCegarLoop]: 1174 mSDtfsCounter, 522 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:26,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1760 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-22 21:11:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2024-11-22 21:11:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1503. [2024-11-22 21:11:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 872 states have (on average 1.9575688073394495) internal successors, (1707), 1494 states have internal predecessors, (1707), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1739 transitions. [2024-11-22 21:11:26,767 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1739 transitions. Word has length 5 [2024-11-22 21:11:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:26,768 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1739 transitions. [2024-11-22 21:11:26,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-22 21:11:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1739 transitions. [2024-11-22 21:11:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 21:11:26,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:26,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:11:26,773 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-22 21:11:26,972 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-22 21:11:26,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:26,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1423825295, now seen corresponding path program 1 times [2024-11-22 21:11:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:26,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534740177] [2024-11-22 21:11:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:26,974 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-22 21:11:26,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:26,977 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-22 21:11:26,978 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-22 21:11:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:27,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:11:27,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:27,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-22 21:11:27,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:27,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:27,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534740177] [2024-11-22 21:11:27,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534740177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:27,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:27,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:11:27,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230452292] [2024-11-22 21:11:27,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:27,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:11:27,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:27,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:11:27,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:11:27,103 INFO L87 Difference]: Start difference. First operand 1503 states and 1739 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:11:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:27,198 INFO L93 Difference]: Finished difference Result 2755 states and 3196 transitions. [2024-11-22 21:11:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:11:27,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-22 21:11:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:27,239 INFO L225 Difference]: With dead ends: 2755 [2024-11-22 21:11:27,241 INFO L226 Difference]: Without dead ends: 2755 [2024-11-22 21:11:27,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-22 21:11:27,243 INFO L432 NwaCegarLoop]: 1892 mSDtfsCounter, 1114 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:27,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 3296 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 21:11:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2024-11-22 21:11:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1504. [2024-11-22 21:11:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 873 states have (on average 1.956471935853379) internal successors, (1708), 1495 states have internal predecessors, (1708), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1740 transitions. [2024-11-22 21:11:27,287 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1740 transitions. Word has length 6 [2024-11-22 21:11:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:27,288 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1740 transitions. [2024-11-22 21:11:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:11:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1740 transitions. [2024-11-22 21:11:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 21:11:27,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:27,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:11:27,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 21:11:27,491 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-22 21:11:27,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:27,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-22 21:11:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649854305] [2024-11-22 21:11:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:27,493 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-22 21:11:27,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:27,496 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-22 21:11:27,497 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-22 21:11:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:27,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:11:27,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:27,657 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-22 21:11:27,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:27,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:27,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649854305] [2024-11-22 21:11:27,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649854305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:27,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:27,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:11:27,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082442449] [2024-11-22 21:11:27,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:27,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:11:27,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:27,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:11:27,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:11:27,660 INFO L87 Difference]: Start difference. First operand 1504 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-22 21:11:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:27,698 INFO L93 Difference]: Finished difference Result 1462 states and 1697 transitions. [2024-11-22 21:11:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:11:27,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-22 21:11:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:27,705 INFO L225 Difference]: With dead ends: 1462 [2024-11-22 21:11:27,705 INFO L226 Difference]: Without dead ends: 1462 [2024-11-22 21:11:27,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-22 21:11:27,706 INFO L432 NwaCegarLoop]: 1354 mSDtfsCounter, 71 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2645 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-22 21:11:27,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2645 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:11:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2024-11-22 21:11:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1462. [2024-11-22 21:11:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 855 states have (on average 1.9473684210526316) internal successors, (1665), 1453 states have internal predecessors, (1665), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1697 transitions. [2024-11-22 21:11:27,736 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1697 transitions. Word has length 11 [2024-11-22 21:11:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:27,736 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 1697 transitions. [2024-11-22 21:11:27,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-22 21:11:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1697 transitions. [2024-11-22 21:11:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 21:11:27,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:27,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:11:27,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 21:11:27,937 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-22 21:11:27,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:27,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash 614317568, now seen corresponding path program 1 times [2024-11-22 21:11:27,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:27,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970310904] [2024-11-22 21:11:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:27,940 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-22 21:11:27,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:27,942 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-22 21:11:27,943 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-22 21:11:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:28,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:11:28,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:28,110 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-22 21:11:28,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:28,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970310904] [2024-11-22 21:11:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970310904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:28,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:28,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:11:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314137437] [2024-11-22 21:11:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:28,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:11:28,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:28,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:11:28,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:11:28,112 INFO L87 Difference]: Start difference. First operand 1462 states and 1697 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-22 21:11:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:28,216 INFO L93 Difference]: Finished difference Result 1440 states and 1668 transitions. [2024-11-22 21:11:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:11:28,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-22 21:11:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:28,223 INFO L225 Difference]: With dead ends: 1440 [2024-11-22 21:11:28,223 INFO L226 Difference]: Without dead ends: 1440 [2024-11-22 21:11:28,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-22 21:11:28,225 INFO L432 NwaCegarLoop]: 1309 mSDtfsCounter, 48 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3901 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:28,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3901 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 21:11:28,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-11-22 21:11:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2024-11-22 21:11:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 847 states have (on average 1.9315230224321134) internal successors, (1636), 1431 states have internal predecessors, (1636), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1668 transitions. [2024-11-22 21:11:28,262 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1668 transitions. Word has length 13 [2024-11-22 21:11:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:28,262 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 1668 transitions. [2024-11-22 21:11:28,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-22 21:11:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1668 transitions. [2024-11-22 21:11:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 21:11:28,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:28,264 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] [2024-11-22 21:11:28,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 21:11:28,468 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-22 21:11:28,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:28,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash -957630610, now seen corresponding path program 1 times [2024-11-22 21:11:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:28,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414553578] [2024-11-22 21:11:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:28,470 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-22 21:11:28,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:28,471 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-22 21:11:28,472 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-22 21:11:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:28,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:11:28,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:28,633 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-22 21:11:28,699 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-22 21:11:28,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:28,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:28,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414553578] [2024-11-22 21:11:28,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414553578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:28,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:28,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:11:28,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835871852] [2024-11-22 21:11:28,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:28,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:11:28,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:28,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:11:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:11:28,701 INFO L87 Difference]: Start difference. First operand 1440 states and 1668 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-22 21:11:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:31,147 INFO L93 Difference]: Finished difference Result 1440 states and 1668 transitions. [2024-11-22 21:11:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:11:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-22 21:11:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:31,153 INFO L225 Difference]: With dead ends: 1440 [2024-11-22 21:11:31,153 INFO L226 Difference]: Without dead ends: 1440 [2024-11-22 21:11:31,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-22 21:11:31,154 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 979 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:31,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1462 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-22 21:11:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-11-22 21:11:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1436. [2024-11-22 21:11:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 847 states have (on average 1.9268004722550176) internal successors, (1632), 1427 states have internal predecessors, (1632), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1664 transitions. [2024-11-22 21:11:31,184 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1664 transitions. Word has length 27 [2024-11-22 21:11:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:31,184 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 1664 transitions. [2024-11-22 21:11:31,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-22 21:11:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1664 transitions. [2024-11-22 21:11:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 21:11:31,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:31,185 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] [2024-11-22 21:11:31,192 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-22 21:11:31,386 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-22 21:11:31,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:31,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:31,387 INFO L85 PathProgramCache]: Analyzing trace with hash -957630609, now seen corresponding path program 1 times [2024-11-22 21:11:31,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:31,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487149002] [2024-11-22 21:11:31,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:31,388 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-22 21:11:31,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:31,391 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-22 21:11:31,393 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-22 21:11:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:31,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:11:31,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:31,542 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-22 21:11:31,714 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-22 21:11:31,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:31,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:31,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487149002] [2024-11-22 21:11:31,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487149002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:31,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:11:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15475794] [2024-11-22 21:11:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:31,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:11:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:31,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:11:31,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:11:31,716 INFO L87 Difference]: Start difference. First operand 1436 states and 1664 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-22 21:11:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:34,277 INFO L93 Difference]: Finished difference Result 1589 states and 1684 transitions. [2024-11-22 21:11:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:11:34,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-22 21:11:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:34,282 INFO L225 Difference]: With dead ends: 1589 [2024-11-22 21:11:34,282 INFO L226 Difference]: Without dead ends: 1589 [2024-11-22 21:11:34,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-22 21:11:34,283 INFO L432 NwaCegarLoop]: 1128 mSDtfsCounter, 455 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:34,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 2345 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-22 21:11:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2024-11-22 21:11:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1432. [2024-11-22 21:11:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 847 states have (on average 1.922077922077922) internal successors, (1628), 1423 states have internal predecessors, (1628), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1660 transitions. [2024-11-22 21:11:34,317 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1660 transitions. Word has length 27 [2024-11-22 21:11:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:34,317 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1660 transitions. [2024-11-22 21:11:34,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-22 21:11:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1660 transitions. [2024-11-22 21:11:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 21:11:34,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:34,319 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] [2024-11-22 21:11:34,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 21:11:34,519 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-22 21:11:34,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:34,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash -3860248, now seen corresponding path program 1 times [2024-11-22 21:11:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395706347] [2024-11-22 21:11:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:34,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:11:34,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:34,525 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-22 21:11:34,526 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-22 21:11:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:34,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:11:34,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:34,773 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-22 21:11:34,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:34,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:34,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395706347] [2024-11-22 21:11:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395706347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:34,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:34,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:11:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932045956] [2024-11-22 21:11:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:34,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:11:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:34,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:11:34,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:11:34,779 INFO L87 Difference]: Start difference. First operand 1432 states and 1660 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-22 21:11:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:34,839 INFO L93 Difference]: Finished difference Result 1426 states and 1650 transitions. [2024-11-22 21:11:34,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:11:34,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2024-11-22 21:11:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:34,844 INFO L225 Difference]: With dead ends: 1426 [2024-11-22 21:11:34,844 INFO L226 Difference]: Without dead ends: 1426 [2024-11-22 21:11:34,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-22 21:11:34,846 INFO L432 NwaCegarLoop]: 1303 mSDtfsCounter, 21 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3878 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-22 21:11:34,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3878 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:11:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-11-22 21:11:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2024-11-22 21:11:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 841 states have (on average 1.9239001189060643) internal successors, (1618), 1417 states have internal predecessors, (1618), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1650 transitions. [2024-11-22 21:11:34,873 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1650 transitions. Word has length 43 [2024-11-22 21:11:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:34,873 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 1650 transitions. [2024-11-22 21:11:34,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-22 21:11:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1650 transitions. [2024-11-22 21:11:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 21:11:34,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:34,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:11:34,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 21:11:35,081 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-22 21:11:35,082 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:35,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:35,083 INFO L85 PathProgramCache]: Analyzing trace with hash 168131124, now seen corresponding path program 1 times [2024-11-22 21:11:35,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:35,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937373168] [2024-11-22 21:11:35,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:35,083 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-22 21:11:35,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:35,084 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-22 21:11:35,086 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-22 21:11:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:35,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:11:35,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:35,555 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-22 21:11:35,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:35,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:35,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937373168] [2024-11-22 21:11:35,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937373168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:35,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:35,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:11:35,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055356862] [2024-11-22 21:11:35,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:35,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:11:35,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:35,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:11:35,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:11:35,559 INFO L87 Difference]: Start difference. First operand 1426 states and 1650 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-22 21:11:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:35,732 INFO L93 Difference]: Finished difference Result 1644 states and 1897 transitions. [2024-11-22 21:11:35,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:11:35,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2024-11-22 21:11:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:35,738 INFO L225 Difference]: With dead ends: 1644 [2024-11-22 21:11:35,739 INFO L226 Difference]: Without dead ends: 1644 [2024-11-22 21:11:35,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-22 21:11:35,740 INFO L432 NwaCegarLoop]: 1390 mSDtfsCounter, 178 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:35,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 2643 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 21:11:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-22 21:11:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1473. [2024-11-22 21:11:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 888 states have (on average 1.875) internal successors, (1665), 1464 states have internal predecessors, (1665), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 1697 transitions. [2024-11-22 21:11:35,762 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 1697 transitions. Word has length 51 [2024-11-22 21:11:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:35,763 INFO L471 AbstractCegarLoop]: Abstraction has 1473 states and 1697 transitions. [2024-11-22 21:11:35,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-22 21:11:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1697 transitions. [2024-11-22 21:11:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 21:11:35,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:35,765 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] [2024-11-22 21:11:35,773 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-22 21:11:35,966 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-22 21:11:35,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:35,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash 754975115, now seen corresponding path program 1 times [2024-11-22 21:11:35,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:35,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603453611] [2024-11-22 21:11:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:35,967 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-22 21:11:35,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:35,971 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-22 21:11:35,972 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-22 21:11:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:36,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:11:36,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:36,293 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-22 21:11:36,302 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-22 21:11:36,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:11:36,721 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-22 21:11:36,738 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 21:11:36,739 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-22 21:11:36,755 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-22 21:11:36,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:36,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:36,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603453611] [2024-11-22 21:11:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603453611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:36,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:36,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:11:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700951175] [2024-11-22 21:11:36,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:36,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:11:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:36,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:11:36,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:11:36,758 INFO L87 Difference]: Start difference. First operand 1473 states and 1697 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-22 21:11:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:38,834 INFO L93 Difference]: Finished difference Result 1389 states and 1613 transitions. [2024-11-22 21:11:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:11:38,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2024-11-22 21:11:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:38,837 INFO L225 Difference]: With dead ends: 1389 [2024-11-22 21:11:38,837 INFO L226 Difference]: Without dead ends: 1389 [2024-11-22 21:11:38,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-22 21:11:38,838 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 1764 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:38,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 731 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-22 21:11:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-22 21:11:38,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1212. [2024-11-22 21:11:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 711 states have (on average 1.759493670886076) internal successors, (1251), 1203 states have internal predecessors, (1251), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1283 transitions. [2024-11-22 21:11:38,853 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1283 transitions. Word has length 54 [2024-11-22 21:11:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:38,853 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1283 transitions. [2024-11-22 21:11:38,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-22 21:11:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1283 transitions. [2024-11-22 21:11:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 21:11:38,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:38,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:11:38,865 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-22 21:11:39,055 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-22 21:11:39,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:39,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100217, now seen corresponding path program 1 times [2024-11-22 21:11:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:39,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264267801] [2024-11-22 21:11:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:39,056 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-22 21:11:39,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:39,058 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-22 21:11:39,059 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-22 21:11:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:39,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:11:39,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:39,314 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-22 21:11:39,329 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-22 21:11:39,351 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-22 21:11:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:11:39,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:39,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:39,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264267801] [2024-11-22 21:11:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264267801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:39,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:11:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593058821] [2024-11-22 21:11:39,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:39,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:11:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:11:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:11:39,360 INFO L87 Difference]: Start difference. First operand 1212 states and 1283 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-22 21:11:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:41,473 INFO L93 Difference]: Finished difference Result 1211 states and 1282 transitions. [2024-11-22 21:11:41,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:11:41,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-22 21:11:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:41,477 INFO L225 Difference]: With dead ends: 1211 [2024-11-22 21:11:41,477 INFO L226 Difference]: Without dead ends: 1211 [2024-11-22 21:11:41,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-22 21:11:41,478 INFO L432 NwaCegarLoop]: 1230 mSDtfsCounter, 2 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:41,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3145 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 21:11:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-11-22 21:11:41,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1211. [2024-11-22 21:11:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 711 states have (on average 1.7580872011251758) internal successors, (1250), 1202 states have internal predecessors, (1250), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1282 transitions. [2024-11-22 21:11:41,492 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1282 transitions. Word has length 59 [2024-11-22 21:11:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:41,493 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1282 transitions. [2024-11-22 21:11:41,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-22 21:11:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1282 transitions. [2024-11-22 21:11:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 21:11:41,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:41,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:11:41,502 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-22 21:11:41,694 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-22 21:11:41,695 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:41,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100216, now seen corresponding path program 1 times [2024-11-22 21:11:41,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:41,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798490606] [2024-11-22 21:11:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:41,697 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-22 21:11:41,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:41,699 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-22 21:11:41,701 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-22 21:11:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:41,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 21:11:41,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:41,944 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-22 21:11:41,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 21:11:41,972 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-22 21:11:42,013 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-22 21:11:42,029 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-22 21:11:42,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:42,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:42,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798490606] [2024-11-22 21:11:42,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798490606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:42,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:42,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:11:42,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900394151] [2024-11-22 21:11:42,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:42,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:11:42,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:11:42,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:11:42,032 INFO L87 Difference]: Start difference. First operand 1211 states and 1282 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-22 21:11:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:44,567 INFO L93 Difference]: Finished difference Result 1210 states and 1281 transitions. [2024-11-22 21:11:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:11:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-22 21:11:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:44,573 INFO L225 Difference]: With dead ends: 1210 [2024-11-22 21:11:44,573 INFO L226 Difference]: Without dead ends: 1210 [2024-11-22 21:11:44,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-22 21:11:44,574 INFO L432 NwaCegarLoop]: 1230 mSDtfsCounter, 1 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:44,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3176 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-22 21:11:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-11-22 21:11:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2024-11-22 21:11:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 710 states have (on average 1.7591549295774649) internal successors, (1249), 1201 states have internal predecessors, (1249), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:11:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1281 transitions. [2024-11-22 21:11:44,593 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1281 transitions. Word has length 59 [2024-11-22 21:11:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:44,593 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1281 transitions. [2024-11-22 21:11:44,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-22 21:11:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1281 transitions. [2024-11-22 21:11:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 21:11:44,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:44,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:11:44,603 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 (13)] Ended with exit code 0 [2024-11-22 21:11:44,795 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-22 21:11:44,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:44,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash 585606222, now seen corresponding path program 1 times [2024-11-22 21:11:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:44,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266543105] [2024-11-22 21:11:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:44,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:11:44,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:44,798 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-22 21:11:44,800 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-22 21:11:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:45,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:11:45,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:45,093 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-22 21:11:45,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:11:45,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:45,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266543105] [2024-11-22 21:11:45,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266543105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:11:45,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:11:45,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:11:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744115316] [2024-11-22 21:11:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:11:45,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:11:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:45,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:11:45,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:11:45,096 INFO L87 Difference]: Start difference. First operand 1210 states and 1281 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-22 21:11:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:45,143 INFO L93 Difference]: Finished difference Result 1213 states and 1286 transitions. [2024-11-22 21:11:45,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:11:45,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 67 [2024-11-22 21:11:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:45,151 INFO L225 Difference]: With dead ends: 1213 [2024-11-22 21:11:45,151 INFO L226 Difference]: Without dead ends: 1213 [2024-11-22 21:11:45,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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-22 21:11:45,153 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 0 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3679 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:45,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3679 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:11:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-11-22 21:11:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2024-11-22 21:11:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 712 states have (on average 1.7584269662921348) internal successors, (1252), 1204 states have internal predecessors, (1252), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-22 21:11:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1286 transitions. [2024-11-22 21:11:45,173 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1286 transitions. Word has length 67 [2024-11-22 21:11:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:45,173 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1286 transitions. [2024-11-22 21:11:45,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-22 21:11:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1286 transitions. [2024-11-22 21:11:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-22 21:11:45,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:45,175 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] [2024-11-22 21:11:45,183 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-22 21:11:45,375 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-22 21:11:45,376 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:45,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1528808918, now seen corresponding path program 1 times [2024-11-22 21:11:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:45,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430159122] [2024-11-22 21:11:45,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:11:45,378 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-22 21:11:45,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:45,380 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-22 21:11:45,382 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-22 21:11:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:11:45,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:11:45,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:45,674 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-22 21:11:45,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:11:45,741 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-22 21:11:45,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:45,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430159122] [2024-11-22 21:11:45,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430159122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:11:45,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:11:45,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 21:11:45,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082408299] [2024-11-22 21:11:45,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:11:45,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:11:45,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:45,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:11:45,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:11:45,744 INFO L87 Difference]: Start difference. First operand 1213 states and 1286 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-22 21:11:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:45,861 INFO L93 Difference]: Finished difference Result 1225 states and 1304 transitions. [2024-11-22 21:11:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:11:45,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 68 [2024-11-22 21:11:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:45,866 INFO L225 Difference]: With dead ends: 1225 [2024-11-22 21:11:45,866 INFO L226 Difference]: Without dead ends: 1225 [2024-11-22 21:11:45,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 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-22 21:11:45,867 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 8 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3679 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:45,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3679 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 21:11:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-22 21:11:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1223. [2024-11-22 21:11:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 721 states have (on average 1.7572815533980584) internal successors, (1267), 1213 states have internal predecessors, (1267), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-22 21:11:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1301 transitions. [2024-11-22 21:11:45,885 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1301 transitions. Word has length 68 [2024-11-22 21:11:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:45,886 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1301 transitions. [2024-11-22 21:11:45,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-22 21:11:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1301 transitions. [2024-11-22 21:11:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 21:11:45,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:45,887 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] [2024-11-22 21:11:45,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-22 21:11:46,087 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-22 21:11:46,088 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:46,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:46,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2136488370, now seen corresponding path program 2 times [2024-11-22 21:11:46,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:46,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004427869] [2024-11-22 21:11:46,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:11:46,090 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-22 21:11:46,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:46,091 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-22 21:11:46,092 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-22 21:11:46,448 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:11:46,449 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:11:46,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:11:46,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:46,510 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-22 21:11:46,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:11:46,661 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-22 21:11:46,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:46,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004427869] [2024-11-22 21:11:46,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004427869] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:11:46,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:11:46,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-22 21:11:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678214600] [2024-11-22 21:11:46,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:11:46,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:11:46,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:46,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:11:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-22 21:11:46,663 INFO L87 Difference]: Start difference. First operand 1223 states and 1301 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-22 21:11:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:47,100 INFO L93 Difference]: Finished difference Result 1238 states and 1322 transitions. [2024-11-22 21:11:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 21:11:47,101 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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 71 [2024-11-22 21:11:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:47,105 INFO L225 Difference]: With dead ends: 1238 [2024-11-22 21:11:47,105 INFO L226 Difference]: Without dead ends: 1232 [2024-11-22 21:11:47,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-22 21:11:47,106 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 14 mSDsluCounter, 9785 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11014 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:47,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11014 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 21:11:47,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2024-11-22 21:11:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2024-11-22 21:11:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 730 states have (on average 1.7506849315068493) internal successors, (1278), 1222 states have internal predecessors, (1278), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-22 21:11:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1312 transitions. [2024-11-22 21:11:47,124 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1312 transitions. Word has length 71 [2024-11-22 21:11:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:47,124 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1312 transitions. [2024-11-22 21:11:47,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-22 21:11:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1312 transitions. [2024-11-22 21:11:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 21:11:47,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:47,127 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] [2024-11-22 21:11:47,137 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-22 21:11:47,327 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-22 21:11:47,328 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:47,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1177937586, now seen corresponding path program 3 times [2024-11-22 21:11:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:47,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415027320] [2024-11-22 21:11:47,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:11:47,329 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-22 21:11:47,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:47,332 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-22 21:11:47,333 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-22 21:11:47,845 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 21:11:47,845 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:11:47,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 21:11:47,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:47,972 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-22 21:11:47,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:11:48,508 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-22 21:11:48,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:48,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415027320] [2024-11-22 21:11:48,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415027320] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:11:48,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:11:48,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-22 21:11:48,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60341677] [2024-11-22 21:11:48,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:11:48,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 21:11:48,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:48,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 21:11:48,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-22 21:11:48,511 INFO L87 Difference]: Start difference. First operand 1232 states and 1312 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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-22 21:11:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:49,799 INFO L93 Difference]: Finished difference Result 1256 states and 1351 transitions. [2024-11-22 21:11:49,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 21:11:49,800 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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 77 [2024-11-22 21:11:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:49,804 INFO L225 Difference]: With dead ends: 1256 [2024-11-22 21:11:49,804 INFO L226 Difference]: Without dead ends: 1250 [2024-11-22 21:11:49,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-22 21:11:49,805 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 19 mSDsluCounter, 18358 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 19587 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:49,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 19587 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 21:11:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-22 21:11:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2024-11-22 21:11:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 748 states have (on average 1.7393048128342246) internal successors, (1301), 1240 states have internal predecessors, (1301), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-22 21:11:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1335 transitions. [2024-11-22 21:11:49,822 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1335 transitions. Word has length 77 [2024-11-22 21:11:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:49,822 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1335 transitions. [2024-11-22 21:11:49,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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-22 21:11:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1335 transitions. [2024-11-22 21:11:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 21:11:49,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:49,823 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] [2024-11-22 21:11:49,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-22 21:11:50,024 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-22 21:11:50,024 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:50,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash -941621426, now seen corresponding path program 4 times [2024-11-22 21:11:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:50,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567692147] [2024-11-22 21:11:50,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:11:50,025 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-22 21:11:50,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:50,027 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-22 21:11:50,027 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-22 21:11:50,417 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:11:50,417 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:11:50,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 21:11:50,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:50,761 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-22 21:11:50,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:11:51,991 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-22 21:11:51,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:11:51,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567692147] [2024-11-22 21:11:51,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567692147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:11:51,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:11:51,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-22 21:11:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590262465] [2024-11-22 21:11:51,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:11:51,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-22 21:11:51,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:11:51,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-22 21:11:51,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 21:11:51,995 INFO L87 Difference]: Start difference. First operand 1250 states and 1335 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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-22 21:11:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:11:56,343 INFO L93 Difference]: Finished difference Result 1290 states and 1408 transitions. [2024-11-22 21:11:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-22 21:11:56,344 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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 89 [2024-11-22 21:11:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:11:56,349 INFO L225 Difference]: With dead ends: 1290 [2024-11-22 21:11:56,349 INFO L226 Difference]: Without dead ends: 1286 [2024-11-22 21:11:56,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-22 21:11:56,351 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 33 mSDsluCounter, 34260 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 35488 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:11:56,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 35488 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-22 21:11:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2024-11-22 21:11:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1284. [2024-11-22 21:11:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 782 states have (on average 1.7225063938618925) internal successors, (1347), 1274 states have internal predecessors, (1347), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-22 21:11:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1381 transitions. [2024-11-22 21:11:56,369 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1381 transitions. Word has length 89 [2024-11-22 21:11:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:11:56,369 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1381 transitions. [2024-11-22 21:11:56,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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-22 21:11:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1381 transitions. [2024-11-22 21:11:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 21:11:56,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:11:56,370 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] [2024-11-22 21:11:56,382 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-22 21:11:56,571 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-22 21:11:56,571 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-22 21:11:56,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:11:56,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2074994098, now seen corresponding path program 5 times [2024-11-22 21:11:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:11:56,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999058967] [2024-11-22 21:11:56,573 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:11:56,573 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-22 21:11:56,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:11:56,576 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-22 21:11:56,578 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-22 21:11:57,721 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-22 21:11:57,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:11:57,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-22 21:11:57,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:11:57,776 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-22 21:11:57,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-22 21:11:58,154 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-22 21:11:58,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-22 21:11:58,210 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-22 21:11:58,373 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 42 treesize of output 24 [2024-11-22 21:12:00,791 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:12:00,792 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 62 treesize of output 59 [2024-11-22 21:12:00,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 51 treesize of output 27 [2024-11-22 21:12:00,932 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-22 21:12:00,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:12:01,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:12:01,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999058967] [2024-11-22 21:12:01,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999058967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:12:01,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007460332] [2024-11-22 21:12:01,339 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:12:01,339 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 21:12:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 21:12:01,341 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 21:12:01,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process