./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:01:54,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:01:54,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:01:54,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:01:54,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:01:54,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:01:54,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:01:54,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:01:54,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:01:54,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:01:54,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:01:54,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:01:54,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:01:54,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:01:54,635 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:01:54,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:01:54,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:01:54,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:01:54,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:01:54,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:01:54,636 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:01:54,638 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:01:54,638 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:01:54,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:01:54,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:01:54,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:01:54,639 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:01:54,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:01:54,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:01:54,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:01:54,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:01:54,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:01:54,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:01:54,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:01:54,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:01:54,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:01:54,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:01:54,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:01:54,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:01:54,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:01:54,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:01:54,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:01:54,645 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-09 10:01:54,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:01:54,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:01:54,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:01:54,962 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:01:54,963 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:01:54,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-11-09 10:01:56,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:01:56,845 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:01:56,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-11-09 10:01:56,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27d56ebce/4b71849c5aec428189f6c6046607f332/FLAGc24b3de08 [2024-11-09 10:01:56,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27d56ebce/4b71849c5aec428189f6c6046607f332 [2024-11-09 10:01:56,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:01:56,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:01:56,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:01:56,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:01:56,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:01:56,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:01:56" (1/1) ... [2024-11-09 10:01:56,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e54ce43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:56, skipping insertion in model container [2024-11-09 10:01:56,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:01:56" (1/1) ... [2024-11-09 10:01:56,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:01:57,415 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-09 10:01:57,456 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-09 10:01:57,463 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-09 10:01:57,468 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-09 10:01:57,478 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-09 10:01:57,494 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-09 10:01:57,496 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-09 10:01:57,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:57,502 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-09 10:01:57,504 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-09 10:01:57,505 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:57,510 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-09 10:01:57,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:01:57,532 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-09 10:01:57,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@10bcc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:57, skipping insertion in model container [2024-11-09 10:01:57,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:01:57,535 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:01:57,537 INFO L158 Benchmark]: Toolchain (without parser) took 648.93ms. Allocated memory is still 144.7MB. Free memory was 90.1MB in the beginning and 69.7MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 10:01:57,537 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory was 108.6MB in the beginning and 108.6MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:01:57,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.84ms. Allocated memory is still 144.7MB. Free memory was 89.6MB in the beginning and 69.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 10:01:57,540 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.14ms. Allocated memory is still 144.7MB. Free memory was 108.6MB in the beginning and 108.6MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 642.84ms. Allocated memory is still 144.7MB. Free memory was 89.6MB in the beginning and 69.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 753]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:01:59,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:01:59,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:01:59,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:01:59,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:01:59,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:01:59,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:01:59,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:01:59,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:01:59,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:01:59,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:01:59,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:01:59,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:01:59,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:01:59,825 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:01:59,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:01:59,825 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:01:59,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:01:59,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:01:59,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:01:59,826 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:01:59,830 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:01:59,831 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:01:59,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:01:59,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:01:59,831 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:01:59,832 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:01:59,832 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:01:59,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:01:59,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:01:59,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:01:59,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:01:59,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:01:59,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:01:59,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:01:59,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:01:59,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:01:59,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:01:59,838 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:01:59,838 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:01:59,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:01:59,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:01:59,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:01:59,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:01:59,841 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-09 10:02:00,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:02:00,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:02:00,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:02:00,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:02:00,230 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:02:00,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-11-09 10:02:01,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:02:02,216 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:02:02,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-11-09 10:02:02,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255fb32e5/3ac3dbb26b9b45a9ba24fb371a6fbe69/FLAG453406828 [2024-11-09 10:02:02,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255fb32e5/3ac3dbb26b9b45a9ba24fb371a6fbe69 [2024-11-09 10:02:02,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:02:02,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:02:02,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:02:02,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:02:02,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:02:02,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:02:02" (1/1) ... [2024-11-09 10:02:02,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2bb349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:02, skipping insertion in model container [2024-11-09 10:02:02,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:02:02" (1/1) ... [2024-11-09 10:02:02,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:02:03,033 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-09 10:02:03,081 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-09 10:02:03,088 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-09 10:02:03,095 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-09 10:02:03,107 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-09 10:02:03,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-09 10:02:03,131 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-09 10:02:03,134 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-09 10:02:03,138 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-09 10:02:03,141 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-09 10:02:03,144 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-09 10:02:03,152 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-09 10:02:03,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:02:03,185 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:02:03,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:02:03,232 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-09 10:02:03,261 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-09 10:02:03,266 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-09 10:02:03,272 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-09 10:02:03,277 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-09 10:02:03,291 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-09 10:02:03,296 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-09 10:02:03,299 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-09 10:02:03,302 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-09 10:02:03,303 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-09 10:02:03,304 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-09 10:02:03,308 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-09 10:02:03,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:02:03,321 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:02:03,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:02:03,461 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:02:03,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03 WrapperNode [2024-11-09 10:02:03,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:02:03,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:02:03,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:02:03,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:02:03,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,574 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 762 [2024-11-09 10:02:03,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:02:03,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:02:03,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:02:03,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:02:03,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,670 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [204, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 50 writes are split as follows [50, 0]. [2024-11-09 10:02:03,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:02:03,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:02:03,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:02:03,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:02:03,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (1/1) ... [2024-11-09 10:02:03,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:02:03,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:02:03,795 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-09 10:02:03,799 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-09 10:02:03,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:02:03,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:02:03,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:02:03,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:02:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:02:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:02:03,851 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:02:03,851 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:02:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:02:03,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:02:03,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:02:03,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:02:03,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:02:03,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:02:03,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:02:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:02:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:02:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:02:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:02:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:02:03,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:02:04,112 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:02:04,116 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:02:04,120 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:02:04,181 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:02:07,452 INFO L? ?]: Removed 894 outVars from TransFormulas that were not future-live. [2024-11-09 10:02:07,453 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:02:07,496 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:02:07,496 INFO L316 CfgBuilder]: Removed 40 assume(true) statements. [2024-11-09 10:02:07,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:02:07 BoogieIcfgContainer [2024-11-09 10:02:07,497 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:02:07,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:02:07,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:02:07,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:02:07,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:02:02" (1/3) ... [2024-11-09 10:02:07,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526e91cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:02:07, skipping insertion in model container [2024-11-09 10:02:07,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:03" (2/3) ... [2024-11-09 10:02:07,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526e91cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:02:07, skipping insertion in model container [2024-11-09 10:02:07,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:02:07" (3/3) ... [2024-11-09 10:02:07,514 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-2.i [2024-11-09 10:02:07,529 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:02:07,529 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations. [2024-11-09 10:02:07,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:02:07,618 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;@17e6a646, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:02:07,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-11-09 10:02:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 837 states, 410 states have (on average 2.231707317073171) internal successors, (915), 832 states have internal predecessors, (915), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:02:07,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:07,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:02:07,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-09 10:02:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:07,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298609913] [2024-11-09 10:02:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:07,672 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-09 10:02:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:07,676 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-09 10:02:07,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:02:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:07,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:02:07,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:07,856 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-09 10:02:07,886 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-09 10:02:07,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:07,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298609913] [2024-11-09 10:02:07,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298609913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:07,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:07,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:02:07,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543925503] [2024-11-09 10:02:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:07,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:07,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:07,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:07,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:07,933 INFO L87 Difference]: Start difference. First operand has 837 states, 410 states have (on average 2.231707317073171) internal successors, (915), 832 states have internal predecessors, (915), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-09 10:02:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:09,343 INFO L93 Difference]: Finished difference Result 780 states and 819 transitions. [2024-11-09 10:02:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:09,346 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-09 10:02:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:09,360 INFO L225 Difference]: With dead ends: 780 [2024-11-09 10:02:09,360 INFO L226 Difference]: Without dead ends: 778 [2024-11-09 10:02:09,362 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-09 10:02:09,365 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 516 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:09,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 622 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:02:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-09 10:02:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2024-11-09 10:02:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 404 states have (on average 2.0) internal successors, (808), 771 states have internal predecessors, (808), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 814 transitions. [2024-11-09 10:02:09,443 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 814 transitions. Word has length 5 [2024-11-09 10:02:09,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:09,443 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 814 transitions. [2024-11-09 10:02:09,443 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-09 10:02:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 814 transitions. [2024-11-09 10:02:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:02:09,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:09,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:02:09,448 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-09 10:02:09,645 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-09 10:02:09,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:09,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-09 10:02:09,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:09,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048945322] [2024-11-09 10:02:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:09,647 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-09 10:02:09,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:09,649 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-09 10:02:09,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:02:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:09,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:02:09,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:09,755 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-09 10:02:09,780 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-09 10:02:09,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:09,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:09,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048945322] [2024-11-09 10:02:09,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048945322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:09,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:09,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:02:09,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215495124] [2024-11-09 10:02:09,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:09,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:09,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:09,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:09,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:09,787 INFO L87 Difference]: Start difference. First operand 776 states and 814 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-09 10:02:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:11,103 INFO L93 Difference]: Finished difference Result 850 states and 892 transitions. [2024-11-09 10:02:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:11,105 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-09 10:02:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:11,109 INFO L225 Difference]: With dead ends: 850 [2024-11-09 10:02:11,109 INFO L226 Difference]: Without dead ends: 850 [2024-11-09 10:02:11,109 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-09 10:02:11,110 INFO L432 NwaCegarLoop]: 684 mSDtfsCounter, 267 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:11,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 965 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:02:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-09 10:02:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 802. [2024-11-09 10:02:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 441 states have (on average 1.9750566893424035) internal successors, (871), 797 states have internal predecessors, (871), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 877 transitions. [2024-11-09 10:02:11,134 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 877 transitions. Word has length 5 [2024-11-09 10:02:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:11,135 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 877 transitions. [2024-11-09 10:02:11,135 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-09 10:02:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 877 transitions. [2024-11-09 10:02:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:02:11,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:11,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:02:11,143 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-09 10:02:11,338 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-09 10:02:11,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:11,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1422978266, now seen corresponding path program 1 times [2024-11-09 10:02:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:11,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587792440] [2024-11-09 10:02:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:11,340 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-09 10:02:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:11,343 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-09 10:02:11,344 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-09 10:02:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:11,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:02:11,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:11,446 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-09 10:02:11,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:11,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:11,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587792440] [2024-11-09 10:02:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587792440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:11,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071397572] [2024-11-09 10:02:11,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:11,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:11,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:11,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:11,449 INFO L87 Difference]: Start difference. First operand 802 states and 877 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-09 10:02:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:11,495 INFO L93 Difference]: Finished difference Result 1379 states and 1517 transitions. [2024-11-09 10:02:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:11,497 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-09 10:02:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:11,503 INFO L225 Difference]: With dead ends: 1379 [2024-11-09 10:02:11,503 INFO L226 Difference]: Without dead ends: 1379 [2024-11-09 10:02:11,504 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-09 10:02:11,505 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 559 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:11,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1813 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-09 10:02:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 803. [2024-11-09 10:02:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 442 states have (on average 1.9728506787330318) internal successors, (872), 798 states have internal predecessors, (872), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 878 transitions. [2024-11-09 10:02:11,529 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 878 transitions. Word has length 6 [2024-11-09 10:02:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:11,530 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 878 transitions. [2024-11-09 10:02:11,530 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-09 10:02:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 878 transitions. [2024-11-09 10:02:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 10:02:11,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:11,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:11,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:02:11,731 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-09 10:02:11,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:11,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:11,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1612480742, now seen corresponding path program 1 times [2024-11-09 10:02:11,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:11,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777946270] [2024-11-09 10:02:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:11,734 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-09 10:02:11,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:11,737 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-09 10:02:11,738 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-09 10:02:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:11,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:02:11,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:11,866 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-09 10:02:11,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:11,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:11,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777946270] [2024-11-09 10:02:11,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777946270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:11,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:11,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:11,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712067599] [2024-11-09 10:02:11,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:11,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:11,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:11,869 INFO L87 Difference]: Start difference. First operand 803 states and 878 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:11,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:11,917 INFO L93 Difference]: Finished difference Result 761 states and 835 transitions. [2024-11-09 10:02:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:11,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 10:02:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:11,921 INFO L225 Difference]: With dead ends: 761 [2024-11-09 10:02:11,921 INFO L226 Difference]: Without dead ends: 761 [2024-11-09 10:02:11,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:11,923 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 71 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1433 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-09 10:02:11,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1433 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-09 10:02:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2024-11-09 10:02:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 424 states have (on average 1.955188679245283) internal successors, (829), 756 states have internal predecessors, (829), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 835 transitions. [2024-11-09 10:02:11,940 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 835 transitions. Word has length 15 [2024-11-09 10:02:11,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:11,940 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 835 transitions. [2024-11-09 10:02:11,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 835 transitions. [2024-11-09 10:02:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 10:02:11,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:11,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:11,951 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-09 10:02:12,144 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-09 10:02:12,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:12,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:12,145 INFO L85 PathProgramCache]: Analyzing trace with hash -889204479, now seen corresponding path program 1 times [2024-11-09 10:02:12,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:12,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453042798] [2024-11-09 10:02:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:12,146 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-09 10:02:12,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:12,149 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-09 10:02:12,150 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-09 10:02:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:12,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:02:12,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:12,300 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-09 10:02:12,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:12,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:12,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453042798] [2024-11-09 10:02:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453042798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:12,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:12,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:12,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369889385] [2024-11-09 10:02:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:12,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:12,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:12,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:12,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:12,302 INFO L87 Difference]: Start difference. First operand 761 states and 835 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:12,390 INFO L93 Difference]: Finished difference Result 739 states and 806 transitions. [2024-11-09 10:02:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:02:12,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 10:02:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:12,394 INFO L225 Difference]: With dead ends: 739 [2024-11-09 10:02:12,394 INFO L226 Difference]: Without dead ends: 739 [2024-11-09 10:02:12,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:12,396 INFO L432 NwaCegarLoop]: 703 mSDtfsCounter, 48 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2083 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-09 10:02:12,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2083 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:02:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-09 10:02:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2024-11-09 10:02:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 416 states have (on average 1.9230769230769231) internal successors, (800), 734 states have internal predecessors, (800), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 806 transitions. [2024-11-09 10:02:12,416 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 806 transitions. Word has length 17 [2024-11-09 10:02:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:12,417 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 806 transitions. [2024-11-09 10:02:12,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 806 transitions. [2024-11-09 10:02:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 10:02:12,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:12,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:12,423 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-09 10:02:12,619 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-09 10:02:12,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:12,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1527750574, now seen corresponding path program 1 times [2024-11-09 10:02:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:12,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777958256] [2024-11-09 10:02:12,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:12,621 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-09 10:02:12,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:12,624 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-09 10:02:12,625 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-09 10:02:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:12,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:02:12,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:12,746 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-09 10:02:12,832 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-09 10:02:12,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:12,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:12,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777958256] [2024-11-09 10:02:12,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777958256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:12,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:12,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:12,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114016800] [2024-11-09 10:02:12,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:12,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:12,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:12,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:12,834 INFO L87 Difference]: Start difference. First operand 739 states and 806 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:14,399 INFO L93 Difference]: Finished difference Result 739 states and 806 transitions. [2024-11-09 10:02:14,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:14,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 10:02:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:14,403 INFO L225 Difference]: With dead ends: 739 [2024-11-09 10:02:14,403 INFO L226 Difference]: Without dead ends: 739 [2024-11-09 10:02:14,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:14,405 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 449 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:14,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 883 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:02:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-09 10:02:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 735. [2024-11-09 10:02:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 416 states have (on average 1.9134615384615385) internal successors, (796), 730 states have internal predecessors, (796), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 802 transitions. [2024-11-09 10:02:14,419 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 802 transitions. Word has length 31 [2024-11-09 10:02:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:14,419 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 802 transitions. [2024-11-09 10:02:14,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 802 transitions. [2024-11-09 10:02:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 10:02:14,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:14,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:14,427 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-09 10:02:14,621 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-09 10:02:14,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:14,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:14,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1527750575, now seen corresponding path program 1 times [2024-11-09 10:02:14,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:14,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917707359] [2024-11-09 10:02:14,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:14,622 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-09 10:02:14,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:14,624 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-09 10:02:14,625 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-09 10:02:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:14,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:02:14,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:14,756 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-09 10:02:14,977 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-09 10:02:14,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:14,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917707359] [2024-11-09 10:02:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917707359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:14,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:14,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730310998] [2024-11-09 10:02:14,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:14,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:14,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:14,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:14,979 INFO L87 Difference]: Start difference. First operand 735 states and 802 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:16,694 INFO L93 Difference]: Finished difference Result 783 states and 817 transitions. [2024-11-09 10:02:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:16,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 10:02:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:16,698 INFO L225 Difference]: With dead ends: 783 [2024-11-09 10:02:16,698 INFO L226 Difference]: Without dead ends: 783 [2024-11-09 10:02:16,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:16,700 INFO L432 NwaCegarLoop]: 638 mSDtfsCounter, 196 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:16,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1246 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:02:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-09 10:02:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 731. [2024-11-09 10:02:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 416 states have (on average 1.9038461538461537) internal successors, (792), 726 states have internal predecessors, (792), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 798 transitions. [2024-11-09 10:02:16,716 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 798 transitions. Word has length 31 [2024-11-09 10:02:16,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:16,717 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 798 transitions. [2024-11-09 10:02:16,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 798 transitions. [2024-11-09 10:02:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 10:02:16,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:16,720 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] [2024-11-09 10:02:16,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 10:02:16,920 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-09 10:02:16,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:16,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash -427866328, now seen corresponding path program 1 times [2024-11-09 10:02:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:16,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125355862] [2024-11-09 10:02:16,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:16,922 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-09 10:02:16,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:16,924 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-09 10:02:16,925 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-09 10:02:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:17,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:02:17,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:17,152 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-09 10:02:17,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:17,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125355862] [2024-11-09 10:02:17,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125355862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:17,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:17,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:17,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003675036] [2024-11-09 10:02:17,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:17,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:17,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:17,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:17,154 INFO L87 Difference]: Start difference. First operand 731 states and 798 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-09 10:02:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:17,215 INFO L93 Difference]: Finished difference Result 725 states and 788 transitions. [2024-11-09 10:02:17,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:02:17,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-09 10:02:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:17,218 INFO L225 Difference]: With dead ends: 725 [2024-11-09 10:02:17,219 INFO L226 Difference]: Without dead ends: 725 [2024-11-09 10:02:17,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-09 10:02:17,219 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 21 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2060 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-09 10:02:17,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2060 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-09 10:02:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2024-11-09 10:02:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 410 states have (on average 1.9073170731707316) internal successors, (782), 720 states have internal predecessors, (782), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 788 transitions. [2024-11-09 10:02:17,237 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 788 transitions. Word has length 47 [2024-11-09 10:02:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:17,239 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 788 transitions. [2024-11-09 10:02:17,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-09 10:02:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 788 transitions. [2024-11-09 10:02:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 10:02:17,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:17,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:17,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:02:17,440 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-09 10:02:17,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:17,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:17,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1425126540, now seen corresponding path program 1 times [2024-11-09 10:02:17,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:17,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305547167] [2024-11-09 10:02:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:17,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:02:17,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:17,443 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-09 10:02:17,444 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-09 10:02:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:17,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:02:17,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:17,985 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-09 10:02:17,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:17,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:17,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305547167] [2024-11-09 10:02:17,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305547167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:17,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:17,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043197149] [2024-11-09 10:02:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:17,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:17,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:17,989 INFO L87 Difference]: Start difference. First operand 725 states and 788 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-09 10:02:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:18,170 INFO L93 Difference]: Finished difference Result 947 states and 1039 transitions. [2024-11-09 10:02:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:18,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2024-11-09 10:02:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:18,173 INFO L225 Difference]: With dead ends: 947 [2024-11-09 10:02:18,173 INFO L226 Difference]: Without dead ends: 947 [2024-11-09 10:02:18,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-09 10:02:18,174 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 178 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:18,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1430 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:02:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-09 10:02:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 776. [2024-11-09 10:02:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 461 states have (on average 1.806941431670282) internal successors, (833), 771 states have internal predecessors, (833), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 839 transitions. [2024-11-09 10:02:18,189 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 839 transitions. Word has length 55 [2024-11-09 10:02:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:18,191 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 839 transitions. [2024-11-09 10:02:18,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-09 10:02:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 839 transitions. [2024-11-09 10:02:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 10:02:18,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:18,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:18,200 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-09 10:02:18,397 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-09 10:02:18,398 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:18,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash -300499055, now seen corresponding path program 1 times [2024-11-09 10:02:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:18,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296960306] [2024-11-09 10:02:18,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:18,399 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-09 10:02:18,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:18,403 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-09 10:02:18,404 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-09 10:02:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:18,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:02:18,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:18,687 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-09 10:02:18,697 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-09 10:02:19,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:02:19,211 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-09 10:02:19,229 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:02:19,230 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-09 10:02:19,249 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-09 10:02:19,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:19,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296960306] [2024-11-09 10:02:19,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296960306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:19,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:19,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444713519] [2024-11-09 10:02:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:19,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:19,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:19,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:19,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:19,251 INFO L87 Difference]: Start difference. First operand 776 states and 839 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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-09 10:02:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:20,529 INFO L93 Difference]: Finished difference Result 738 states and 801 transitions. [2024-11-09 10:02:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:20,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2024-11-09 10:02:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:20,532 INFO L225 Difference]: With dead ends: 738 [2024-11-09 10:02:20,532 INFO L226 Difference]: Without dead ends: 738 [2024-11-09 10:02:20,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 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-09 10:02:20,533 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 748 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:20,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 490 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:02:20,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-09 10:02:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 701. [2024-11-09 10:02:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 424 states have (on average 1.7004716981132075) internal successors, (721), 696 states have internal predecessors, (721), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 727 transitions. [2024-11-09 10:02:20,545 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 727 transitions. Word has length 58 [2024-11-09 10:02:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:20,546 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 727 transitions. [2024-11-09 10:02:20,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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-09 10:02:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 727 transitions. [2024-11-09 10:02:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 10:02:20,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:20,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:20,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:02:20,750 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-09 10:02:20,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:20,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1649417159, now seen corresponding path program 1 times [2024-11-09 10:02:20,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:20,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446949802] [2024-11-09 10:02:20,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:20,751 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-09 10:02:20,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:20,755 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-09 10:02:20,756 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-09 10:02:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:20,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:02:20,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:20,995 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-09 10:02:21,012 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-09 10:02:21,039 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-09 10:02:21,049 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-09 10:02:21,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:21,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446949802] [2024-11-09 10:02:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446949802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:21,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:21,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832997788] [2024-11-09 10:02:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:21,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:02:21,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:02:21,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:21,052 INFO L87 Difference]: Start difference. First operand 701 states and 727 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-09 10:02:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:22,450 INFO L93 Difference]: Finished difference Result 700 states and 726 transitions. [2024-11-09 10:02:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:02:22,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2024-11-09 10:02:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:22,453 INFO L225 Difference]: With dead ends: 700 [2024-11-09 10:02:22,454 INFO L226 Difference]: Without dead ends: 700 [2024-11-09 10:02:22,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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-09 10:02:22,454 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 2 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:22,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1679 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:02:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-09 10:02:22,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2024-11-09 10:02:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 424 states have (on average 1.6981132075471699) internal successors, (720), 695 states have internal predecessors, (720), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 726 transitions. [2024-11-09 10:02:22,466 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 726 transitions. Word has length 63 [2024-11-09 10:02:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:22,467 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 726 transitions. [2024-11-09 10:02:22,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-09 10:02:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 726 transitions. [2024-11-09 10:02:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 10:02:22,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:22,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:22,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:02:22,671 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-09 10:02:22,671 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:22,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1649417160, now seen corresponding path program 1 times [2024-11-09 10:02:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:22,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478525381] [2024-11-09 10:02:22,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:22,673 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-09 10:02:22,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:22,677 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-09 10:02:22,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 10:02:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:22,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:02:22,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:22,943 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-09 10:02:22,968 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-09 10:02:22,975 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-09 10:02:23,036 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-09 10:02:23,053 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-09 10:02:23,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:23,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:23,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478525381] [2024-11-09 10:02:23,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478525381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:23,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:23,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:23,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129792461] [2024-11-09 10:02:23,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:23,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:02:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:02:23,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:23,055 INFO L87 Difference]: Start difference. First operand 700 states and 726 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-09 10:02:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:24,882 INFO L93 Difference]: Finished difference Result 699 states and 725 transitions. [2024-11-09 10:02:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:02:24,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2024-11-09 10:02:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:24,885 INFO L225 Difference]: With dead ends: 699 [2024-11-09 10:02:24,885 INFO L226 Difference]: Without dead ends: 699 [2024-11-09 10:02:24,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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-09 10:02:24,886 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 1 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:24,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1704 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:02:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-09 10:02:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-09 10:02:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 423 states have (on average 1.6997635933806146) internal successors, (719), 694 states have internal predecessors, (719), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:02:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 725 transitions. [2024-11-09 10:02:24,898 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 725 transitions. Word has length 63 [2024-11-09 10:02:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:24,898 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 725 transitions. [2024-11-09 10:02:24,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-09 10:02:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 725 transitions. [2024-11-09 10:02:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 10:02:24,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:24,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:24,908 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-09 10:02:25,100 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-09 10:02:25,100 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:25,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:25,101 INFO L85 PathProgramCache]: Analyzing trace with hash -857517713, now seen corresponding path program 1 times [2024-11-09 10:02:25,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:25,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367364887] [2024-11-09 10:02:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:25,101 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-09 10:02:25,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:25,103 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-09 10:02:25,104 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-09 10:02:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:25,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:02:25,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:25,335 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-09 10:02:25,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:02:25,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:25,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367364887] [2024-11-09 10:02:25,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367364887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:25,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:25,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:25,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16090992] [2024-11-09 10:02:25,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:25,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:25,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:25,339 INFO L87 Difference]: Start difference. First operand 699 states and 725 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-09 10:02:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:25,379 INFO L93 Difference]: Finished difference Result 702 states and 729 transitions. [2024-11-09 10:02:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:25,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 71 [2024-11-09 10:02:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:25,385 INFO L225 Difference]: With dead ends: 702 [2024-11-09 10:02:25,388 INFO L226 Difference]: Without dead ends: 702 [2024-11-09 10:02:25,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-09 10:02:25,390 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 0 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:25,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2005 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-11-09 10:02:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2024-11-09 10:02:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 425 states have (on average 1.6988235294117646) internal successors, (722), 697 states have internal predecessors, (722), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:02:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 729 transitions. [2024-11-09 10:02:25,408 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 729 transitions. Word has length 71 [2024-11-09 10:02:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:25,408 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 729 transitions. [2024-11-09 10:02:25,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-09 10:02:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 729 transitions. [2024-11-09 10:02:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 10:02:25,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:25,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:25,417 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-09 10:02:25,610 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-09 10:02:25,610 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:25,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:25,611 INFO L85 PathProgramCache]: Analyzing trace with hash 564586453, now seen corresponding path program 1 times [2024-11-09 10:02:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:25,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133307408] [2024-11-09 10:02:25,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:25,611 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-09 10:02:25,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:25,614 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-09 10:02:25,615 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-09 10:02:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:25,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:02:25,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:25,905 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-09 10:02:25,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:25,978 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-09 10:02:25,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:25,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133307408] [2024-11-09 10:02:25,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133307408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:02:25,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:25,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 10:02:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952041191] [2024-11-09 10:02:25,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:25,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:02:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:25,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:02:25,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:02:25,981 INFO L87 Difference]: Start difference. First operand 702 states and 729 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-09 10:02:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:26,093 INFO L93 Difference]: Finished difference Result 714 states and 746 transitions. [2024-11-09 10:02:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:02:26,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 72 [2024-11-09 10:02:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:26,098 INFO L225 Difference]: With dead ends: 714 [2024-11-09 10:02:26,098 INFO L226 Difference]: Without dead ends: 714 [2024-11-09 10:02:26,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 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-09 10:02:26,099 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 5 mSDsluCounter, 3331 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:26,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4001 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:02:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-09 10:02:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 712. [2024-11-09 10:02:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 434 states have (on average 1.6981566820276497) internal successors, (737), 706 states have internal predecessors, (737), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:02:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 744 transitions. [2024-11-09 10:02:26,112 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 744 transitions. Word has length 72 [2024-11-09 10:02:26,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:26,113 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 744 transitions. [2024-11-09 10:02:26,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-09 10:02:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 744 transitions. [2024-11-09 10:02:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 10:02:26,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:26,114 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:26,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-09 10:02:26,314 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-09 10:02:26,315 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:26,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1404519697, now seen corresponding path program 2 times [2024-11-09 10:02:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061520774] [2024-11-09 10:02:26,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:02:26,317 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-09 10:02:26,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:26,320 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-09 10:02:26,321 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-09 10:02:26,702 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:02:26,703 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:02:26,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:02:26,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:26,765 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-09 10:02:26,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:26,933 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-09 10:02:26,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061520774] [2024-11-09 10:02:26,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061520774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:02:26,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:26,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 10:02:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190194387] [2024-11-09 10:02:26,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:26,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:02:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:02:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:02:26,935 INFO L87 Difference]: Start difference. First operand 712 states and 744 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:02:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:27,289 INFO L93 Difference]: Finished difference Result 727 states and 766 transitions. [2024-11-09 10:02:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:02:27,291 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-09 10:02:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:27,295 INFO L225 Difference]: With dead ends: 727 [2024-11-09 10:02:27,296 INFO L226 Difference]: Without dead ends: 723 [2024-11-09 10:02:27,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 136 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-09 10:02:27,298 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 9 mSDsluCounter, 4003 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4673 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:27,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4673 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:02:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-09 10:02:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 721. [2024-11-09 10:02:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 443 states have (on average 1.690744920993228) internal successors, (749), 715 states have internal predecessors, (749), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:02:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 756 transitions. [2024-11-09 10:02:27,315 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 756 transitions. Word has length 75 [2024-11-09 10:02:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:27,316 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 756 transitions. [2024-11-09 10:02:27,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:02:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 756 transitions. [2024-11-09 10:02:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 10:02:27,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:27,318 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:27,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-09 10:02:27,518 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-09 10:02:27,518 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:27,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -501780177, now seen corresponding path program 3 times [2024-11-09 10:02:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:27,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743055892] [2024-11-09 10:02:27,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:02:27,519 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-09 10:02:27,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:27,521 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-09 10:02:27,522 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-09 10:02:28,136 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:02:28,136 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:02:28,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:02:28,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:28,290 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-09 10:02:28,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:28,871 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-09 10:02:28,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743055892] [2024-11-09 10:02:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743055892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:02:28,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:28,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 10:02:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676317266] [2024-11-09 10:02:28,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:28,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:02:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:28,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:02:28,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:02:28,874 INFO L87 Difference]: Start difference. First operand 721 states and 756 transitions. Second operand has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 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-09 10:02:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:30,335 INFO L93 Difference]: Finished difference Result 745 states and 795 transitions. [2024-11-09 10:02:30,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 10:02:30,337 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-09 10:02:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:30,341 INFO L225 Difference]: With dead ends: 745 [2024-11-09 10:02:30,341 INFO L226 Difference]: Without dead ends: 739 [2024-11-09 10:02:30,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 10:02:30,342 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 26 mSDsluCounter, 7350 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8021 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:30,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8021 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:02:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-09 10:02:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2024-11-09 10:02:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 461 states have (on average 1.6746203904555315) internal successors, (772), 733 states have internal predecessors, (772), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:02:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 779 transitions. [2024-11-09 10:02:30,357 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 779 transitions. Word has length 81 [2024-11-09 10:02:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:30,357 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 779 transitions. [2024-11-09 10:02:30,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 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-09 10:02:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 779 transitions. [2024-11-09 10:02:30,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:02:30,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:30,359 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:30,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 10:02:30,559 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-09 10:02:30,560 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:30,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:30,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1522283089, now seen corresponding path program 4 times [2024-11-09 10:02:30,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:30,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248026995] [2024-11-09 10:02:30,561 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:02:30,561 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-09 10:02:30,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:30,562 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-09 10:02:30,563 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-09 10:02:30,977 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:02:30,978 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:02:30,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:02:30,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:31,347 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-09 10:02:31,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:32,534 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-09 10:02:32,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:32,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248026995] [2024-11-09 10:02:32,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248026995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:02:32,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:32,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 10:02:32,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698354989] [2024-11-09 10:02:32,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:32,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 10:02:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:02:32,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 10:02:32,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 10:02:32,537 INFO L87 Difference]: Start difference. First operand 739 states and 779 transitions. Second operand has 50 states, 50 states have (on average 2.32) internal successors, (116), 50 states have internal predecessors, (116), 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-09 10:02:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:37,122 INFO L93 Difference]: Finished difference Result 779 states and 851 transitions. [2024-11-09 10:02:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 10:02:37,123 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.32) internal successors, (116), 50 states have internal predecessors, (116), 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 93 [2024-11-09 10:02:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:37,126 INFO L225 Difference]: With dead ends: 779 [2024-11-09 10:02:37,126 INFO L226 Difference]: Without dead ends: 775 [2024-11-09 10:02:37,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 10:02:37,128 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 32 mSDsluCounter, 16009 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 16679 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:37,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 16679 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:02:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-09 10:02:37,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2024-11-09 10:02:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 495 states have (on average 1.6525252525252525) internal successors, (818), 767 states have internal predecessors, (818), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:02:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 825 transitions. [2024-11-09 10:02:37,142 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 825 transitions. Word has length 93 [2024-11-09 10:02:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:37,143 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 825 transitions. [2024-11-09 10:02:37,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.32) internal successors, (116), 50 states have internal predecessors, (116), 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-09 10:02:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 825 transitions. [2024-11-09 10:02:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 10:02:37,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:37,144 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:37,157 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-09 10:02:37,345 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-09 10:02:37,345 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:02:37,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:37,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2008704529, now seen corresponding path program 5 times [2024-11-09 10:02:37,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:02:37,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020291808] [2024-11-09 10:02:37,346 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:02:37,347 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-09 10:02:37,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:02:37,350 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-09 10:02:37,352 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-09 10:02:38,458 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-09 10:02:38,458 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:02:38,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-09 10:02:38,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:38,493 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-09 10:02:38,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:02:38,709 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:02:38,709 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-09 10:02:38,736 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 11 treesize of output 7 [2024-11-09 10:02:38,743 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 15 treesize of output 1 [2024-11-09 10:02:38,820 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 18 treesize of output 10 [2024-11-09 10:02:38,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-09 10:02:39,575 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 10:02:39,576 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 50 treesize of output 45 [2024-11-09 10:02:39,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 11 [2024-11-09 10:02:39,627 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 25 treesize of output 13 [2024-11-09 10:02:39,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-09 10:02:39,656 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-09 10:02:39,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:40,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:02:40,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020291808] [2024-11-09 10:02:40,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020291808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:40,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [153556414] [2024-11-09 10:02:40,888 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:02:40,888 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 10:02:40,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 10:02:40,890 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-09 10:02:40,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process