./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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 f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 16:56:33,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 16:56:33,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 16:56:33,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 16:56:33,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 16:56:33,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 16:56:33,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 16:56:33,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 16:56:33,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 16:56:33,870 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 16:56:33,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 16:56:33,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 16:56:33,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 16:56:33,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 16:56:33,875 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 16:56:33,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 16:56:33,876 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 16:56:33,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 16:56:33,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 16:56:33,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 16:56:33,877 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 16:56:33,877 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 16:56:33,878 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 16:56:33,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 16:56:33,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 16:56:33,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 16:56:33,879 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 16:56:33,879 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 16:56:33,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 16:56:33,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 16:56:33,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 16:56:33,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 16:56:33,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 16:56:33,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:56:33,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 16:56:33,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 16:56:33,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 16:56:33,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 16:56:33,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 16:56:33,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 16:56:33,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 16:56:33,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 16:56:33,884 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 -> f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385 [2024-11-20 16:56:34,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 16:56:34,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 16:56:34,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 16:56:34,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 16:56:34,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 16:56:34,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i [2024-11-20 16:56:35,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 16:56:36,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 16:56:36,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i [2024-11-20 16:56:36,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98171bf83/5d0d4c37e8dc425892efdf1f197d1a2e/FLAG5592f04dc [2024-11-20 16:56:36,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98171bf83/5d0d4c37e8dc425892efdf1f197d1a2e [2024-11-20 16:56:36,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 16:56:36,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 16:56:36,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 16:56:36,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 16:56:36,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 16:56:36,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:56:36" (1/1) ... [2024-11-20 16:56:36,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfc5d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:36, skipping insertion in model container [2024-11-20 16:56:36,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:56:36" (1/1) ... [2024-11-20 16:56:36,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:56:36,571 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,609 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,618 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,627 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,634 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,654 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,658 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,661 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,665 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,667 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,668 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,680 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:36,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:56:36,704 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-20 16:56:36,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@50a3482e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:36, skipping insertion in model container [2024-11-20 16:56:36,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 16:56:36,706 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 16:56:36,708 INFO L158 Benchmark]: Toolchain (without parser) took 606.03ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 75.9MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 16:56:36,708 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 155.2MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 16:56:36,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.78ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 75.9MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 16:56:36,710 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.39ms. Allocated memory is still 155.2MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.78ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 75.9MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 764]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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 f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 16:56:38,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 16:56:39,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 16:56:39,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 16:56:39,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 16:56:39,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 16:56:39,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 16:56:39,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 16:56:39,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 16:56:39,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 16:56:39,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 16:56:39,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 16:56:39,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 16:56:39,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 16:56:39,077 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 16:56:39,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 16:56:39,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 16:56:39,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 16:56:39,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 16:56:39,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 16:56:39,081 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 16:56:39,082 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 16:56:39,082 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 16:56:39,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 16:56:39,082 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 16:56:39,083 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 16:56:39,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 16:56:39,083 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 16:56:39,083 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 16:56:39,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 16:56:39,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 16:56:39,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 16:56:39,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 16:56:39,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 16:56:39,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 16:56:39,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:56:39,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 16:56:39,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 16:56:39,090 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 16:56:39,090 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 16:56:39,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 16:56:39,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 16:56:39,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 16:56:39,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 16:56:39,092 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 -> f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385 [2024-11-20 16:56:39,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 16:56:39,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 16:56:39,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 16:56:39,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 16:56:39,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 16:56:39,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i [2024-11-20 16:56:41,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 16:56:41,437 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 16:56:41,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i [2024-11-20 16:56:41,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe5c6c64/0d71d6c526094347911572b5e90e6258/FLAG5bd4bf687 [2024-11-20 16:56:41,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe5c6c64/0d71d6c526094347911572b5e90e6258 [2024-11-20 16:56:41,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 16:56:41,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 16:56:41,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 16:56:41,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 16:56:41,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 16:56:41,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:56:41" (1/1) ... [2024-11-20 16:56:41,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f9ba960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:41, skipping insertion in model container [2024-11-20 16:56:41,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:56:41" (1/1) ... [2024-11-20 16:56:41,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:56:41,979 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,017 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,028 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,035 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,046 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,068 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,070 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,075 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,079 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,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-20 16:56:42,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-20 16:56:42,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-20 16:56:42,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:56:42,115 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 16:56:42,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:56:42,153 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,166 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,168 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,170 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,174 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,183 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,185 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,186 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,187 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,187 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,190 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:42,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:56:42,202 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 16:56:42,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:56:42,353 INFO L204 MainTranslator]: Completed translation [2024-11-20 16:56:42,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42 WrapperNode [2024-11-20 16:56:42,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 16:56:42,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 16:56:42,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 16:56:42,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 16:56:42,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,481 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 807 [2024-11-20 16:56:42,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 16:56:42,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 16:56:42,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 16:56:42,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 16:56:42,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,609 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-20 16:56:42,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 16:56:42,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 16:56:42,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 16:56:42,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 16:56:42,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (1/1) ... [2024-11-20 16:56:42,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:56:42,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 16:56:42,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 16:56:42,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 16:56:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 16:56:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 16:56:42,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 16:56:42,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 16:56:42,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 16:56:42,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 16:56:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 16:56:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 16:56:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 16:56:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 16:56:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 16:56:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 16:56:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 16:56:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 16:56:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 16:56:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 16:56:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 16:56:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 16:56:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 16:56:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 16:56:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 16:56:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 16:56:42,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 16:56:43,053 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 16:56:43,056 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 16:56:43,060 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:56:43,111 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:56:46,183 INFO L? ?]: Removed 907 outVars from TransFormulas that were not future-live. [2024-11-20 16:56:46,184 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 16:56:46,223 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 16:56:46,223 INFO L316 CfgBuilder]: Removed 40 assume(true) statements. [2024-11-20 16:56:46,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:56:46 BoogieIcfgContainer [2024-11-20 16:56:46,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 16:56:46,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 16:56:46,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 16:56:46,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 16:56:46,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:56:41" (1/3) ... [2024-11-20 16:56:46,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb9e6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:56:46, skipping insertion in model container [2024-11-20 16:56:46,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:42" (2/3) ... [2024-11-20 16:56:46,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb9e6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:56:46, skipping insertion in model container [2024-11-20 16:56:46,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:56:46" (3/3) ... [2024-11-20 16:56:46,234 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test1-2.i [2024-11-20 16:56:46,250 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 16:56:46,250 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations. [2024-11-20 16:56:46,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 16:56:46,330 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;@2cf51f92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 16:56:46,330 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-11-20 16:56:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 16:56:46,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:46,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 16:56:46,347 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-20 16:56:46,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-20 16:56:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:46,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317443974] [2024-11-20 16:56:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:46,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:46,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 16:56:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:46,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:56:46,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:46,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:56:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:46,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:46,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:46,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317443974] [2024-11-20 16:56:46,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317443974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:46,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:46,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:56:46,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377344522] [2024-11-20 16:56:46,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:46,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:56:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:46,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:56:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:56:46,635 INFO L87 Difference]: Start difference. First operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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-20 16:56:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:48,059 INFO L93 Difference]: Finished difference Result 801 states and 859 transitions. [2024-11-20 16:56:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:56:48,061 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-20 16:56:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:48,077 INFO L225 Difference]: With dead ends: 801 [2024-11-20 16:56:48,077 INFO L226 Difference]: Without dead ends: 799 [2024-11-20 16:56:48,079 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-20 16:56:48,082 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 535 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:48,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 663 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 16:56:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-20 16:56:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 797. [2024-11-20 16:56:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 414 states have (on average 2.0) internal successors, (828), 791 states have internal predecessors, (828), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 854 transitions. [2024-11-20 16:56:48,159 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 854 transitions. Word has length 5 [2024-11-20 16:56:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:48,160 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 854 transitions. [2024-11-20 16:56:48,160 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-20 16:56:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 854 transitions. [2024-11-20 16:56:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 16:56:48,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:48,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 16:56:48,165 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-20 16:56:48,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:48,362 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-20 16:56:48,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:48,363 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-20 16:56:48,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:48,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588306502] [2024-11-20 16:56:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:48,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:48,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:48,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:48,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 16:56:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:48,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:56:48,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:48,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 16:56:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:48,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:48,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:48,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588306502] [2024-11-20 16:56:48,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588306502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:48,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:48,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:56:48,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985175607] [2024-11-20 16:56:48,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:48,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:56:48,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:48,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:56:48,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:56:48,520 INFO L87 Difference]: Start difference. First operand 797 states and 854 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-20 16:56:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:49,884 INFO L93 Difference]: Finished difference Result 872 states and 933 transitions. [2024-11-20 16:56:49,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:56:49,885 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-20 16:56:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:49,888 INFO L225 Difference]: With dead ends: 872 [2024-11-20 16:56:49,888 INFO L226 Difference]: Without dead ends: 872 [2024-11-20 16:56:49,889 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-20 16:56:49,889 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 263 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:49,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1050 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 16:56:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-20 16:56:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 824. [2024-11-20 16:56:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 451 states have (on average 1.9778270509977827) internal successors, (892), 818 states have internal predecessors, (892), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 918 transitions. [2024-11-20 16:56:49,918 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 918 transitions. Word has length 5 [2024-11-20 16:56:49,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:49,919 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 918 transitions. [2024-11-20 16:56:49,919 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-20 16:56:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 918 transitions. [2024-11-20 16:56:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 16:56:49,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:49,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 16:56:49,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 16:56:50,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:50,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:56:50,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1422972308, now seen corresponding path program 1 times [2024-11-20 16:56:50,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:50,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92115662] [2024-11-20 16:56:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:50,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:50,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:50,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:50,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 16:56:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:50,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 16:56:50,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:50,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:50,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:50,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92115662] [2024-11-20 16:56:50,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92115662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:50,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:50,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:56:50,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541022860] [2024-11-20 16:56:50,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:50,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:56:50,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:50,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:56:50,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:56:50,223 INFO L87 Difference]: Start difference. First operand 824 states and 918 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-20 16:56:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:50,317 INFO L93 Difference]: Finished difference Result 1397 states and 1554 transitions. [2024-11-20 16:56:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:56:50,321 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-20 16:56:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:50,327 INFO L225 Difference]: With dead ends: 1397 [2024-11-20 16:56:50,327 INFO L226 Difference]: Without dead ends: 1397 [2024-11-20 16:56:50,328 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-20 16:56:50,329 INFO L432 NwaCegarLoop]: 1055 mSDtfsCounter, 555 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:50,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1893 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 16:56:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-11-20 16:56:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 825. [2024-11-20 16:56:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 452 states have (on average 1.9756637168141593) internal successors, (893), 819 states have internal predecessors, (893), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 919 transitions. [2024-11-20 16:56:50,357 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 919 transitions. Word has length 6 [2024-11-20 16:56:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:50,357 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 919 transitions. [2024-11-20 16:56:50,358 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-20 16:56:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 919 transitions. [2024-11-20 16:56:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 16:56:50,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:50,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:50,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 16:56:50,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:50,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:56:50,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-20 16:56:50,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:50,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346485690] [2024-11-20 16:56:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:50,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-20 16:56:50,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:50,565 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:50,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 16:56:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:50,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 16:56:50,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:50,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:50,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346485690] [2024-11-20 16:56:50,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346485690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:50,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:50,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:56:50,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487817181] [2024-11-20 16:56:50,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:50,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:56:50,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:50,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:56:50,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:56:50,706 INFO L87 Difference]: Start difference. First operand 825 states and 919 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:50,742 INFO L93 Difference]: Finished difference Result 783 states and 876 transitions. [2024-11-20 16:56:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:56:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 16:56:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:50,754 INFO L225 Difference]: With dead ends: 783 [2024-11-20 16:56:50,755 INFO L226 Difference]: Without dead ends: 783 [2024-11-20 16:56:50,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:56:50,758 INFO L432 NwaCegarLoop]: 789 mSDtfsCounter, 71 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:50,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1515 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:56:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-20 16:56:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2024-11-20 16:56:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 434 states have (on average 1.9585253456221199) internal successors, (850), 777 states have internal predecessors, (850), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 876 transitions. [2024-11-20 16:56:50,785 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 876 transitions. Word has length 11 [2024-11-20 16:56:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:50,787 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 876 transitions. [2024-11-20 16:56:50,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 876 transitions. [2024-11-20 16:56:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 16:56:50,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:50,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:50,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 16:56:50,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:50,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:56:50,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash 614317568, now seen corresponding path program 1 times [2024-11-20 16:56:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:50,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796804364] [2024-11-20 16:56:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:50,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:50,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:50,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:51,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 16:56:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:51,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:56:51,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:51,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:51,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796804364] [2024-11-20 16:56:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796804364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:51,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:56:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774814656] [2024-11-20 16:56:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:51,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:56:51,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:51,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:56:51,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:51,168 INFO L87 Difference]: Start difference. First operand 783 states and 876 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:51,268 INFO L93 Difference]: Finished difference Result 761 states and 847 transitions. [2024-11-20 16:56:51,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 16:56:51,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 16:56:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:51,273 INFO L225 Difference]: With dead ends: 761 [2024-11-20 16:56:51,273 INFO L226 Difference]: Without dead ends: 761 [2024-11-20 16:56:51,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:56:51,274 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 48 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2206 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-20 16:56:51,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2206 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 16:56:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-20 16:56:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2024-11-20 16:56:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 426 states have (on average 1.9272300469483568) internal successors, (821), 755 states have internal predecessors, (821), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 847 transitions. [2024-11-20 16:56:51,296 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 847 transitions. Word has length 13 [2024-11-20 16:56:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:51,296 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 847 transitions. [2024-11-20 16:56:51,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 847 transitions. [2024-11-20 16:56:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 16:56:51,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:51,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:51,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 16:56:51,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:51,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:56:51,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash -957630610, now seen corresponding path program 1 times [2024-11-20 16:56:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:51,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483023090] [2024-11-20 16:56:51,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:51,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:51,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:51,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:51,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 16:56:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:51,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:56:51,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:51,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:56:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:51,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:51,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483023090] [2024-11-20 16:56:51,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483023090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:51,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:51,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:56:51,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294387601] [2024-11-20 16:56:51,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:51,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:56:51,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:51,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:56:51,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:51,722 INFO L87 Difference]: Start difference. First operand 761 states and 847 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:53,416 INFO L93 Difference]: Finished difference Result 761 states and 847 transitions. [2024-11-20 16:56:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:56:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-20 16:56:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:53,420 INFO L225 Difference]: With dead ends: 761 [2024-11-20 16:56:53,420 INFO L226 Difference]: Without dead ends: 761 [2024-11-20 16:56:53,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:56:53,421 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 472 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:53,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 944 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 16:56:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-20 16:56:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 757. [2024-11-20 16:56:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 426 states have (on average 1.9178403755868545) internal successors, (817), 751 states have internal predecessors, (817), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 843 transitions. [2024-11-20 16:56:53,436 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 843 transitions. Word has length 27 [2024-11-20 16:56:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:53,436 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 843 transitions. [2024-11-20 16:56:53,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 843 transitions. [2024-11-20 16:56:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 16:56:53,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:53,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:53,442 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-20 16:56:53,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:53,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:56:53,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:53,639 INFO L85 PathProgramCache]: Analyzing trace with hash -957630609, now seen corresponding path program 1 times [2024-11-20 16:56:53,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:53,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717057025] [2024-11-20 16:56:53,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:53,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:53,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:53,642 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:53,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 16:56:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:53,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 16:56:53,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:53,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 16:56:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:53,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:53,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:53,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717057025] [2024-11-20 16:56:53,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717057025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:53,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:53,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:56:53,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037423476] [2024-11-20 16:56:53,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:53,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:56:53,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:53,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:56:53,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:53,955 INFO L87 Difference]: Start difference. First operand 757 states and 843 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:56,017 INFO L93 Difference]: Finished difference Result 805 states and 858 transitions. [2024-11-20 16:56:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:56:56,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-20 16:56:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:56,021 INFO L225 Difference]: With dead ends: 805 [2024-11-20 16:56:56,021 INFO L226 Difference]: Without dead ends: 805 [2024-11-20 16:56:56,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:56:56,022 INFO L432 NwaCegarLoop]: 680 mSDtfsCounter, 196 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:56,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1371 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 16:56:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-20 16:56:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 753. [2024-11-20 16:56:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 426 states have (on average 1.908450704225352) internal successors, (813), 747 states have internal predecessors, (813), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 839 transitions. [2024-11-20 16:56:56,042 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 839 transitions. Word has length 27 [2024-11-20 16:56:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:56,042 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 839 transitions. [2024-11-20 16:56:56,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 839 transitions. [2024-11-20 16:56:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 16:56:56,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:56,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:56,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-20 16:56:56,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:56,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:56:56,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:56,246 INFO L85 PathProgramCache]: Analyzing trace with hash -3860248, now seen corresponding path program 1 times [2024-11-20 16:56:56,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:56,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971134050] [2024-11-20 16:56:56,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:56,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:56,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:56,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:56,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 16:56:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:56,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:56:56,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:56,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:56,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971134050] [2024-11-20 16:56:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971134050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:56,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:56,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:56:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897870713] [2024-11-20 16:56:56,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:56,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:56:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:56,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:56:56,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:56,481 INFO L87 Difference]: Start difference. First operand 753 states and 839 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:56,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:56,565 INFO L93 Difference]: Finished difference Result 747 states and 829 transitions. [2024-11-20 16:56:56,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 16:56:56,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-20 16:56:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:56,569 INFO L225 Difference]: With dead ends: 747 [2024-11-20 16:56:56,569 INFO L226 Difference]: Without dead ends: 747 [2024-11-20 16:56:56,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:56:56,571 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 21 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:56,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2183 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:56:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-11-20 16:56:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2024-11-20 16:56:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 420 states have (on average 1.911904761904762) internal successors, (803), 741 states have internal predecessors, (803), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 829 transitions. [2024-11-20 16:56:56,590 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 829 transitions. Word has length 43 [2024-11-20 16:56:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:56,590 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 829 transitions. [2024-11-20 16:56:56,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 829 transitions. [2024-11-20 16:56:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-20 16:56:56,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:56,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:56,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 16:56:56,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:56,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:56:56,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 168131124, now seen corresponding path program 1 times [2024-11-20 16:56:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917908437] [2024-11-20 16:56:56,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:56,796 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:56,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 16:56:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:57,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:56:57,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:57,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:57,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917908437] [2024-11-20 16:56:57,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917908437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:57,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:57,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:56:57,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723174158] [2024-11-20 16:56:57,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:57,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:56:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:57,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:56:57,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:56:57,266 INFO L87 Difference]: Start difference. First operand 747 states and 829 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:57,477 INFO L93 Difference]: Finished difference Result 965 states and 1076 transitions. [2024-11-20 16:56:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:56:57,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-20 16:56:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:57,484 INFO L225 Difference]: With dead ends: 965 [2024-11-20 16:56:57,484 INFO L226 Difference]: Without dead ends: 965 [2024-11-20 16:56:57,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:56:57,485 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 178 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1512 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-20 16:56:57,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1512 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 16:56:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-20 16:56:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 794. [2024-11-20 16:56:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 467 states have (on average 1.8201284796573876) internal successors, (850), 788 states have internal predecessors, (850), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 876 transitions. [2024-11-20 16:56:57,506 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 876 transitions. Word has length 51 [2024-11-20 16:56:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:57,507 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 876 transitions. [2024-11-20 16:56:57,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 876 transitions. [2024-11-20 16:56:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 16:56:57,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:57,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:57,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 16:56:57,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:57,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:56:57,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash 754975115, now seen corresponding path program 1 times [2024-11-20 16:56:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125984116] [2024-11-20 16:56:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:57,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:57,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:57,724 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:57,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-20 16:56:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:58,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 16:56:58,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:58,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 16:56:58,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:56:58,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 16:56:58,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 16:56:58,564 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 16:56:58,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-20 16:56:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:58,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:58,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:58,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125984116] [2024-11-20 16:56:58,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125984116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:58,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:58,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:56:58,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824879784] [2024-11-20 16:56:58,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:58,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:56:58,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:58,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:56:58,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:58,580 INFO L87 Difference]: Start difference. First operand 794 states and 876 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:59,772 INFO L93 Difference]: Finished difference Result 756 states and 838 transitions. [2024-11-20 16:56:59,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:56:59,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-20 16:56:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:59,775 INFO L225 Difference]: With dead ends: 756 [2024-11-20 16:56:59,775 INFO L226 Difference]: Without dead ends: 756 [2024-11-20 16:56:59,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:59,776 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 374 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:59,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 682 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 16:56:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-20 16:56:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 719. [2024-11-20 16:56:59,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 430 states have (on average 1.716279069767442) internal successors, (738), 713 states have internal predecessors, (738), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:56:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 764 transitions. [2024-11-20 16:56:59,789 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 764 transitions. Word has length 54 [2024-11-20 16:56:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:59,790 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 764 transitions. [2024-11-20 16:56:59,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 764 transitions. [2024-11-20 16:56:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 16:56:59,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:59,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:59,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-20 16:56:59,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:59,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:56:59,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100217, now seen corresponding path program 1 times [2024-11-20 16:56:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:59,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382117922] [2024-11-20 16:56:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:59,996 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:56:59,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 16:57:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:00,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 16:57:00,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:00,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 16:57:00,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:57:00,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 16:57:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:00,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:00,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:00,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382117922] [2024-11-20 16:57:00,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382117922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:00,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:00,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805472676] [2024-11-20 16:57:00,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:00,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 16:57:00,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:00,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 16:57:00,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:00,286 INFO L87 Difference]: Start difference. First operand 719 states and 764 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:01,736 INFO L93 Difference]: Finished difference Result 718 states and 763 transitions. [2024-11-20 16:57:01,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 16:57:01,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-20 16:57:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:01,739 INFO L225 Difference]: With dead ends: 718 [2024-11-20 16:57:01,739 INFO L226 Difference]: Without dead ends: 718 [2024-11-20 16:57:01,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 16:57:01,740 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 2 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:01,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1842 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 16:57:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-20 16:57:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2024-11-20 16:57:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 430 states have (on average 1.713953488372093) internal successors, (737), 712 states have internal predecessors, (737), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 763 transitions. [2024-11-20 16:57:01,752 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 763 transitions. Word has length 59 [2024-11-20 16:57:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:01,753 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 763 transitions. [2024-11-20 16:57:01,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 763 transitions. [2024-11-20 16:57:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 16:57:01,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:01,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:01,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-20 16:57:01,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:01,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:57:01,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:01,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100216, now seen corresponding path program 1 times [2024-11-20 16:57:01,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:01,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182912892] [2024-11-20 16:57:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:01,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:01,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:01,957 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:01,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-20 16:57:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:02,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 16:57:02,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:02,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 16:57:02,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 16:57:02,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:57:02,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-20 16:57:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:02,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:02,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:02,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182912892] [2024-11-20 16:57:02,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182912892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:02,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:02,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:02,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309457058] [2024-11-20 16:57:02,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:02,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 16:57:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:02,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 16:57:02,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:02,320 INFO L87 Difference]: Start difference. First operand 718 states and 763 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:04,258 INFO L93 Difference]: Finished difference Result 717 states and 762 transitions. [2024-11-20 16:57:04,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 16:57:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-20 16:57:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:04,262 INFO L225 Difference]: With dead ends: 717 [2024-11-20 16:57:04,262 INFO L226 Difference]: Without dead ends: 717 [2024-11-20 16:57:04,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 16:57:04,263 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 1 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:04,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1865 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 16:57:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-20 16:57:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-11-20 16:57:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 429 states have (on average 1.7156177156177157) internal successors, (736), 711 states have internal predecessors, (736), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 762 transitions. [2024-11-20 16:57:04,295 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 762 transitions. Word has length 59 [2024-11-20 16:57:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:04,295 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 762 transitions. [2024-11-20 16:57:04,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:57:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 762 transitions. [2024-11-20 16:57:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 16:57:04,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:04,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:04,306 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-20 16:57:04,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:04,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:57:04,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 216241902, now seen corresponding path program 1 times [2024-11-20 16:57:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:04,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726894765] [2024-11-20 16:57:04,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:04,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:04,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:04,500 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:04,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 16:57:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:04,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:04,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:04,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:04,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:04,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726894765] [2024-11-20 16:57:04,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726894765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:04,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:04,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:04,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953816180] [2024-11-20 16:57:04,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:04,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:04,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:04,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:04,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:04,758 INFO L87 Difference]: Start difference. First operand 717 states and 762 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 16:57:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:04,797 INFO L93 Difference]: Finished difference Result 720 states and 766 transitions. [2024-11-20 16:57:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:04,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2024-11-20 16:57:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:04,802 INFO L225 Difference]: With dead ends: 720 [2024-11-20 16:57:04,804 INFO L226 Difference]: Without dead ends: 720 [2024-11-20 16:57:04,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:04,805 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 0 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2128 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-20 16:57:04,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2128 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:57:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-20 16:57:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2024-11-20 16:57:04,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 431 states have (on average 1.71461716937355) internal successors, (739), 714 states have internal predecessors, (739), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-20 16:57:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 766 transitions. [2024-11-20 16:57:04,823 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 766 transitions. Word has length 67 [2024-11-20 16:57:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:04,824 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 766 transitions. [2024-11-20 16:57:04,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 16:57:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 766 transitions. [2024-11-20 16:57:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 16:57:04,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:04,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:04,835 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-20 16:57:05,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:05,027 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:57:05,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:05,028 INFO L85 PathProgramCache]: Analyzing trace with hash -572148029, now seen corresponding path program 1 times [2024-11-20 16:57:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:05,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196940093] [2024-11-20 16:57:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:05,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:05,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:05,032 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:05,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-20 16:57:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:05,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:57:05,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:05,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:05,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:05,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196940093] [2024-11-20 16:57:05,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196940093] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:05,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:05,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 16:57:05,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363134477] [2024-11-20 16:57:05,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:05,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 16:57:05,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:05,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 16:57:05,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 16:57:05,363 INFO L87 Difference]: Start difference. First operand 720 states and 766 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:05,499 INFO L93 Difference]: Finished difference Result 732 states and 783 transitions. [2024-11-20 16:57:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 16:57:05,500 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-20 16:57:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:05,502 INFO L225 Difference]: With dead ends: 732 [2024-11-20 16:57:05,502 INFO L226 Difference]: Without dead ends: 732 [2024-11-20 16:57:05,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-20 16:57:05,503 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 5 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:05,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2835 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 16:57:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-20 16:57:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2024-11-20 16:57:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 440 states have (on average 1.7136363636363636) internal successors, (754), 723 states have internal predecessors, (754), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-20 16:57:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 781 transitions. [2024-11-20 16:57:05,515 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 781 transitions. Word has length 68 [2024-11-20 16:57:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:05,516 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 781 transitions. [2024-11-20 16:57:05,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 781 transitions. [2024-11-20 16:57:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-20 16:57:05,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:05,517 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:05,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-20 16:57:05,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:05,718 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:57:05,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:05,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1280795694, now seen corresponding path program 2 times [2024-11-20 16:57:05,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:05,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44036231] [2024-11-20 16:57:05,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 16:57:05,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:05,720 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:05,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-20 16:57:06,056 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 16:57:06,057 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:06,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 16:57:06,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:06,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:06,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:06,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44036231] [2024-11-20 16:57:06,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44036231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:06,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:06,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-20 16:57:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35358857] [2024-11-20 16:57:06,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:06,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 16:57:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 16:57:06,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-20 16:57:06,319 INFO L87 Difference]: Start difference. First operand 730 states and 781 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:06,716 INFO L93 Difference]: Finished difference Result 745 states and 802 transitions. [2024-11-20 16:57:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 16:57:06,717 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-20 16:57:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:06,719 INFO L225 Difference]: With dead ends: 745 [2024-11-20 16:57:06,719 INFO L226 Difference]: Without dead ends: 739 [2024-11-20 16:57:06,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-20 16:57:06,720 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 14 mSDsluCounter, 4253 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:06,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4965 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 16:57:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-20 16:57:06,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2024-11-20 16:57:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 449 states have (on average 1.7037861915367483) internal successors, (765), 732 states have internal predecessors, (765), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-20 16:57:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 792 transitions. [2024-11-20 16:57:06,734 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 792 transitions. Word has length 71 [2024-11-20 16:57:06,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:06,735 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 792 transitions. [2024-11-20 16:57:06,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 792 transitions. [2024-11-20 16:57:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 16:57:06,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:06,736 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:06,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:06,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:06,937 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:57:06,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1827542002, now seen corresponding path program 3 times [2024-11-20 16:57:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137822041] [2024-11-20 16:57:06,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 16:57:06,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:06,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:06,939 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:06,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-20 16:57:07,491 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 16:57:07,491 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:07,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 16:57:07,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:07,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:08,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:08,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137822041] [2024-11-20 16:57:08,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137822041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:08,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:08,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-20 16:57:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229013898] [2024-11-20 16:57:08,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:08,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 16:57:08,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:08,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 16:57:08,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-20 16:57:08,088 INFO L87 Difference]: Start difference. First operand 739 states and 792 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:09,401 INFO L93 Difference]: Finished difference Result 763 states and 831 transitions. [2024-11-20 16:57:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 16:57:09,402 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2024-11-20 16:57:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:09,405 INFO L225 Difference]: With dead ends: 763 [2024-11-20 16:57:09,405 INFO L226 Difference]: Without dead ends: 757 [2024-11-20 16:57:09,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-20 16:57:09,407 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 23 mSDsluCounter, 8507 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9219 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:09,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9219 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 16:57:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-11-20 16:57:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2024-11-20 16:57:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 467 states have (on average 1.6873661670235547) internal successors, (788), 750 states have internal predecessors, (788), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-20 16:57:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 815 transitions. [2024-11-20 16:57:09,419 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 815 transitions. Word has length 77 [2024-11-20 16:57:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:09,420 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 815 transitions. [2024-11-20 16:57:09,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 815 transitions. [2024-11-20 16:57:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 16:57:09,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:09,421 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:09,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:09,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:09,622 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:57:09,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash -473119794, now seen corresponding path program 4 times [2024-11-20 16:57:09,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:09,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088934474] [2024-11-20 16:57:09,623 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 16:57:09,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:09,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:09,624 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:09,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-20 16:57:10,053 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 16:57:10,053 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:10,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 16:57:10,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:10,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:11,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:11,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088934474] [2024-11-20 16:57:11,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088934474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:11,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:11,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-20 16:57:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126976148] [2024-11-20 16:57:11,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:11,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-20 16:57:11,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:11,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-20 16:57:11,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-20 16:57:11,720 INFO L87 Difference]: Start difference. First operand 757 states and 815 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:16,457 INFO L93 Difference]: Finished difference Result 797 states and 887 transitions. [2024-11-20 16:57:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-20 16:57:16,458 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-20 16:57:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:16,461 INFO L225 Difference]: With dead ends: 797 [2024-11-20 16:57:16,461 INFO L226 Difference]: Without dead ends: 793 [2024-11-20 16:57:16,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-20 16:57:16,464 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 34 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 1911 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16998 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:16,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16998 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1911 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 16:57:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-20 16:57:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2024-11-20 16:57:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 501 states have (on average 1.6646706586826348) internal successors, (834), 784 states have internal predecessors, (834), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-20 16:57:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 861 transitions. [2024-11-20 16:57:16,477 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 861 transitions. Word has length 89 [2024-11-20 16:57:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:16,477 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 861 transitions. [2024-11-20 16:57:16,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 861 transitions. [2024-11-20 16:57:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 16:57:16,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:16,479 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:16,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:16,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:16,680 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-20 16:57:16,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash 666044590, now seen corresponding path program 5 times [2024-11-20 16:57:16,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:16,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405392884] [2024-11-20 16:57:16,681 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 16:57:16,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:16,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:16,684 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:16,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-20 16:57:17,833 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-20 16:57:17,833 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:17,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-20 16:57:17,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:17,880 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-20 16:57:17,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-20 16:57:18,222 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-20 16:57:18,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-20 16:57:18,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:57:18,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-11-20 16:57:21,001 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 16:57:21,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-11-20 16:57:21,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-11-20 16:57:21,136 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-20 16:57:21,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:21,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:21,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405392884] [2024-11-20 16:57:21,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405392884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 16:57:21,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [48779153] [2024-11-20 16:57:21,580 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 16:57:21,580 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 16:57:21,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 16:57:21,582 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-20 16:57:21,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process