./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash e2bb1828824fef1ebc4678312eafda6c009efcfccb4cbbca24aec817e45186ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:09:02,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:09:02,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 18:09:02,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:09:02,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:09:02,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:09:02,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:09:02,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:09:02,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:09:02,626 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:09:02,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:09:02,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:09:02,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:09:02,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:09:02,631 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:09:02,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:09:02,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:09:02,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:09:02,632 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:09:02,632 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:09:02,633 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:09:02,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:09:02,636 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:09:02,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:09:02,637 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:09:02,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:09:02,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:09:02,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:09:02,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:09:02,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:09:02,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:09:02,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:09:02,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:09:02,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:09:02,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:09:02,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:09:02,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:09:02,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:09:02,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:09:02,643 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-clean/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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2bb1828824fef1ebc4678312eafda6c009efcfccb4cbbca24aec817e45186ea [2024-10-11 18:09:02,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:09:02,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:09:02,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:09:02,961 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:09:02,962 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:09:02,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i [2024-10-11 18:09:04,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:09:04,938 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:09:04,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i [2024-10-11 18:09:04,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dec7f592b/e06755b8315c4aa7bb40b4c01cedcf1c/FLAGb4318810d [2024-10-11 18:09:04,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dec7f592b/e06755b8315c4aa7bb40b4c01cedcf1c [2024-10-11 18:09:04,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:09:04,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:09:04,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:09:04,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:09:04,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:09:04,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:09:04" (1/1) ... [2024-10-11 18:09:04,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598aaf7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:04, skipping insertion in model container [2024-10-11 18:09:04,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:09:04" (1/1) ... [2024-10-11 18:09:05,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:09:05,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:09:05,439 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-10-11 18:09:05,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@775dd44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:05, skipping insertion in model container [2024-10-11 18:09:05,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:09:05,441 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 18:09:05,444 INFO L158 Benchmark]: Toolchain (without parser) took 456.54ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 84.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 18:09:05,444 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:09:05,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.17ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 84.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 18:09:05,447 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.15ms. Allocated memory is still 159.4MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.17ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 84.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2513]: 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash e2bb1828824fef1ebc4678312eafda6c009efcfccb4cbbca24aec817e45186ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:09:07,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:09:07,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2024-10-11 18:09:07,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:09:07,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:09:07,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:09:07,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:09:07,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:09:07,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:09:07,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:09:07,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:09:07,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:09:07,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:09:07,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:09:07,908 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:09:07,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:09:07,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:09:07,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:09:07,916 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:09:07,916 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:09:07,917 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:09:07,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:09:07,919 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:09:07,919 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 18:09:07,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:09:07,920 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 18:09:07,920 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:09:07,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:09:07,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:09:07,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:09:07,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:09:07,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:09:07,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:09:07,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:09:07,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:09:07,924 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 18:09:07,925 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 18:09:07,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:09:07,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:09:07,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:09:07,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:09:07,926 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 18:09:07,926 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-clean/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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2bb1828824fef1ebc4678312eafda6c009efcfccb4cbbca24aec817e45186ea [2024-10-11 18:09:08,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:09:08,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:09:08,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:09:08,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:09:08,349 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:09:08,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i [2024-10-11 18:09:09,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:09:10,324 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:09:10,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i [2024-10-11 18:09:10,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5ef10a735/bd474c4ac978445fa09189d5384ea168/FLAG72b3c8322 [2024-10-11 18:09:10,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5ef10a735/bd474c4ac978445fa09189d5384ea168 [2024-10-11 18:09:10,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:09:10,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:09:10,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:09:10,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:09:10,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:09:10,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:09:10" (1/1) ... [2024-10-11 18:09:10,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac7f524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:10, skipping insertion in model container [2024-10-11 18:09:10,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:09:10" (1/1) ... [2024-10-11 18:09:10,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:09:10,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:09:10,909 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 18:09:10,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:09:10,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:09:10,966 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:09:11,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:09:11,056 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:09:11,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11 WrapperNode [2024-10-11 18:09:11,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:09:11,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:09:11,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:09:11,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:09:11,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,123 INFO L138 Inliner]: procedures = 129, calls = 45, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 135 [2024-10-11 18:09:11,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:09:11,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:09:11,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:09:11,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:09:11,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,206 INFO L175 MemorySlicer]: Split 25 memory accesses to 1 slices as follows [25]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 13 writes are split as follows [13]. [2024-10-11 18:09:11,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:09:11,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:09:11,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:09:11,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:09:11,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (1/1) ... [2024-10-11 18:09:11,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:09:11,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:11,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:09:11,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:09:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2024-10-11 18:09:11,345 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2024-10-11 18:09:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-11 18:09:11,346 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-11 18:09:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:09:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:09:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:09:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:09:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 18:09:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:09:11,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:09:11,491 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:09:11,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:09:12,438 INFO L? ?]: Removed 173 outVars from TransFormulas that were not future-live. [2024-10-11 18:09:12,439 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:09:12,528 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:09:12,530 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-11 18:09:12,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:09:12 BoogieIcfgContainer [2024-10-11 18:09:12,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:09:12,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:09:12,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:09:12,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:09:12,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:09:10" (1/3) ... [2024-10-11 18:09:12,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94d06ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:09:12, skipping insertion in model container [2024-10-11 18:09:12,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:11" (2/3) ... [2024-10-11 18:09:12,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94d06ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:09:12, skipping insertion in model container [2024-10-11 18:09:12,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:09:12" (3/3) ... [2024-10-11 18:09:12,541 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-linux-list.i [2024-10-11 18:09:12,562 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:09:12,563 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2024-10-11 18:09:12,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:09:12,637 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;@27e64844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:09:12,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2024-10-11 18:09:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 53 states have (on average 2.339622641509434) internal successors, (124), 111 states have internal predecessors, (124), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:09:12,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:12,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:09:12,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:12,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash 8225201, now seen corresponding path program 1 times [2024-10-11 18:09:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:12,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219239233] [2024-10-11 18:09:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:12,696 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-10-11 18:09:12,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:12,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:12,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:12,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:09:12,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:12,864 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-10-11 18:09:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:12,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:12,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219239233] [2024-10-11 18:09:12,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219239233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:12,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:09:12,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405056625] [2024-10-11 18:09:12,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:12,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:09:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:12,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:09:12,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:09:12,931 INFO L87 Difference]: Start difference. First operand has 117 states, 53 states have (on average 2.339622641509434) internal successors, (124), 111 states have internal predecessors, (124), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:09:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:13,406 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2024-10-11 18:09:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:09:13,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:09:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:13,420 INFO L225 Difference]: With dead ends: 114 [2024-10-11 18:09:13,421 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 18:09:13,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-11 18:09:13,430 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:13,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 152 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:09:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 18:09:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 18:09:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 107 states have internal predecessors, (112), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2024-10-11 18:09:13,494 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 4 [2024-10-11 18:09:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:13,495 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2024-10-11 18:09:13,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:09:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2024-10-11 18:09:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:09:13,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:13,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:09:13,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:13,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:13,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:13,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash 8225202, now seen corresponding path program 1 times [2024-10-11 18:09:13,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:13,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868237195] [2024-10-11 18:09:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:13,698 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-10-11 18:09:13,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:13,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:13,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:13,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:09:13,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:13,777 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-10-11 18:09:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:13,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:13,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:13,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868237195] [2024-10-11 18:09:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868237195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:13,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:09:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131594393] [2024-10-11 18:09:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:13,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:09:13,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:13,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:09:13,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:09:13,807 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:09:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:14,270 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2024-10-11 18:09:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:09:14,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:09:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:14,273 INFO L225 Difference]: With dead ends: 110 [2024-10-11 18:09:14,274 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 18:09:14,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-11 18:09:14,276 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:14,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 156 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:09:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 18:09:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 18:09:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 53 states have (on average 2.056603773584906) internal successors, (109), 104 states have internal predecessors, (109), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2024-10-11 18:09:14,297 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 4 [2024-10-11 18:09:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:14,297 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2024-10-11 18:09:14,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:09:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2024-10-11 18:09:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:09:14,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:14,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:14,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:14,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:14,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:14,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash -651345792, now seen corresponding path program 1 times [2024-10-11 18:09:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:14,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409100543] [2024-10-11 18:09:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:14,502 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-10-11 18:09:14,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:14,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:14,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:14,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:09:14,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:14,637 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-10-11 18:09:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:14,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:14,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:14,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409100543] [2024-10-11 18:09:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409100543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:14,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:14,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:09:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001615502] [2024-10-11 18:09:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:14,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:09:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:14,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:09:14,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:09:14,651 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:14,996 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2024-10-11 18:09:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:09:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 18:09:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:14,999 INFO L225 Difference]: With dead ends: 109 [2024-10-11 18:09:14,999 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 18:09:14,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:09:15,000 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:15,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:09:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 18:09:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 18:09:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 103 states have internal predecessors, (108), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2024-10-11 18:09:15,013 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 15 [2024-10-11 18:09:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:15,014 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2024-10-11 18:09:15,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2024-10-11 18:09:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:09:15,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:15,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:15,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:15,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:15,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:15,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:15,217 INFO L85 PathProgramCache]: Analyzing trace with hash -651345791, now seen corresponding path program 1 times [2024-10-11 18:09:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136368541] [2024-10-11 18:09:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:15,218 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-10-11 18:09:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:15,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:15,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:15,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:09:15,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:15,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:09:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:15,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:15,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136368541] [2024-10-11 18:09:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136368541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:15,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:09:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062480306] [2024-10-11 18:09:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:15,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:09:15,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:15,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:09:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:09:15,371 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:15,790 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2024-10-11 18:09:15,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:09:15,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 18:09:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:15,794 INFO L225 Difference]: With dead ends: 108 [2024-10-11 18:09:15,794 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 18:09:15,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:09:15,795 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:15,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:09:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 18:09:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 18:09:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 53 states have (on average 2.018867924528302) internal successors, (107), 102 states have internal predecessors, (107), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2024-10-11 18:09:15,808 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 15 [2024-10-11 18:09:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:15,809 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2024-10-11 18:09:15,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2024-10-11 18:09:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:09:15,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:15,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:15,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:16,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:16,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_internalErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:16,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:16,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1283118861, now seen corresponding path program 1 times [2024-10-11 18:09:16,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:16,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146039553] [2024-10-11 18:09:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:16,014 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-10-11 18:09:16,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:16,017 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:16,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:16,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:09:16,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:16,175 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-10-11 18:09:16,318 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:09:16,319 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 14 treesize of output 20 [2024-10-11 18:09:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:16,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:16,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:16,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146039553] [2024-10-11 18:09:16,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146039553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:16,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:16,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:09:16,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050674516] [2024-10-11 18:09:16,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:16,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:09:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:16,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:09:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:09:16,391 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:17,547 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-10-11 18:09:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:09:17,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 18:09:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:17,551 INFO L225 Difference]: With dead ends: 131 [2024-10-11 18:09:17,552 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 18:09:17,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:09:17,553 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:17,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 411 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 18:09:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 18:09:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2024-10-11 18:09:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 63 states have (on average 2.0) internal successors, (126), 111 states have internal predecessors, (126), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2024-10-11 18:09:17,566 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 16 [2024-10-11 18:09:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:17,566 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2024-10-11 18:09:17,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2024-10-11 18:09:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:09:17,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:17,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:17,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 18:09:17,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:17,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_internalErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:17,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1283118862, now seen corresponding path program 1 times [2024-10-11 18:09:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:17,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094072653] [2024-10-11 18:09:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:17,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:09:17,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:17,772 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:17,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:17,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 18:09:17,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:17,980 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-10-11 18:09:17,991 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-10-11 18:09:18,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:09:18,310 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-10-11 18:09:18,324 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:09:18,325 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-10-11 18:09:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:18,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:18,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094072653] [2024-10-11 18:09:18,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094072653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:18,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:09:18,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869549267] [2024-10-11 18:09:18,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:18,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:09:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:09:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:09:18,399 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:19,772 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2024-10-11 18:09:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:09:19,773 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 18:09:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:19,774 INFO L225 Difference]: With dead ends: 130 [2024-10-11 18:09:19,774 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 18:09:19,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:09:19,775 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 37 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:19,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 357 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 18:09:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 18:09:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2024-10-11 18:09:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 111 states have internal predecessors, (125), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2024-10-11 18:09:19,783 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 16 [2024-10-11 18:09:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:19,784 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2024-10-11 18:09:19,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2024-10-11 18:09:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:09:19,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:19,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:19,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:19,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:19,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:19,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1121980778, now seen corresponding path program 1 times [2024-10-11 18:09:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:19,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278066302] [2024-10-11 18:09:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:19,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:09:19,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:19,989 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:19,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:20,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:09:20,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:20,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:20,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:20,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278066302] [2024-10-11 18:09:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278066302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:20,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:09:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573293764] [2024-10-11 18:09:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:20,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:09:20,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:09:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:09:20,111 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:20,323 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2024-10-11 18:09:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:09:20,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 18:09:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:20,325 INFO L225 Difference]: With dead ends: 117 [2024-10-11 18:09:20,325 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 18:09:20,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-10-11 18:09:20,326 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:20,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:09:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 18:09:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-11 18:09:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 110 states have internal predecessors, (123), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2024-10-11 18:09:20,333 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 17 [2024-10-11 18:09:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:20,333 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2024-10-11 18:09:20,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2024-10-11 18:09:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:09:20,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:20,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:20,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:20,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:20,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:20,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1121980779, now seen corresponding path program 1 times [2024-10-11 18:09:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:20,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785564945] [2024-10-11 18:09:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:20,539 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-10-11 18:09:20,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:20,542 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:20,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:20,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:09:20,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:20,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:20,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785564945] [2024-10-11 18:09:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785564945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:20,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:20,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:09:20,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019982733] [2024-10-11 18:09:20,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:20,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:09:20,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:20,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:09:20,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:09:20,787 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:21,652 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2024-10-11 18:09:21,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:09:21,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 18:09:21,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:21,655 INFO L225 Difference]: With dead ends: 134 [2024-10-11 18:09:21,655 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 18:09:21,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:09:21,656 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 42 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:21,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 697 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 18:09:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 18:09:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2024-10-11 18:09:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 63 states have (on average 1.9365079365079365) internal successors, (122), 110 states have internal predecessors, (122), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2024-10-11 18:09:21,669 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 17 [2024-10-11 18:09:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:21,669 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2024-10-11 18:09:21,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2024-10-11 18:09:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:09:21,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:21,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:21,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:21,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:21,872 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_internalErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:21,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash 421665923, now seen corresponding path program 1 times [2024-10-11 18:09:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:21,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508179629] [2024-10-11 18:09:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:21,873 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-10-11 18:09:21,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:21,874 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:21,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:22,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:09:22,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:22,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:09:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:22,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:22,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508179629] [2024-10-11 18:09:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508179629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:22,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:22,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:09:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401958415] [2024-10-11 18:09:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:22,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:09:22,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:22,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:09:22,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:09:22,049 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:22,517 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-10-11 18:09:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:09:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 18:09:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:22,519 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:09:22,519 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:09:22,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:09:22,520 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 7 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:22,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 249 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:09:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:09:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 18:09:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.873015873015873) internal successors, (118), 108 states have internal predecessors, (118), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-10-11 18:09:22,526 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 18 [2024-10-11 18:09:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:22,526 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-10-11 18:09:22,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-10-11 18:09:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:09:22,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:22,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:22,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:22,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:22,728 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_internalErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:22,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:22,729 INFO L85 PathProgramCache]: Analyzing trace with hash 421665924, now seen corresponding path program 1 times [2024-10-11 18:09:22,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:22,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141256124] [2024-10-11 18:09:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:22,730 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-10-11 18:09:22,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:22,733 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:22,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:22,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:09:22,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:22,896 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-10-11 18:09:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:22,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:22,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141256124] [2024-10-11 18:09:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141256124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:22,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:09:22,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042802270] [2024-10-11 18:09:22,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:22,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:09:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:22,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:09:22,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:09:22,949 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:23,504 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2024-10-11 18:09:23,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:09:23,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 18:09:23,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:23,506 INFO L225 Difference]: With dead ends: 113 [2024-10-11 18:09:23,506 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 18:09:23,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:09:23,507 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:23,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 255 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:09:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 18:09:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 18:09:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 106 states have internal predecessors, (114), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2024-10-11 18:09:23,512 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 18 [2024-10-11 18:09:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:23,512 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2024-10-11 18:09:23,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2024-10-11 18:09:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:09:23,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:23,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:23,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:23,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:23,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:23,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1494031814, now seen corresponding path program 1 times [2024-10-11 18:09:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:23,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939610645] [2024-10-11 18:09:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:23,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-10-11 18:09:23,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:23,722 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:23,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:23,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 18:09:23,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:23,956 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-10-11 18:09:23,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:09:24,233 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:09:24,234 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-10-11 18:09:24,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:09:24,331 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 15 treesize of output 7 [2024-10-11 18:09:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:24,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:24,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:24,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939610645] [2024-10-11 18:09:24,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939610645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:24,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:24,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:09:24,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692248337] [2024-10-11 18:09:24,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:24,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:09:24,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:24,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:09:24,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:09:24,369 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:25,901 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-10-11 18:09:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:09:25,903 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 18:09:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:25,904 INFO L225 Difference]: With dead ends: 127 [2024-10-11 18:09:25,904 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 18:09:25,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:09:25,905 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 10 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:25,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 595 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 18:09:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 18:09:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-10-11 18:09:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 114 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2024-10-11 18:09:25,911 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 20 [2024-10-11 18:09:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:25,914 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2024-10-11 18:09:25,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2024-10-11 18:09:25,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:09:25,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:25,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:25,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:26,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:26,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:26,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1494031815, now seen corresponding path program 1 times [2024-10-11 18:09:26,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:26,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264813852] [2024-10-11 18:09:26,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:26,117 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-10-11 18:09:26,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:26,119 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:26,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:26,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 18:09:26,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:26,457 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-10-11 18:09:26,465 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-10-11 18:09:26,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:09:26,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:09:26,930 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:09:26,930 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-10-11 18:09:26,948 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-10-11 18:09:27,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:09:27,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:09:27,118 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 15 treesize of output 7 [2024-10-11 18:09:27,127 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 7 treesize of output 3 [2024-10-11 18:09:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:27,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:27,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:27,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264813852] [2024-10-11 18:09:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264813852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:27,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:27,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:09:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469144633] [2024-10-11 18:09:27,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:27,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:09:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:09:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:09:27,185 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:28,827 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2024-10-11 18:09:28,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:09:28,827 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 18:09:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:28,828 INFO L225 Difference]: With dead ends: 127 [2024-10-11 18:09:28,828 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 18:09:28,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:09:28,829 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 10 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:28,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 409 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 18:09:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 18:09:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-10-11 18:09:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 71 states have (on average 1.732394366197183) internal successors, (123), 114 states have internal predecessors, (123), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:09:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-10-11 18:09:28,834 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 20 [2024-10-11 18:09:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:28,834 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-10-11 18:09:28,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:09:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-10-11 18:09:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:09:28,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:28,837 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] [2024-10-11 18:09:28,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:29,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:29,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:29,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1821893273, now seen corresponding path program 1 times [2024-10-11 18:09:29,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:29,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383752926] [2024-10-11 18:09:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:29,039 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-10-11 18:09:29,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:29,040 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:29,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:29,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:09:29,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:29,151 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-10-11 18:09:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:29,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:29,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:29,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383752926] [2024-10-11 18:09:29,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383752926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:29,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:29,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:09:29,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870155026] [2024-10-11 18:09:29,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:29,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:09:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:29,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:09:29,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:09:29,262 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:30,037 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2024-10-11 18:09:30,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:09:30,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-11 18:09:30,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:30,039 INFO L225 Difference]: With dead ends: 140 [2024-10-11 18:09:30,039 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 18:09:30,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:09:30,040 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:30,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 378 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 18:09:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 18:09:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2024-10-11 18:09:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.728395061728395) internal successors, (140), 124 states have internal predecessors, (140), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:09:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2024-10-11 18:09:30,046 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 21 [2024-10-11 18:09:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:30,046 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2024-10-11 18:09:30,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2024-10-11 18:09:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:09:30,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:30,047 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] [2024-10-11 18:09:30,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:30,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:30,248 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:30,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1821893272, now seen corresponding path program 1 times [2024-10-11 18:09:30,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:30,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800403902] [2024-10-11 18:09:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:30,250 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-10-11 18:09:30,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:30,254 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:30,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:30,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 18:09:30,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:30,356 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-10-11 18:09:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:30,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:30,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:30,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800403902] [2024-10-11 18:09:30,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800403902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:30,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:30,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:09:30,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934865072] [2024-10-11 18:09:30,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:09:30,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:30,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:09:30,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:09:30,566 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:31,699 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2024-10-11 18:09:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:09:31,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-11 18:09:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:31,701 INFO L225 Difference]: With dead ends: 139 [2024-10-11 18:09:31,701 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 18:09:31,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:09:31,701 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 14 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:31,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 408 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 18:09:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 18:09:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2024-10-11 18:09:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 124 states have internal predecessors, (138), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:09:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2024-10-11 18:09:31,707 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 21 [2024-10-11 18:09:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:31,707 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2024-10-11 18:09:31,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2024-10-11 18:09:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:09:31,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:31,708 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] [2024-10-11 18:09:31,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:31,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:31,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:31,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:31,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1507193128, now seen corresponding path program 1 times [2024-10-11 18:09:31,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:31,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474222048] [2024-10-11 18:09:31,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:31,910 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-10-11 18:09:31,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:31,912 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:31,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:32,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:09:32,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:32,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:32,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474222048] [2024-10-11 18:09:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474222048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:32,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:32,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:09:32,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602715395] [2024-10-11 18:09:32,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:32,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:09:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:32,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:09:32,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:09:32,089 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:32,493 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2024-10-11 18:09:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:09:32,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 18:09:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:32,495 INFO L225 Difference]: With dead ends: 142 [2024-10-11 18:09:32,495 INFO L226 Difference]: Without dead ends: 142 [2024-10-11 18:09:32,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:09:32,496 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 20 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:32,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 494 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:09:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-11 18:09:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2024-10-11 18:09:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 125 states have internal predecessors, (138), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:09:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2024-10-11 18:09:32,501 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 23 [2024-10-11 18:09:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:32,501 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2024-10-11 18:09:32,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2024-10-11 18:09:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:09:32,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:32,502 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] [2024-10-11 18:09:32,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:32,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:32,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:32,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1507383536, now seen corresponding path program 1 times [2024-10-11 18:09:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:32,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371892816] [2024-10-11 18:09:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:32,704 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-10-11 18:09:32,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:32,705 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:32,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:32,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 18:09:32,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:32,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:09:32,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:09:32,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:09:32,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:09:33,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:09:33,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-10-11 18:09:33,261 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 7 treesize of output 3 [2024-10-11 18:09:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:33,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:33,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:33,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371892816] [2024-10-11 18:09:33,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371892816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:33,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:33,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 18:09:33,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820910412] [2024-10-11 18:09:33,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:33,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:09:33,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:33,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:09:33,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:09:33,306 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:34,258 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2024-10-11 18:09:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:09:34,259 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 18:09:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:34,260 INFO L225 Difference]: With dead ends: 138 [2024-10-11 18:09:34,260 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 18:09:34,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:09:34,261 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:34,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 652 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 18:09:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 18:09:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2024-10-11 18:09:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.654320987654321) internal successors, (134), 124 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:09:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-10-11 18:09:34,267 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 23 [2024-10-11 18:09:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:34,267 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-10-11 18:09:34,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-10-11 18:09:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:09:34,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:34,268 INFO L215 NwaCegarLoop]: trace histogram [2, 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-10-11 18:09:34,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:34,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:34,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:34,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:34,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1861564878, now seen corresponding path program 1 times [2024-10-11 18:09:34,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:34,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511345402] [2024-10-11 18:09:34,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:34,472 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-10-11 18:09:34,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:34,476 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:34,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:34,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 18:09:34,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:34,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:09:34,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:09:34,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:09:34,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-11 18:09:34,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:09:34,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-10-11 18:09:34,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-10-11 18:09:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:35,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:38,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:38,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511345402] [2024-10-11 18:09:38,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511345402] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:09:38,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:09:38,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2024-10-11 18:09:38,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425616266] [2024-10-11 18:09:38,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:38,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:09:38,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:38,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:09:38,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:09:38,112 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:09:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:40,541 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2024-10-11 18:09:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:09:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-10-11 18:09:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:40,543 INFO L225 Difference]: With dead ends: 139 [2024-10-11 18:09:40,543 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 18:09:40,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:09:40,544 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 3 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:40,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 914 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 18:09:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 18:09:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2024-10-11 18:09:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.646341463414634) internal successors, (135), 125 states have internal predecessors, (135), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:09:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2024-10-11 18:09:40,551 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2024-10-11 18:09:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:40,551 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2024-10-11 18:09:40,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:09:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2024-10-11 18:09:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:09:40,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:40,553 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:40,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:40,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:40,757 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:40,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 466970200, now seen corresponding path program 1 times [2024-10-11 18:09:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:40,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025236154] [2024-10-11 18:09:40,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:40,758 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-10-11 18:09:40,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:40,760 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:40,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:40,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:09:40,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:40,893 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-10-11 18:09:40,981 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base (_ BitVec 64))) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (_ bv1 1)))) is different from true [2024-10-11 18:09:41,021 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:09:41,021 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 14 treesize of output 20 [2024-10-11 18:09:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-11 18:09:41,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:41,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:41,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025236154] [2024-10-11 18:09:41,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025236154] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:09:41,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:09:41,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-10-11 18:09:41,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842255130] [2024-10-11 18:09:41,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:41,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:09:41,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:41,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:09:41,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-10-11 18:09:41,310 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 18:09:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:42,343 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2024-10-11 18:09:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:09:42,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2024-10-11 18:09:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:42,345 INFO L225 Difference]: With dead ends: 141 [2024-10-11 18:09:42,345 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 18:09:42,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-10-11 18:09:42,346 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:42,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 327 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 385 Invalid, 0 Unknown, 116 Unchecked, 1.0s Time] [2024-10-11 18:09:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 18:09:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2024-10-11 18:09:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 126 states have internal predecessors, (139), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:09:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2024-10-11 18:09:42,352 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 27 [2024-10-11 18:09:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:42,353 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2024-10-11 18:09:42,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 18:09:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2024-10-11 18:09:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:09:42,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:42,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:42,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-11 18:09:42,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:42,558 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:42,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:42,559 INFO L85 PathProgramCache]: Analyzing trace with hash 466970201, now seen corresponding path program 1 times [2024-10-11 18:09:42,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:42,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787343771] [2024-10-11 18:09:42,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:42,559 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-10-11 18:09:42,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:42,561 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:42,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 18:09:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:42,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 18:09:42,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:42,701 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-10-11 18:09:42,707 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-10-11 18:09:42,914 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base (_ BitVec 64))) (and (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| alloc_and_zero_~pi~0.base)))) is different from true [2024-10-11 18:09:42,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:09:42,966 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-10-11 18:09:42,983 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:09:42,983 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-10-11 18:09:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-11 18:09:43,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:43,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:43,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787343771] [2024-10-11 18:09:43,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787343771] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:43,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1983020603] [2024-10-11 18:09:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:43,272 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:09:43,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:09:43,273 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:09:43,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-10-11 18:09:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:43,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 18:09:43,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:43,490 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-10-11 18:09:43,496 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-10-11 18:09:43,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:09:43,665 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-10-11 18:09:43,677 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:09:43,678 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-10-11 18:09:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-11 18:09:43,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:47,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1983020603] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:47,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:09:47,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-11 18:09:47,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687123685] [2024-10-11 18:09:47,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:47,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:09:47,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:47,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:09:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-10-11 18:09:47,861 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 9 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:09:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:49,473 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2024-10-11 18:09:49,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:09:49,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-10-11 18:09:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:49,474 INFO L225 Difference]: With dead ends: 146 [2024-10-11 18:09:49,475 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 18:09:49,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-10-11 18:09:49,475 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:49,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 276 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 490 Invalid, 0 Unknown, 121 Unchecked, 1.5s Time] [2024-10-11 18:09:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 18:09:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-10-11 18:09:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 134 states have internal predecessors, (147), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-11 18:09:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2024-10-11 18:09:49,482 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 27 [2024-10-11 18:09:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:49,482 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2024-10-11 18:09:49,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:09:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2024-10-11 18:09:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:09:49,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:49,484 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] [2024-10-11 18:09:49,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:49,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:49,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 18:09:49,885 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:49,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2037486387, now seen corresponding path program 1 times [2024-10-11 18:09:49,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:49,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699118395] [2024-10-11 18:09:49,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:49,886 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-10-11 18:09:49,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:49,889 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:49,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 18:09:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:49,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 18:09:49,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:50,003 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-10-11 18:09:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:09:50,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:50,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699118395] [2024-10-11 18:09:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699118395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:50,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:50,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:09:50,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746782549] [2024-10-11 18:09:50,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:50,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:09:50,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:50,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:09:50,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:09:50,100 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:51,077 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2024-10-11 18:09:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:09:51,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-11 18:09:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:51,078 INFO L225 Difference]: With dead ends: 179 [2024-10-11 18:09:51,078 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 18:09:51,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:09:51,079 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 37 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:51,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 356 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 18:09:51,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 18:09:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2024-10-11 18:09:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 100 states have (on average 1.6) internal successors, (160), 142 states have internal predecessors, (160), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-11 18:09:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2024-10-11 18:09:51,085 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 28 [2024-10-11 18:09:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:51,085 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2024-10-11 18:09:51,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2024-10-11 18:09:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:09:51,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:51,088 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] [2024-10-11 18:09:51,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:51,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:51,289 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2037486388, now seen corresponding path program 1 times [2024-10-11 18:09:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:51,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133218891] [2024-10-11 18:09:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:51,290 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-10-11 18:09:51,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:51,291 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:51,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 18:09:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:51,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:09:51,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:51,410 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-10-11 18:09:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:09:51,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:51,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:09:51,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133218891] [2024-10-11 18:09:51,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133218891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:51,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:51,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:09:51,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332342167] [2024-10-11 18:09:51,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:51,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:09:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:09:51,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:09:51,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:09:51,651 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:53,077 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2024-10-11 18:09:53,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:09:53,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-11 18:09:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:53,079 INFO L225 Difference]: With dead ends: 193 [2024-10-11 18:09:53,079 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 18:09:53,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:09:53,080 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:53,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 377 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 18:09:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 18:09:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2024-10-11 18:09:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 118 states have (on average 1.694915254237288) internal successors, (200), 160 states have internal predecessors, (200), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-11 18:09:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 217 transitions. [2024-10-11 18:09:53,086 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 217 transitions. Word has length 28 [2024-10-11 18:09:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:53,086 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 217 transitions. [2024-10-11 18:09:53,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:09:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2024-10-11 18:09:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:09:53,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:53,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:53,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:53,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:53,288 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting create_internalErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-11 18:09:53,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash 334798742, now seen corresponding path program 1 times [2024-10-11 18:09:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:09:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335452952] [2024-10-11 18:09:53,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:53,289 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-10-11 18:09:53,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:09:53,291 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:09:53,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-11 18:09:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:53,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 18:09:53,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:53,770 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-10-11 18:09:53,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:09:53,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:09:54,111 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 18:09:54,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-11 18:09:54,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:09:54,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:09:54,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:09:54,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-11 18:09:54,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:09:54,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:09:54,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-10-11 18:09:54,762 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-10-11 18:09:54,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-10-11 18:09:54,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-10-11 18:09:54,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-10-11 18:09:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:55,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:55,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_create_internal_~ptr~0#1.base| v_ArrVal_824) |c_create_internal_~head#1.base|) (bvadd |c_create_internal_~head#1.offset| (_ bv8 64))))))) is different from false [2024-10-11 18:09:59,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_create_internal_~ptr~0#1.base_21| (_ BitVec 64)) (v_ArrVal_824 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_823 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_internal_~ptr~0#1.base_21|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_create_internal_~ptr~0#1.base_21| v_ArrVal_823) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_create_internal___list_add_~prev#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_create_internal___list_add_~prev#1.base|) |c_create_internal___list_add_~prev#1.offset| |c_create_internal___list_add_~new#1.base|)) |v_create_internal_~ptr~0#1.base_21| v_ArrVal_824) |c_create_internal_~head#1.base|) (bvadd |c_create_internal_~head#1.offset| (_ bv8 64)))))))) is different from false [2024-10-11 18:09:59,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array (_ BitVec 64) (_ BitVec 64))) (|v_create_internal_~ptr~0#1.base_21| (_ BitVec 64)) (v_ArrVal_824 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_823 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_internal_~ptr~0#1.base_21|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_create_internal_~ptr~0#1.base_21| v_ArrVal_823) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_create_internal___list_add_~new#1.base| v_ArrVal_821))) (store .cse0 |c_create_internal___list_add_~prev#1.base| (store (select .cse0 |c_create_internal___list_add_~prev#1.base|) |c_create_internal___list_add_~prev#1.offset| |c_create_internal___list_add_~new#1.base|))) |v_create_internal_~ptr~0#1.base_21| v_ArrVal_824) |c_create_internal_~head#1.base|) (bvadd |c_create_internal_~head#1.offset| (_ bv8 64)))))))) is different from false [2024-10-11 18:10:00,276 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array (_ BitVec 64) (_ BitVec 64))) (|v_create_internal_~ptr~0#1.base_21| (_ BitVec 64)) (v_ArrVal_824 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_823 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_internal_~ptr~0#1.base_21|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_create_internal_~ptr~0#1.base_21| v_ArrVal_823) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$#0.base| |c_create_internal___list_add_~next#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_create_internal___list_add_~next#1.base|) (bvadd (_ bv8 64) |c_create_internal___list_add_~next#1.offset|) |c_create_internal___list_add_~new#1.base|)) |c_create_internal___list_add_~new#1.base| v_ArrVal_821))) (store .cse0 |c_create_internal___list_add_~prev#1.base| (store (select .cse0 |c_create_internal___list_add_~prev#1.base|) |c_create_internal___list_add_~prev#1.offset| |c_create_internal___list_add_~new#1.base|))) |v_create_internal_~ptr~0#1.base_21| v_ArrVal_824) |c_create_internal_~head#1.base|) (bvadd |c_create_internal_~head#1.offset| (_ bv8 64)))))))) is different from false [2024-10-11 18:10:15,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:10:15,751 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-10-11 18:10:15,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 3004 treesize of output 2383 [2024-10-11 18:10:15,982 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-10-11 18:10:15,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 659 treesize of output 647 [2024-10-11 18:10:16,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:10:16,046 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 223 [2024-10-11 18:10:16,074 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 326 treesize of output 302 [2024-10-11 18:10:16,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 214 treesize of output 178 [2024-10-11 18:10:16,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 54 [2024-10-11 18:10:16,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 160 treesize of output 148 [2024-10-11 18:10:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-11 18:10:18,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:10:18,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335452952] [2024-10-11 18:10:18,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335452952] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:18,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:10:18,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2024-10-11 18:10:18,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037802937] [2024-10-11 18:10:18,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:18,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 18:10:18,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:10:18,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 18:10:18,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=661, Unknown=67, NotChecked=228, Total=1056 [2024-10-11 18:10:18,887 INFO L87 Difference]: Start difference. First operand 172 states and 217 transitions. Second operand has 33 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)