./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 02:05:55,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 02:05:55,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 02:05:55,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 02:05:55,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 02:05:55,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 02:05:55,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 02:05:55,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 02:05:55,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 02:05:55,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 02:05:55,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 02:05:55,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 02:05:55,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 02:05:55,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 02:05:55,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 02:05:55,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 02:05:55,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 02:05:55,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 02:05:55,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 02:05:55,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 02:05:55,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 02:05:55,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 02:05:55,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 02:05:55,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 02:05:55,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 02:05:55,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 02:05:55,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 02:05:55,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 02:05:55,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 02:05:55,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 02:05:55,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 02:05:55,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 02:05:55,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 02:05:55,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 02:05:55,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 02:05:55,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 02:05:55,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 02:05:55,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 02:05:55,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 02:05:55,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 02:05:55,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 02:05:55,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 02:05:55,878 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 02:05:55,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 02:05:55,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 02:05:55,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 02:05:55,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 02:05:55,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 02:05:55,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 02:05:55,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 02:05:55,880 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 02:05:55,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 02:05:55,881 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 02:05:55,881 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 02:05:55,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 02:05:55,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 02:05:55,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 02:05:55,881 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 02:05:55,881 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 02:05:55,882 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 02:05:55,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 02:05:55,882 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 02:05:55,882 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 02:05:55,882 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 02:05:55,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 02:05:55,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 02:05:55,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 02:05:55,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:05:55,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 02:05:55,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 02:05:55,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 02:05:55,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 02:05:55,883 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 02:05:55,884 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 02:05:55,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 02:05:55,884 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 02:05:55,884 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2023-02-14 02:05:56,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 02:05:56,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 02:05:56,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 02:05:56,062 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 02:05:56,062 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 02:05:56,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-queue-1.i [2023-02-14 02:05:57,227 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 02:05:57,476 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 02:05:57,477 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i [2023-02-14 02:05:57,489 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e81f10f/bdd27ee2d70e421b97ed9b1576e6c870/FLAGb7f17ecb5 [2023-02-14 02:05:57,503 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e81f10f/bdd27ee2d70e421b97ed9b1576e6c870 [2023-02-14 02:05:57,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 02:05:57,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 02:05:57,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 02:05:57,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 02:05:57,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 02:05:57,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc4db6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57, skipping insertion in model container [2023-02-14 02:05:57,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 02:05:57,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 02:05:57,775 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2023-02-14 02:05:57,779 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2023-02-14 02:05:57,779 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2023-02-14 02:05:57,780 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2023-02-14 02:05:57,781 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2023-02-14 02:05:57,781 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2023-02-14 02:05:57,788 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2023-02-14 02:05:57,789 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2023-02-14 02:05:57,789 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2023-02-14 02:05:57,790 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2023-02-14 02:05:57,791 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2023-02-14 02:05:57,793 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2023-02-14 02:05:57,795 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2023-02-14 02:05:57,798 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2023-02-14 02:05:57,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:05:57,811 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 02:05:57,837 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2023-02-14 02:05:57,855 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2023-02-14 02:05:57,857 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2023-02-14 02:05:57,858 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2023-02-14 02:05:57,858 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2023-02-14 02:05:57,859 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2023-02-14 02:05:57,860 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2023-02-14 02:05:57,860 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2023-02-14 02:05:57,861 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2023-02-14 02:05:57,861 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2023-02-14 02:05:57,862 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2023-02-14 02:05:57,862 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2023-02-14 02:05:57,863 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2023-02-14 02:05:57,864 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2023-02-14 02:05:57,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:05:57,883 INFO L208 MainTranslator]: Completed translation [2023-02-14 02:05:57,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57 WrapperNode [2023-02-14 02:05:57,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 02:05:57,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 02:05:57,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 02:05:57,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 02:05:57,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,919 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 226 [2023-02-14 02:05:57,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 02:05:57,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 02:05:57,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 02:05:57,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 02:05:57,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,957 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 02:05:57,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 02:05:57,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 02:05:57,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 02:05:57,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (1/1) ... [2023-02-14 02:05:57,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:05:57,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:05:57,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 02:05:58,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 02:05:58,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 02:05:58,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 02:05:58,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 02:05:58,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 02:05:58,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 02:05:58,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 02:05:58,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 02:05:58,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 02:05:58,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 02:05:58,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 02:05:58,159 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 02:05:58,166 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 02:05:58,441 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 02:05:58,447 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 02:05:58,457 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2023-02-14 02:05:58,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:05:58 BoogieIcfgContainer [2023-02-14 02:05:58,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 02:05:58,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 02:05:58,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 02:05:58,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 02:05:58,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:05:57" (1/3) ... [2023-02-14 02:05:58,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c985075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:05:58, skipping insertion in model container [2023-02-14 02:05:58,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:05:57" (2/3) ... [2023-02-14 02:05:58,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c985075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:05:58, skipping insertion in model container [2023-02-14 02:05:58,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:05:58" (3/3) ... [2023-02-14 02:05:58,466 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2023-02-14 02:05:58,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 02:05:58,477 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2023-02-14 02:05:58,505 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 02:05:58,510 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@384212cf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 02:05:58,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2023-02-14 02:05:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 104 states have (on average 2.269230769230769) internal successors, (236), 180 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-14 02:05:58,516 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:05:58,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-14 02:05:58,517 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:05:58,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:05:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-14 02:05:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:05:58,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475518547] [2023-02-14 02:05:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:05:58,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:05:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:05:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:05:58,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:05:58,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475518547] [2023-02-14 02:05:58,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475518547] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:05:58,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:05:58,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:05:58,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854578173] [2023-02-14 02:05:58,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:05:58,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:05:58,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:05:58,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:05:58,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:05:58,694 INFO L87 Difference]: Start difference. First operand has 181 states, 104 states have (on average 2.269230769230769) internal successors, (236), 180 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:05:58,851 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2023-02-14 02:05:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:05:58,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-14 02:05:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:05:58,859 INFO L225 Difference]: With dead ends: 178 [2023-02-14 02:05:58,859 INFO L226 Difference]: Without dead ends: 174 [2023-02-14 02:05:58,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:05:58,862 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 169 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:05:58,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 112 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:05:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-14 02:05:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2023-02-14 02:05:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 105 states have (on average 1.7333333333333334) internal successors, (182), 169 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2023-02-14 02:05:58,918 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 3 [2023-02-14 02:05:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:05:58,919 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2023-02-14 02:05:58,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2023-02-14 02:05:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-14 02:05:58,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:05:58,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-14 02:05:58,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 02:05:58,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:05:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:05:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-14 02:05:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:05:58,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917127265] [2023-02-14 02:05:58,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:05:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:05:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:05:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:05:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:05:59,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917127265] [2023-02-14 02:05:59,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917127265] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:05:59,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:05:59,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:05:59,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838543136] [2023-02-14 02:05:59,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:05:59,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:05:59,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:05:59,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:05:59,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:05:59,009 INFO L87 Difference]: Start difference. First operand 170 states and 182 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:05:59,093 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2023-02-14 02:05:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:05:59,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-14 02:05:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:05:59,095 INFO L225 Difference]: With dead ends: 163 [2023-02-14 02:05:59,095 INFO L226 Difference]: Without dead ends: 163 [2023-02-14 02:05:59,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:05:59,096 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 155 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:05:59,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 115 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:05:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-14 02:05:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2023-02-14 02:05:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 105 states have (on average 1.619047619047619) internal successors, (170), 158 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2023-02-14 02:05:59,104 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 3 [2023-02-14 02:05:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:05:59,104 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2023-02-14 02:05:59,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2023-02-14 02:05:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 02:05:59,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:05:59,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:05:59,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 02:05:59,105 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:05:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:05:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2023-02-14 02:05:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:05:59,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937690185] [2023-02-14 02:05:59,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:05:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:05:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:05:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:05:59,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:05:59,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937690185] [2023-02-14 02:05:59,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937690185] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:05:59,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:05:59,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:05:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652518380] [2023-02-14 02:05:59,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:05:59,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:05:59,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:05:59,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:05:59,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:05:59,247 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:05:59,357 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2023-02-14 02:05:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:05:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-14 02:05:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:05:59,360 INFO L225 Difference]: With dead ends: 168 [2023-02-14 02:05:59,360 INFO L226 Difference]: Without dead ends: 168 [2023-02-14 02:05:59,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:05:59,363 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 272 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:05:59,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 118 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:05:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-14 02:05:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2023-02-14 02:05:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.5625) internal successors, (175), 159 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2023-02-14 02:05:59,382 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 9 [2023-02-14 02:05:59,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:05:59,383 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2023-02-14 02:05:59,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2023-02-14 02:05:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 02:05:59,384 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:05:59,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:05:59,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 02:05:59,385 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:05:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:05:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2023-02-14 02:05:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:05:59,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920301115] [2023-02-14 02:05:59,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:05:59,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:05:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:05:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:05:59,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:05:59,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920301115] [2023-02-14 02:05:59,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920301115] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:05:59,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:05:59,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:05:59,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196282147] [2023-02-14 02:05:59,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:05:59,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:05:59,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:05:59,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:05:59,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:05:59,568 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:05:59,842 INFO L93 Difference]: Finished difference Result 256 states and 272 transitions. [2023-02-14 02:05:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:05:59,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-14 02:05:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:05:59,843 INFO L225 Difference]: With dead ends: 256 [2023-02-14 02:05:59,843 INFO L226 Difference]: Without dead ends: 256 [2023-02-14 02:05:59,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:05:59,844 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 334 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 02:05:59,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 244 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 02:05:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-02-14 02:05:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 168. [2023-02-14 02:05:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 120 states have (on average 1.5416666666666667) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2023-02-14 02:05:59,849 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 9 [2023-02-14 02:05:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:05:59,850 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2023-02-14 02:05:59,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2023-02-14 02:05:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 02:05:59,850 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:05:59,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:05:59,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 02:05:59,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:05:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:05:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1115899309, now seen corresponding path program 1 times [2023-02-14 02:05:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:05:59,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288546606] [2023-02-14 02:05:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:05:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:05:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:05:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:05:59,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:05:59,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288546606] [2023-02-14 02:05:59,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288546606] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:05:59,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:05:59,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:05:59,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799218626] [2023-02-14 02:05:59,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:05:59,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:05:59,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:05:59,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:05:59,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:05:59,873 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:05:59,895 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2023-02-14 02:05:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:05:59,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 02:05:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:05:59,896 INFO L225 Difference]: With dead ends: 158 [2023-02-14 02:05:59,896 INFO L226 Difference]: Without dead ends: 158 [2023-02-14 02:05:59,896 INFO L412 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 [2023-02-14 02:05:59,897 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:05:59,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 141 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:05:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-14 02:05:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2023-02-14 02:05:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 157 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2023-02-14 02:05:59,900 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 10 [2023-02-14 02:05:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:05:59,901 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2023-02-14 02:05:59,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:05:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2023-02-14 02:05:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 02:05:59,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:05:59,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:05:59,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 02:05:59,902 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:05:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:05:59,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2023-02-14 02:05:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:05:59,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418743096] [2023-02-14 02:05:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:05:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:05:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:00,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:00,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418743096] [2023-02-14 02:06:00,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418743096] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:00,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:00,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:06:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440107778] [2023-02-14 02:06:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:00,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:06:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:00,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:06:00,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:06:00,037 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:00,148 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2023-02-14 02:06:00,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:06:00,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-14 02:06:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:00,149 INFO L225 Difference]: With dead ends: 157 [2023-02-14 02:06:00,149 INFO L226 Difference]: Without dead ends: 157 [2023-02-14 02:06:00,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:06:00,150 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 7 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:00,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 424 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:06:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-14 02:06:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-02-14 02:06:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 156 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2023-02-14 02:06:00,153 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 12 [2023-02-14 02:06:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:00,154 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2023-02-14 02:06:00,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2023-02-14 02:06:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 02:06:00,154 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:00,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:00,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 02:06:00,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2023-02-14 02:06:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:00,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127674068] [2023-02-14 02:06:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:00,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:00,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127674068] [2023-02-14 02:06:00,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127674068] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:00,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:00,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:06:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132390638] [2023-02-14 02:06:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:00,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:06:00,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:00,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:06:00,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:06:00,236 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:00,333 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2023-02-14 02:06:00,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:06:00,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-14 02:06:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:00,334 INFO L225 Difference]: With dead ends: 156 [2023-02-14 02:06:00,334 INFO L226 Difference]: Without dead ends: 156 [2023-02-14 02:06:00,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:06:00,335 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 8 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:00,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 422 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:06:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-14 02:06:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-02-14 02:06:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 155 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2023-02-14 02:06:00,338 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 12 [2023-02-14 02:06:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:00,339 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2023-02-14 02:06:00,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2023-02-14 02:06:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 02:06:00,339 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:00,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:00,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 02:06:00,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:00,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash -794856606, now seen corresponding path program 1 times [2023-02-14 02:06:00,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:00,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864434328] [2023-02-14 02:06:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:00,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:00,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:00,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864434328] [2023-02-14 02:06:00,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864434328] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:00,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:00,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:06:00,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926038268] [2023-02-14 02:06:00,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:00,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:06:00,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:00,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:06:00,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:06:00,363 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:00,379 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2023-02-14 02:06:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:06:00,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 02:06:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:00,381 INFO L225 Difference]: With dead ends: 208 [2023-02-14 02:06:00,386 INFO L226 Difference]: Without dead ends: 208 [2023-02-14 02:06:00,386 INFO L412 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 [2023-02-14 02:06:00,387 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 53 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:00,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 273 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:06:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-14 02:06:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 164. [2023-02-14 02:06:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 163 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2023-02-14 02:06:00,390 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 16 [2023-02-14 02:06:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:00,390 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2023-02-14 02:06:00,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2023-02-14 02:06:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 02:06:00,391 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:00,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:00,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 02:06:00,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2023-02-14 02:06:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:00,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475440828] [2023-02-14 02:06:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:00,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:00,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:00,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475440828] [2023-02-14 02:06:00,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475440828] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:00,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:00,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 02:06:00,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475453715] [2023-02-14 02:06:00,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:00,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 02:06:00,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:00,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 02:06:00,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-14 02:06:00,578 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:00,818 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2023-02-14 02:06:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 02:06:00,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 02:06:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:00,819 INFO L225 Difference]: With dead ends: 167 [2023-02-14 02:06:00,819 INFO L226 Difference]: Without dead ends: 167 [2023-02-14 02:06:00,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-14 02:06:00,820 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 252 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:00,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 521 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:06:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-14 02:06:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2023-02-14 02:06:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 162 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2023-02-14 02:06:00,823 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 16 [2023-02-14 02:06:00,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:00,823 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2023-02-14 02:06:00,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2023-02-14 02:06:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 02:06:00,823 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:00,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:00,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 02:06:00,823 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:00,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:00,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2023-02-14 02:06:00,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:00,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265520887] [2023-02-14 02:06:00,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:00,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:01,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265520887] [2023-02-14 02:06:01,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265520887] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:01,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:01,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-14 02:06:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4027965] [2023-02-14 02:06:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:01,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 02:06:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:01,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 02:06:01,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-14 02:06:01,027 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:01,378 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2023-02-14 02:06:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 02:06:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 02:06:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:01,379 INFO L225 Difference]: With dead ends: 162 [2023-02-14 02:06:01,379 INFO L226 Difference]: Without dead ends: 162 [2023-02-14 02:06:01,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-02-14 02:06:01,380 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 333 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:01,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 398 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:06:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-14 02:06:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2023-02-14 02:06:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 155 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2023-02-14 02:06:01,383 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 16 [2023-02-14 02:06:01,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:01,383 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2023-02-14 02:06:01,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2023-02-14 02:06:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 02:06:01,383 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:01,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:01,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 02:06:01,384 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:01,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1461793571, now seen corresponding path program 1 times [2023-02-14 02:06:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:01,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565463223] [2023-02-14 02:06:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:01,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:01,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565463223] [2023-02-14 02:06:01,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565463223] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:01,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:01,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:06:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285547598] [2023-02-14 02:06:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:01,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:06:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:01,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:06:01,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:06:01,405 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:01,411 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2023-02-14 02:06:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:06:01,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 02:06:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:01,412 INFO L225 Difference]: With dead ends: 157 [2023-02-14 02:06:01,412 INFO L226 Difference]: Without dead ends: 157 [2023-02-14 02:06:01,412 INFO L412 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 [2023-02-14 02:06:01,413 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:01,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:06:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-14 02:06:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-02-14 02:06:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 156 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2023-02-14 02:06:01,416 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 21 [2023-02-14 02:06:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:01,416 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2023-02-14 02:06:01,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2023-02-14 02:06:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 02:06:01,417 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:01,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:01,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 02:06:01,418 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:01,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:01,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1463640613, now seen corresponding path program 1 times [2023-02-14 02:06:01,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:01,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189376968] [2023-02-14 02:06:01,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:01,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:01,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:01,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189376968] [2023-02-14 02:06:01,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189376968] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:01,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:01,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:06:01,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115691213] [2023-02-14 02:06:01,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:01,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:06:01,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:01,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:06:01,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:06:01,564 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:01,657 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2023-02-14 02:06:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 02:06:01,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 02:06:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:01,659 INFO L225 Difference]: With dead ends: 165 [2023-02-14 02:06:01,659 INFO L226 Difference]: Without dead ends: 165 [2023-02-14 02:06:01,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-14 02:06:01,659 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 13 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:01,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 589 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:06:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-14 02:06:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2023-02-14 02:06:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.3671875) internal successors, (175), 160 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2023-02-14 02:06:01,662 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 21 [2023-02-14 02:06:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:01,663 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2023-02-14 02:06:01,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2023-02-14 02:06:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-14 02:06:01,663 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:01,664 INFO L195 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] [2023-02-14 02:06:01,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 02:06:01,664 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:01,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash -348511767, now seen corresponding path program 1 times [2023-02-14 02:06:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:01,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596410326] [2023-02-14 02:06:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:01,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:01,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596410326] [2023-02-14 02:06:01,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596410326] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:01,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:01,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:06:01,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150323743] [2023-02-14 02:06:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:01,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:06:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:01,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:06:01,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:06:01,713 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:01,772 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2023-02-14 02:06:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:06:01,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-14 02:06:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:01,773 INFO L225 Difference]: With dead ends: 161 [2023-02-14 02:06:01,773 INFO L226 Difference]: Without dead ends: 161 [2023-02-14 02:06:01,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:06:01,774 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 155 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:01,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 212 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:06:01,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-14 02:06:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-02-14 02:06:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.359375) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2023-02-14 02:06:01,777 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 23 [2023-02-14 02:06:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:01,777 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2023-02-14 02:06:01,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2023-02-14 02:06:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-14 02:06:01,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:01,778 INFO L195 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] [2023-02-14 02:06:01,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 02:06:01,778 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1959765219, now seen corresponding path program 1 times [2023-02-14 02:06:01,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:01,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144961763] [2023-02-14 02:06:01,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:01,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:01,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:01,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144961763] [2023-02-14 02:06:01,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144961763] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:01,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:01,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:06:01,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727509995] [2023-02-14 02:06:01,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:01,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:06:01,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:06:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:06:01,842 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:01,925 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2023-02-14 02:06:01,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:06:01,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-14 02:06:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:01,927 INFO L225 Difference]: With dead ends: 162 [2023-02-14 02:06:01,927 INFO L226 Difference]: Without dead ends: 162 [2023-02-14 02:06:01,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-14 02:06:01,927 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 257 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:01,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 235 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:06:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-14 02:06:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2023-02-14 02:06:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 158 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2023-02-14 02:06:01,930 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 23 [2023-02-14 02:06:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:01,931 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2023-02-14 02:06:01,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2023-02-14 02:06:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 02:06:01,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:01,932 INFO L195 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] [2023-02-14 02:06:01,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 02:06:01,932 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:01,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1577640795, now seen corresponding path program 1 times [2023-02-14 02:06:01,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:01,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046414316] [2023-02-14 02:06:01,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:01,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:02,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046414316] [2023-02-14 02:06:02,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046414316] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:06:02,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444570460] [2023-02-14 02:06:02,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:02,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:06:02,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:06:02,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:06:02,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 02:06:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:02,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-14 02:06:02,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:06:02,482 INFO L350 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 [2023-02-14 02:06:02,485 INFO L350 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 [2023-02-14 02:06:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:02,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:06:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:02,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444570460] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:06:02,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:06:02,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2023-02-14 02:06:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949594546] [2023-02-14 02:06:02,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:06:02,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 02:06:02,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:02,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 02:06:02,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-14 02:06:02,583 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:02,838 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2023-02-14 02:06:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 02:06:02,839 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-14 02:06:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:02,840 INFO L225 Difference]: With dead ends: 188 [2023-02-14 02:06:02,840 INFO L226 Difference]: Without dead ends: 188 [2023-02-14 02:06:02,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-02-14 02:06:02,840 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 109 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:02,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 753 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:06:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-14 02:06:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2023-02-14 02:06:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 168 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2023-02-14 02:06:02,843 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 26 [2023-02-14 02:06:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:02,843 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2023-02-14 02:06:02,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2023-02-14 02:06:02,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 02:06:02,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:02,844 INFO L195 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] [2023-02-14 02:06:02,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 02:06:03,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 02:06:03,053 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1662225504, now seen corresponding path program 1 times [2023-02-14 02:06:03,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:03,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282181447] [2023-02-14 02:06:03,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:03,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:03,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:03,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282181447] [2023-02-14 02:06:03,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282181447] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:06:03,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924891982] [2023-02-14 02:06:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:03,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:06:03,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:06:03,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:06:03,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 02:06:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:03,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 02:06:03,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:06:03,265 INFO L350 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 13 treesize of output 9 [2023-02-14 02:06:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:03,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:06:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:03,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924891982] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:06:03,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:06:03,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-14 02:06:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741065613] [2023-02-14 02:06:03,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:06:03,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:06:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:06:03,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:06:03,318 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:03,423 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2023-02-14 02:06:03,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:06:03,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 02:06:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:03,424 INFO L225 Difference]: With dead ends: 179 [2023-02-14 02:06:03,424 INFO L226 Difference]: Without dead ends: 160 [2023-02-14 02:06:03,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-14 02:06:03,425 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:03,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 384 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:06:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-14 02:06:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-02-14 02:06:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 128 states have (on average 1.3515625) internal successors, (173), 159 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2023-02-14 02:06:03,428 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 27 [2023-02-14 02:06:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:03,428 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2023-02-14 02:06:03,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2023-02-14 02:06:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 02:06:03,430 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:03,430 INFO L195 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:03,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 02:06:03,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-14 02:06:03,637 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash -112828615, now seen corresponding path program 1 times [2023-02-14 02:06:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:03,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634775721] [2023-02-14 02:06:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:03,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634775721] [2023-02-14 02:06:03,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634775721] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:06:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452816660] [2023-02-14 02:06:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:03,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:06:03,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:06:03,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:06:03,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 02:06:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:04,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 02:06:04,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:06:04,008 INFO L350 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 [2023-02-14 02:06:04,063 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:06:04,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-02-14 02:06:04,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-02-14 02:06:04,179 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:06:04,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-02-14 02:06:04,248 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:06:04,249 INFO L350 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 1 case distinctions, treesize of input 30 treesize of output 28 [2023-02-14 02:06:04,272 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:06:04,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-02-14 02:06:04,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-14 02:06:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:04,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:06:04,390 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-14 02:06:04,394 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-14 02:06:04,402 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_500))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-14 02:06:04,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:04,446 INFO L350 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 37 treesize of output 30 [2023-02-14 02:06:04,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:04,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 245 treesize of output 220 [2023-02-14 02:06:04,469 INFO L350 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 204 treesize of output 196 [2023-02-14 02:06:04,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:04,477 INFO L350 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 196 treesize of output 189 [2023-02-14 02:06:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:04,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452816660] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:06:04,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:06:04,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 28 [2023-02-14 02:06:04,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464834781] [2023-02-14 02:06:04,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:06:04,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-14 02:06:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 02:06:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=517, Unknown=14, NotChecked=144, Total=756 [2023-02-14 02:06:04,648 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:05,395 INFO L93 Difference]: Finished difference Result 273 states and 296 transitions. [2023-02-14 02:06:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 02:06:05,396 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-14 02:06:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:05,397 INFO L225 Difference]: With dead ends: 273 [2023-02-14 02:06:05,397 INFO L226 Difference]: Without dead ends: 273 [2023-02-14 02:06:05,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=965, Unknown=17, NotChecked=204, Total=1406 [2023-02-14 02:06:05,398 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 812 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 764 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:05,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1285 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1053 Invalid, 0 Unknown, 764 Unchecked, 0.5s Time] [2023-02-14 02:06:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-14 02:06:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 175. [2023-02-14 02:06:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 174 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2023-02-14 02:06:05,401 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 33 [2023-02-14 02:06:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:05,401 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2023-02-14 02:06:05,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2023-02-14 02:06:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-14 02:06:05,401 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:05,401 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:05,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 02:06:05,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:06:05,608 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1345804944, now seen corresponding path program 1 times [2023-02-14 02:06:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:05,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372641188] [2023-02-14 02:06:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:05,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:05,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:05,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372641188] [2023-02-14 02:06:05,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372641188] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:05,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:05,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:06:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432403943] [2023-02-14 02:06:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:05,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:06:05,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:05,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:06:05,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:06:05,636 INFO L87 Difference]: Start difference. First operand 175 states and 190 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:05,653 INFO L93 Difference]: Finished difference Result 249 states and 270 transitions. [2023-02-14 02:06:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:06:05,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-14 02:06:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:05,654 INFO L225 Difference]: With dead ends: 249 [2023-02-14 02:06:05,654 INFO L226 Difference]: Without dead ends: 249 [2023-02-14 02:06:05,654 INFO L412 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 [2023-02-14 02:06:05,654 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 58 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:05,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 256 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:06:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-14 02:06:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 196. [2023-02-14 02:06:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 195 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2023-02-14 02:06:05,657 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 34 [2023-02-14 02:06:05,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:05,658 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2023-02-14 02:06:05,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2023-02-14 02:06:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:06:05,658 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:05,658 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:05,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-14 02:06:05,659 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:05,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1598443618, now seen corresponding path program 1 times [2023-02-14 02:06:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:05,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517325152] [2023-02-14 02:06:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:05,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:05,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517325152] [2023-02-14 02:06:05,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517325152] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:06:05,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652211210] [2023-02-14 02:06:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:06:05,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:06:05,982 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:06:05,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 02:06:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:06,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-14 02:06:06,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:06:06,209 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:06:06,209 INFO L350 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 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-14 02:06:06,222 INFO L350 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 [2023-02-14 02:06:06,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:06:06,294 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 02:06:06,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2023-02-14 02:06:06,302 INFO L350 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 21 treesize of output 20 [2023-02-14 02:06:06,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:06,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 59 treesize of output 59 [2023-02-14 02:06:06,898 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-02-14 02:06:06,899 INFO L350 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 69 treesize of output 60 [2023-02-14 02:06:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:06,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:06:07,169 INFO L350 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 230 treesize of output 222 [2023-02-14 02:06:07,341 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:06:07,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:07,347 INFO L350 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 54 treesize of output 49 [2023-02-14 02:06:07,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:07,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 53 treesize of output 207 [2023-02-14 02:06:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:08,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652211210] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:06:08,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:06:08,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2023-02-14 02:06:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115798745] [2023-02-14 02:06:08,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:06:08,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-14 02:06:08,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:08,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-14 02:06:08,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=907, Unknown=4, NotChecked=0, Total=1056 [2023-02-14 02:06:08,925 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:22,692 INFO L93 Difference]: Finished difference Result 405 states and 446 transitions. [2023-02-14 02:06:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-14 02:06:22,693 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-14 02:06:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:22,694 INFO L225 Difference]: With dead ends: 405 [2023-02-14 02:06:22,694 INFO L226 Difference]: Without dead ends: 405 [2023-02-14 02:06:22,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1158, Invalid=3948, Unknown=6, NotChecked=0, Total=5112 [2023-02-14 02:06:22,696 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 1667 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:22,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 1558 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-02-14 02:06:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-02-14 02:06:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 232. [2023-02-14 02:06:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 200 states have (on average 1.27) internal successors, (254), 231 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 254 transitions. [2023-02-14 02:06:22,699 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 254 transitions. Word has length 43 [2023-02-14 02:06:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:22,699 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 254 transitions. [2023-02-14 02:06:22,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 254 transitions. [2023-02-14 02:06:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:06:22,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:22,700 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:22,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 02:06:22,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:06:22,905 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:22,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1598443619, now seen corresponding path program 1 times [2023-02-14 02:06:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:22,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362165753] [2023-02-14 02:06:22,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:23,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:23,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362165753] [2023-02-14 02:06:23,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362165753] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:06:23,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772974796] [2023-02-14 02:06:23,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:23,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:06:23,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:06:23,351 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:06:23,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 02:06:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:23,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-14 02:06:23,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:06:23,450 INFO L350 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 [2023-02-14 02:06:23,505 INFO L350 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 [2023-02-14 02:06:23,514 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:06:23,514 INFO L350 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 11 treesize of output 11 [2023-02-14 02:06:23,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:06:23,556 INFO L350 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 [2023-02-14 02:06:23,633 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:06:23,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-14 02:06:23,637 INFO L350 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 18 treesize of output 20 [2023-02-14 02:06:23,748 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:06:23,749 INFO L350 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:06:23,757 INFO L350 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 5 treesize of output 3 [2023-02-14 02:06:23,775 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:06:23,775 INFO L350 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 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-14 02:06:23,834 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:06:23,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-14 02:06:23,840 INFO L350 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 18 treesize of output 20 [2023-02-14 02:06:23,973 INFO L350 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 [2023-02-14 02:06:23,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 02:06:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:24,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:06:24,163 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-14 02:06:24,181 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-14 02:06:24,188 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))))) is different from false [2023-02-14 02:06:24,202 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_747) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_748))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_747) .cse0 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2023-02-14 02:06:24,213 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_748) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_748))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) .cse1 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2023-02-14 02:06:24,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:24,231 INFO L350 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 38 treesize of output 39 [2023-02-14 02:06:24,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:24,234 INFO L350 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 30 treesize of output 31 [2023-02-14 02:06:24,237 INFO L350 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 54 treesize of output 46 [2023-02-14 02:06:24,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:24,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 112 treesize of output 111 [2023-02-14 02:06:24,247 INFO L350 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 68 treesize of output 60 [2023-02-14 02:06:24,250 INFO L350 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 88 treesize of output 82 [2023-02-14 02:06:24,253 INFO L350 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 56 treesize of output 54 [2023-02-14 02:06:24,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:24,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2023-02-14 02:06:24,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:24,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2023-02-14 02:06:24,299 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:06:24,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:06:24,302 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-02-14 02:06:24,304 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:06:24,305 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-02-14 02:06:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:24,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772974796] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:06:24,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:06:24,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 35 [2023-02-14 02:06:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490674216] [2023-02-14 02:06:24,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:06:24,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-14 02:06:24,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-14 02:06:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=831, Unknown=5, NotChecked=310, Total=1260 [2023-02-14 02:06:24,410 INFO L87 Difference]: Start difference. First operand 232 states and 254 transitions. Second operand has 36 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 36 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:29,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 02:06:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:40,053 INFO L93 Difference]: Finished difference Result 369 states and 403 transitions. [2023-02-14 02:06:40,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-14 02:06:40,053 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 36 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-14 02:06:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:40,055 INFO L225 Difference]: With dead ends: 369 [2023-02-14 02:06:40,060 INFO L226 Difference]: Without dead ends: 369 [2023-02-14 02:06:40,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=533, Invalid=2673, Unknown=6, NotChecked=570, Total=3782 [2023-02-14 02:06:40,062 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1252 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 74 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1489 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:40,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 1134 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1325 Invalid, 1 Unknown, 1489 Unchecked, 5.5s Time] [2023-02-14 02:06:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-02-14 02:06:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 247. [2023-02-14 02:06:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 246 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 273 transitions. [2023-02-14 02:06:40,082 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 273 transitions. Word has length 43 [2023-02-14 02:06:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:40,082 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 273 transitions. [2023-02-14 02:06:40,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 36 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 273 transitions. [2023-02-14 02:06:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 02:06:40,083 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:40,083 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:40,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 02:06:40,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:06:40,288 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:40,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1987856737, now seen corresponding path program 1 times [2023-02-14 02:06:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:40,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970942501] [2023-02-14 02:06:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:40,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:06:40,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:40,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970942501] [2023-02-14 02:06:40,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970942501] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:06:40,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:06:40,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:06:40,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117152798] [2023-02-14 02:06:40,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:06:40,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:06:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:06:40,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:06:40,347 INFO L87 Difference]: Start difference. First operand 247 states and 273 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:06:40,367 INFO L93 Difference]: Finished difference Result 249 states and 274 transitions. [2023-02-14 02:06:40,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:06:40,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-14 02:06:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:06:40,381 INFO L225 Difference]: With dead ends: 249 [2023-02-14 02:06:40,381 INFO L226 Difference]: Without dead ends: 249 [2023-02-14 02:06:40,382 INFO L412 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 [2023-02-14 02:06:40,382 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:06:40,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:06:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-14 02:06:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2023-02-14 02:06:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 217 states have (on average 1.262672811059908) internal successors, (274), 248 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2023-02-14 02:06:40,385 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 44 [2023-02-14 02:06:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:06:40,385 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2023-02-14 02:06:40,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:06:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2023-02-14 02:06:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 02:06:40,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:06:40,385 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:06:40,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-14 02:06:40,385 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:06:40,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:06:40,386 INFO L85 PathProgramCache]: Analyzing trace with hash 931768708, now seen corresponding path program 1 times [2023-02-14 02:06:40,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:06:40,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134782238] [2023-02-14 02:06:40,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:06:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:42,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:06:42,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134782238] [2023-02-14 02:06:42,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134782238] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:06:42,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461300861] [2023-02-14 02:06:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:06:42,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:06:42,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:06:42,901 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:06:42,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 02:06:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:06:42,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 02:06:43,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:06:43,702 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:06:43,703 INFO L350 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 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-14 02:06:43,791 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 02:06:43,791 INFO L350 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 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 02:06:44,135 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-02-14 02:06:44,135 INFO L350 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 3 case distinctions, treesize of input 100 treesize of output 84 [2023-02-14 02:06:44,153 INFO L350 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 17 treesize of output 13 [2023-02-14 02:06:44,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:06:44,180 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-14 02:06:44,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2023-02-14 02:06:45,712 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2023-02-14 02:06:45,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2023-02-14 02:06:45,721 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 02:06:45,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 40 [2023-02-14 02:06:46,179 INFO L350 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 19 treesize of output 7 [2023-02-14 02:06:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:46,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:06:47,482 INFO L350 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 114 treesize of output 80 [2023-02-14 02:06:48,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:48,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 679 treesize of output 515 [2023-02-14 02:06:48,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:06:48,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1097 treesize of output 768 [2023-02-14 02:06:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:06:49,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461300861] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:06:49,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:06:49,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 14] total 42 [2023-02-14 02:06:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340555117] [2023-02-14 02:06:49,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:06:49,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-14 02:06:49,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:06:49,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-14 02:06:49,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2023-02-14 02:06:49,815 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand has 42 states, 42 states have (on average 3.119047619047619) internal successors, (131), 42 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:07:08,748 INFO L93 Difference]: Finished difference Result 374 states and 406 transitions. [2023-02-14 02:07:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-14 02:07:08,748 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.119047619047619) internal successors, (131), 42 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-14 02:07:08,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:07:08,757 INFO L225 Difference]: With dead ends: 374 [2023-02-14 02:07:08,757 INFO L226 Difference]: Without dead ends: 374 [2023-02-14 02:07:08,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=863, Invalid=4837, Unknown=0, NotChecked=0, Total=5700 [2023-02-14 02:07:08,760 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1459 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:07:08,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 1584 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-02-14 02:07:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-02-14 02:07:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 248. [2023-02-14 02:07:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 216 states have (on average 1.2592592592592593) internal successors, (272), 247 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2023-02-14 02:07:08,764 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 46 [2023-02-14 02:07:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:07:08,764 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2023-02-14 02:07:08,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.119047619047619) internal successors, (131), 42 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2023-02-14 02:07:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 02:07:08,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:07:08,765 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:07:08,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 02:07:08,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:07:08,971 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:07:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:07:08,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1102971968, now seen corresponding path program 1 times [2023-02-14 02:07:08,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:07:08,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639207909] [2023-02-14 02:07:08,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:07:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:07:10,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639207909] [2023-02-14 02:07:10,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639207909] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:07:10,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453024425] [2023-02-14 02:07:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:10,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:07:10,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:07:10,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:07:10,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 02:07:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:10,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-14 02:07:10,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:07:10,158 INFO L350 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 [2023-02-14 02:07:10,457 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 02:07:10,457 INFO L350 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 17 treesize of output 21 [2023-02-14 02:07:10,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:07:10,974 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:10,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 02:07:11,349 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:11,349 INFO L350 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 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-14 02:07:11,445 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:11,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 02:07:12,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 02:07:12,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 17 [2023-02-14 02:07:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:12,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:07:13,063 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1001 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_1001 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2023-02-14 02:07:13,148 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1001 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_1001 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-14 02:07:13,170 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1001 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1001 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2023-02-14 02:07:13,455 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1001 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_999))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1001)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1001 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_999))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1001)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) is different from false [2023-02-14 02:07:13,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:13,486 INFO L350 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 38 treesize of output 31 [2023-02-14 02:07:13,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:13,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 252 treesize of output 227 [2023-02-14 02:07:13,526 INFO L350 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 212 treesize of output 204 [2023-02-14 02:07:13,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:13,560 INFO L350 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 204 treesize of output 196 [2023-02-14 02:07:14,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:14,578 INFO L350 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 37 treesize of output 30 [2023-02-14 02:07:14,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:14,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 141 treesize of output 128 [2023-02-14 02:07:14,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:14,650 INFO L350 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 112 treesize of output 111 [2023-02-14 02:07:14,663 INFO L350 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 102 treesize of output 98 [2023-02-14 02:07:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:15,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453024425] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:07:15,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:07:15,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 31 [2023-02-14 02:07:15,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235243789] [2023-02-14 02:07:15,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:07:15,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 02:07:15,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:07:15,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 02:07:15,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=597, Unknown=27, NotChecked=220, Total=992 [2023-02-14 02:07:15,106 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 32 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 32 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:07:18,636 INFO L93 Difference]: Finished difference Result 290 states and 318 transitions. [2023-02-14 02:07:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 02:07:18,636 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 32 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-02-14 02:07:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:07:18,637 INFO L225 Difference]: With dead ends: 290 [2023-02-14 02:07:18,637 INFO L226 Difference]: Without dead ends: 290 [2023-02-14 02:07:18,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=217, Invalid=823, Unknown=32, NotChecked=260, Total=1332 [2023-02-14 02:07:18,638 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 325 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-14 02:07:18,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1098 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 931 Invalid, 0 Unknown, 711 Unchecked, 2.7s Time] [2023-02-14 02:07:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-02-14 02:07:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 271. [2023-02-14 02:07:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 239 states have (on average 1.2803347280334727) internal successors, (306), 270 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 306 transitions. [2023-02-14 02:07:18,642 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 306 transitions. Word has length 48 [2023-02-14 02:07:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:07:18,642 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 306 transitions. [2023-02-14 02:07:18,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 32 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 306 transitions. [2023-02-14 02:07:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 02:07:18,642 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:07:18,642 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:07:18,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 02:07:18,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:07:18,849 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:07:18,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:07:18,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1102971969, now seen corresponding path program 1 times [2023-02-14 02:07:18,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:07:18,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220448297] [2023-02-14 02:07:18,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:18,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:07:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:19,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:07:19,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220448297] [2023-02-14 02:07:19,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220448297] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:07:19,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94674958] [2023-02-14 02:07:19,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:19,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:07:19,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:07:19,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:07:19,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 02:07:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:19,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-14 02:07:19,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:07:19,935 INFO L350 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 [2023-02-14 02:07:20,176 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:07:20,176 INFO L350 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 11 treesize of output 11 [2023-02-14 02:07:20,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:07:20,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:07:20,338 INFO L350 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 [2023-02-14 02:07:20,649 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:20,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-14 02:07:20,668 INFO L350 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 18 treesize of output 20 [2023-02-14 02:07:21,043 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:07:21,043 INFO L350 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:07:21,055 INFO L350 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 5 treesize of output 3 [2023-02-14 02:07:21,097 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:21,097 INFO L350 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 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-14 02:07:21,260 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:21,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-14 02:07:21,279 INFO L350 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 18 treesize of output 20 [2023-02-14 02:07:21,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 02:07:21,959 INFO L350 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 15 treesize of output 7 [2023-02-14 02:07:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:22,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:07:23,243 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1107 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-14 02:07:23,627 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1104))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1103) .cse0 v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-14 02:07:23,653 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1104))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1103) .cse1 v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1104) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-14 02:07:23,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:23,687 INFO L350 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 73 treesize of output 74 [2023-02-14 02:07:23,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:23,702 INFO L350 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 65 treesize of output 50 [2023-02-14 02:07:23,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:23,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 632 treesize of output 567 [2023-02-14 02:07:23,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:23,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1872 treesize of output 1783 [2023-02-14 02:07:23,793 INFO L350 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 1768 treesize of output 1736 [2023-02-14 02:07:23,806 INFO L350 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 1736 treesize of output 1656 [2023-02-14 02:07:23,820 INFO L350 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 1656 treesize of output 1576 [2023-02-14 02:07:23,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:23,853 INFO L350 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 1576 treesize of output 1436 [2023-02-14 02:07:27,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:27,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-14 02:07:27,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:27,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 02:07:27,175 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:07:27,179 INFO L350 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 26 treesize of output 18 [2023-02-14 02:07:27,184 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:07:27,188 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 02:07:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:27,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94674958] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:07:27,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:07:27,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2023-02-14 02:07:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616473988] [2023-02-14 02:07:27,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:07:27,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-14 02:07:27,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:07:27,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-14 02:07:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=751, Unknown=22, NotChecked=174, Total=1056 [2023-02-14 02:07:27,712 INFO L87 Difference]: Start difference. First operand 271 states and 306 transitions. Second operand has 33 states, 32 states have (on average 4.4375) internal successors, (142), 33 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:07:32,358 INFO L93 Difference]: Finished difference Result 289 states and 317 transitions. [2023-02-14 02:07:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 02:07:32,358 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.4375) internal successors, (142), 33 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-02-14 02:07:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:07:32,359 INFO L225 Difference]: With dead ends: 289 [2023-02-14 02:07:32,359 INFO L226 Difference]: Without dead ends: 289 [2023-02-14 02:07:32,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=320, Invalid=1391, Unknown=23, NotChecked=246, Total=1980 [2023-02-14 02:07:32,360 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 487 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 510 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-14 02:07:32,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1135 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1083 Invalid, 0 Unknown, 510 Unchecked, 2.9s Time] [2023-02-14 02:07:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-14 02:07:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 271. [2023-02-14 02:07:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 239 states have (on average 1.2761506276150627) internal successors, (305), 270 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2023-02-14 02:07:32,363 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 48 [2023-02-14 02:07:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:07:32,364 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2023-02-14 02:07:32,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.4375) internal successors, (142), 33 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2023-02-14 02:07:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 02:07:32,364 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:07:32,364 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:07:32,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 02:07:32,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-14 02:07:32,570 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:07:32,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:07:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 533456103, now seen corresponding path program 1 times [2023-02-14 02:07:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:07:32,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839151118] [2023-02-14 02:07:32,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:07:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:07:32,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:07:32,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839151118] [2023-02-14 02:07:32,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839151118] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:07:32,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547379398] [2023-02-14 02:07:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:32,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:07:32,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:07:32,795 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:07:32,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 02:07:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:32,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 02:07:32,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:07:32,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-14 02:07:32,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-14 02:07:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 02:07:33,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:07:33,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547379398] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:07:33,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:07:33,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 9 [2023-02-14 02:07:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560294531] [2023-02-14 02:07:33,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:07:33,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:07:33,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:07:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:07:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-14 02:07:33,138 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:07:34,053 INFO L93 Difference]: Finished difference Result 320 states and 359 transitions. [2023-02-14 02:07:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 02:07:34,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-02-14 02:07:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:07:34,054 INFO L225 Difference]: With dead ends: 320 [2023-02-14 02:07:34,054 INFO L226 Difference]: Without dead ends: 320 [2023-02-14 02:07:34,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-02-14 02:07:34,055 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 155 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 02:07:34,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 607 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 02:07:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-02-14 02:07:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 275. [2023-02-14 02:07:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 243 states have (on average 1.2633744855967077) internal successors, (307), 274 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 307 transitions. [2023-02-14 02:07:34,058 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 307 transitions. Word has length 49 [2023-02-14 02:07:34,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:07:34,058 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 307 transitions. [2023-02-14 02:07:34,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 307 transitions. [2023-02-14 02:07:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 02:07:34,059 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:07:34,059 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:07:34,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 02:07:34,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-14 02:07:34,260 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:07:34,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:07:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash -167608475, now seen corresponding path program 1 times [2023-02-14 02:07:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:07:34,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519189544] [2023-02-14 02:07:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:07:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:07:34,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:07:34,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519189544] [2023-02-14 02:07:34,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519189544] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:07:34,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486960187] [2023-02-14 02:07:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:34,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:07:34,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:07:34,506 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:07:34,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 02:07:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:34,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 02:07:34,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:07:34,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-14 02:07:34,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-14 02:07:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:07:34,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:07:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:07:35,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486960187] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:07:35,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:07:35,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2023-02-14 02:07:35,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721351671] [2023-02-14 02:07:35,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:07:35,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:07:35,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:07:35,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:07:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:07:35,108 INFO L87 Difference]: Start difference. First operand 275 states and 307 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:07:35,580 INFO L93 Difference]: Finished difference Result 303 states and 338 transitions. [2023-02-14 02:07:35,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:07:35,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-02-14 02:07:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:07:35,581 INFO L225 Difference]: With dead ends: 303 [2023-02-14 02:07:35,581 INFO L226 Difference]: Without dead ends: 303 [2023-02-14 02:07:35,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-14 02:07:35,582 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 189 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 02:07:35,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 356 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 02:07:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-02-14 02:07:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2023-02-14 02:07:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 265 states have (on average 1.271698113207547) internal successors, (337), 296 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 337 transitions. [2023-02-14 02:07:35,585 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 337 transitions. Word has length 49 [2023-02-14 02:07:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:07:35,585 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 337 transitions. [2023-02-14 02:07:35,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 337 transitions. [2023-02-14 02:07:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-14 02:07:35,586 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:07:35,586 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:07:35,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-14 02:07:35,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-14 02:07:35,786 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:07:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:07:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash -900848288, now seen corresponding path program 1 times [2023-02-14 02:07:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:07:35,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820588907] [2023-02-14 02:07:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:35,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:07:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:36,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:07:36,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820588907] [2023-02-14 02:07:36,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820588907] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:07:36,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181364701] [2023-02-14 02:07:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:36,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:07:36,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:07:36,689 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:07:36,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 02:07:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:36,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-14 02:07:36,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:07:36,845 INFO L350 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 [2023-02-14 02:07:37,122 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:07:37,122 INFO L350 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 11 treesize of output 11 [2023-02-14 02:07:37,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:07:37,266 INFO L350 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 [2023-02-14 02:07:37,586 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:37,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-14 02:07:37,600 INFO L350 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 18 treesize of output 20 [2023-02-14 02:07:37,648 INFO L350 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 16 treesize of output 8 [2023-02-14 02:07:37,843 INFO L350 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 14 treesize of output 16 [2023-02-14 02:07:37,887 INFO L350 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 14 treesize of output 16 [2023-02-14 02:07:38,318 INFO L350 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 [2023-02-14 02:07:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:38,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:07:38,570 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2023-02-14 02:07:39,235 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1397) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1399)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2023-02-14 02:07:39,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:39,264 INFO L350 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 36 treesize of output 37 [2023-02-14 02:07:39,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:39,275 INFO L350 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 28 treesize of output 29 [2023-02-14 02:07:39,281 INFO L350 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 50 treesize of output 42 [2023-02-14 02:07:39,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:39,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 100 treesize of output 99 [2023-02-14 02:07:39,313 INFO L350 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 60 treesize of output 52 [2023-02-14 02:07:39,321 INFO L350 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 76 treesize of output 70 [2023-02-14 02:07:39,329 INFO L350 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 48 treesize of output 46 [2023-02-14 02:07:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:39,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181364701] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:07:39,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:07:39,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 27 [2023-02-14 02:07:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854391241] [2023-02-14 02:07:39,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:07:39,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-14 02:07:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:07:39,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 02:07:39,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=514, Unknown=38, NotChecked=98, Total=756 [2023-02-14 02:07:39,771 INFO L87 Difference]: Start difference. First operand 297 states and 337 transitions. Second operand has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:42,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:07:42,922 INFO L93 Difference]: Finished difference Result 463 states and 521 transitions. [2023-02-14 02:07:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 02:07:42,923 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-02-14 02:07:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:07:42,924 INFO L225 Difference]: With dead ends: 463 [2023-02-14 02:07:42,924 INFO L226 Difference]: Without dead ends: 463 [2023-02-14 02:07:42,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=293, Invalid=1077, Unknown=44, NotChecked=146, Total=1560 [2023-02-14 02:07:42,925 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 562 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:07:42,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1247 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 840 Invalid, 1 Unknown, 419 Unchecked, 2.1s Time] [2023-02-14 02:07:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-02-14 02:07:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 299. [2023-02-14 02:07:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 267 states have (on average 1.2696629213483146) internal successors, (339), 298 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 339 transitions. [2023-02-14 02:07:42,928 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 339 transitions. Word has length 50 [2023-02-14 02:07:42,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:07:42,929 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 339 transitions. [2023-02-14 02:07:42,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:42,929 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 339 transitions. [2023-02-14 02:07:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 02:07:42,929 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:07:42,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:07:42,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-14 02:07:43,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-14 02:07:43,130 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:07:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:07:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2138474601, now seen corresponding path program 1 times [2023-02-14 02:07:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:07:43,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51780205] [2023-02-14 02:07:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:07:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:43,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:07:43,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51780205] [2023-02-14 02:07:43,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51780205] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:07:43,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758641298] [2023-02-14 02:07:43,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:43,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:07:43,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:07:43,999 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:07:44,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-14 02:07:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:44,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 02:07:44,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:07:44,141 INFO L350 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 [2023-02-14 02:07:44,450 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:07:44,450 INFO L350 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 11 treesize of output 11 [2023-02-14 02:07:44,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:07:44,930 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:44,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-14 02:07:45,194 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:45,195 INFO L350 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 1 case distinctions, treesize of input 29 treesize of output 27 [2023-02-14 02:07:45,280 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:45,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-14 02:07:45,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-14 02:07:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:45,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:07:46,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1499) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2023-02-14 02:07:46,485 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1497))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1499)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2023-02-14 02:07:46,503 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1497))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1499)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2023-02-14 02:07:46,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:46,526 INFO L350 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 38 treesize of output 31 [2023-02-14 02:07:46,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:46,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 252 treesize of output 227 [2023-02-14 02:07:46,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:07:46,584 INFO L350 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 212 treesize of output 204 [2023-02-14 02:07:46,595 INFO L350 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 196 treesize of output 188 [2023-02-14 02:07:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:47,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758641298] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:07:47,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:07:47,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 27 [2023-02-14 02:07:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112915085] [2023-02-14 02:07:47,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:07:47,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-14 02:07:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:07:47,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 02:07:47,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=502, Unknown=15, NotChecked=144, Total=756 [2023-02-14 02:07:47,221 INFO L87 Difference]: Start difference. First operand 299 states and 339 transitions. Second operand has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 28 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:07:50,887 INFO L93 Difference]: Finished difference Result 311 states and 347 transitions. [2023-02-14 02:07:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 02:07:50,888 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 28 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-02-14 02:07:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:07:50,889 INFO L225 Difference]: With dead ends: 311 [2023-02-14 02:07:50,889 INFO L226 Difference]: Without dead ends: 311 [2023-02-14 02:07:50,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=322, Invalid=1233, Unknown=17, NotChecked=234, Total=1806 [2023-02-14 02:07:50,889 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 351 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 532 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:07:50,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1111 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 750 Invalid, 2 Unknown, 532 Unchecked, 2.1s Time] [2023-02-14 02:07:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-02-14 02:07:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 300. [2023-02-14 02:07:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 268 states have (on average 1.2686567164179106) internal successors, (340), 299 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 340 transitions. [2023-02-14 02:07:50,895 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 340 transitions. Word has length 51 [2023-02-14 02:07:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:07:50,895 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 340 transitions. [2023-02-14 02:07:50,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 28 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 340 transitions. [2023-02-14 02:07:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 02:07:50,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:07:50,896 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:07:50,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-14 02:07:51,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-14 02:07:51,101 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:07:51,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:07:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash -805075436, now seen corresponding path program 1 times [2023-02-14 02:07:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:07:51,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188213984] [2023-02-14 02:07:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:07:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 02:07:51,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:07:51,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188213984] [2023-02-14 02:07:51,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188213984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:07:51,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:07:51,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:07:51,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712936199] [2023-02-14 02:07:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:07:51,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:07:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:07:51,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:07:51,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:07:51,173 INFO L87 Difference]: Start difference. First operand 300 states and 340 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:07:51,253 INFO L93 Difference]: Finished difference Result 361 states and 402 transitions. [2023-02-14 02:07:51,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:07:51,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-02-14 02:07:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:07:51,255 INFO L225 Difference]: With dead ends: 361 [2023-02-14 02:07:51,255 INFO L226 Difference]: Without dead ends: 361 [2023-02-14 02:07:51,255 INFO L412 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 [2023-02-14 02:07:51,255 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:07:51,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 293 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:07:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-02-14 02:07:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 285. [2023-02-14 02:07:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 253 states have (on average 1.2648221343873518) internal successors, (320), 284 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 320 transitions. [2023-02-14 02:07:51,259 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 320 transitions. Word has length 51 [2023-02-14 02:07:51,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:07:51,259 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 320 transitions. [2023-02-14 02:07:51,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 320 transitions. [2023-02-14 02:07:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 02:07:51,260 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:07:51,260 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:07:51,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-14 02:07:51,261 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:07:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:07:51,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1868203650, now seen corresponding path program 1 times [2023-02-14 02:07:51,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:07:51,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907905652] [2023-02-14 02:07:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:51,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:07:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 02:07:51,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:07:51,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907905652] [2023-02-14 02:07:51,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907905652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:07:51,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:07:51,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:07:51,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086633886] [2023-02-14 02:07:51,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:07:51,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:07:51,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:07:51,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:07:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:07:51,351 INFO L87 Difference]: Start difference. First operand 285 states and 320 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:51,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:07:51,713 INFO L93 Difference]: Finished difference Result 289 states and 323 transitions. [2023-02-14 02:07:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:07:51,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-14 02:07:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:07:51,715 INFO L225 Difference]: With dead ends: 289 [2023-02-14 02:07:51,715 INFO L226 Difference]: Without dead ends: 289 [2023-02-14 02:07:51,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:07:51,715 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 165 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 02:07:51,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 159 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 02:07:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-14 02:07:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 278. [2023-02-14 02:07:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.2672064777327936) internal successors, (313), 277 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 313 transitions. [2023-02-14 02:07:51,718 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 313 transitions. Word has length 52 [2023-02-14 02:07:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:07:51,718 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 313 transitions. [2023-02-14 02:07:51,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 313 transitions. [2023-02-14 02:07:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 02:07:51,719 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:07:51,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:07:51,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-14 02:07:51,719 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:07:51,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:07:51,719 INFO L85 PathProgramCache]: Analyzing trace with hash 455461742, now seen corresponding path program 1 times [2023-02-14 02:07:51,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:07:51,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242544416] [2023-02-14 02:07:51,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:51,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:07:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:51,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:07:51,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242544416] [2023-02-14 02:07:51,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242544416] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:07:51,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:07:51,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:07:51,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128867879] [2023-02-14 02:07:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:07:51,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:07:51,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:07:51,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:07:51,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:07:51,794 INFO L87 Difference]: Start difference. First operand 278 states and 313 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:07:51,923 INFO L93 Difference]: Finished difference Result 295 states and 319 transitions. [2023-02-14 02:07:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:07:51,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-14 02:07:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:07:51,925 INFO L225 Difference]: With dead ends: 295 [2023-02-14 02:07:51,925 INFO L226 Difference]: Without dead ends: 295 [2023-02-14 02:07:51,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:07:51,925 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 49 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:07:51,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 386 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:07:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-14 02:07:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 272. [2023-02-14 02:07:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 241 states have (on average 1.2448132780082988) internal successors, (300), 271 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 300 transitions. [2023-02-14 02:07:51,928 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 300 transitions. Word has length 52 [2023-02-14 02:07:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:07:51,928 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 300 transitions. [2023-02-14 02:07:51,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:07:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 300 transitions. [2023-02-14 02:07:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 02:07:51,928 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:07:51,929 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:07:51,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-14 02:07:51,929 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:07:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:07:51,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1330619915, now seen corresponding path program 1 times [2023-02-14 02:07:51,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:07:51,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071680404] [2023-02-14 02:07:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:51,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:07:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:55,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:07:55,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071680404] [2023-02-14 02:07:55,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071680404] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:07:55,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291522520] [2023-02-14 02:07:55,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:07:55,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:07:55,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:07:55,050 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:07:55,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-14 02:07:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:07:55,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-14 02:07:55,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:07:55,205 INFO L350 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 [2023-02-14 02:07:55,343 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:07:55,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-02-14 02:07:55,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-02-14 02:07:55,976 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:55,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-02-14 02:07:56,422 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:56,422 INFO L350 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 1 case distinctions, treesize of input 30 treesize of output 28 [2023-02-14 02:07:56,688 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:07:56,688 INFO L350 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 1 case distinctions, treesize of input 30 treesize of output 28 [2023-02-14 02:07:56,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:07:57,051 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 02:07:57,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 02:07:57,292 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 02:07:57,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-02-14 02:07:57,810 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 02:07:57,810 INFO L350 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 50 [2023-02-14 02:07:58,295 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 02:07:58,295 INFO L350 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 52 [2023-02-14 02:07:58,513 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 02:07:58,513 INFO L350 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 3 case distinctions, treesize of input 59 treesize of output 52 [2023-02-14 02:07:59,174 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 02:07:59,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-02-14 02:07:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:07:59,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:07:59,295 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-14 02:07:59,712 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-14 02:07:59,731 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-14 02:07:59,757 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1817 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-14 02:08:00,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:00,084 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-02-14 02:08:00,108 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_1819 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1817 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_15 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_15) .cse1 v_ArrVal_1817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2023-02-14 02:08:01,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:01,054 INFO L350 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 120 treesize of output 80 [2023-02-14 02:08:01,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:01,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18117 treesize of output 14488 [2023-02-14 02:08:01,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:01,233 INFO L350 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 14473 treesize of output 14247 [2023-02-14 02:08:01,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:01,308 INFO L350 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 14225 treesize of output 12143 [2023-02-14 02:08:01,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:01,400 INFO L350 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 12128 treesize of output 11421 [2023-02-14 02:08:01,458 INFO L350 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 11412 treesize of output 10836 [2023-02-14 02:08:01,732 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-02-14 02:08:01,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2023-02-14 02:08:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 02:08:03,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291522520] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:08:03,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:08:03,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 20] total 51 [2023-02-14 02:08:03,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372037907] [2023-02-14 02:08:03,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:08:03,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-14 02:08:03,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:03,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-14 02:08:03,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1833, Unknown=19, NotChecked=460, Total=2550 [2023-02-14 02:08:03,739 INFO L87 Difference]: Start difference. First operand 272 states and 300 transitions. Second operand has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 51 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:08:06,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:08:10,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:08:13,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-14 02:08:16,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:08:19,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:08:25,671 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= .cse0 0)) (forall ((v_ArrVal_1819 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| (select .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1817))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) |ULTIMATE.start_main_~item~0#1.offset|))) (and (= .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse0 .cse3)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse3))))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1)) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_1819 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1817 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_15 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_15) .cse5 v_ArrVal_1817))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse5) 0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_31| Int)) (or (forall ((v_ArrVal_1819 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1817 (Array Int Int))) (not (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 |ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_31|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_31| v_ArrVal_1817))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_31|) 0)))))) is different from false [2023-02-14 02:08:26,275 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1819 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse0 0)) (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|))))) is different from false [2023-02-14 02:08:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:34,418 INFO L93 Difference]: Finished difference Result 492 states and 537 transitions. [2023-02-14 02:08:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-14 02:08:34,419 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 51 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-14 02:08:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:34,420 INFO L225 Difference]: With dead ends: 492 [2023-02-14 02:08:34,420 INFO L226 Difference]: Without dead ends: 492 [2023-02-14 02:08:34,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2143 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=998, Invalid=5482, Unknown=28, NotChecked=1148, Total=7656 [2023-02-14 02:08:34,422 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 850 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 115 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 2715 SdHoareTripleChecker+Invalid, 4003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 1285 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-02-14 02:08:34,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 2715 Invalid, 4003 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [115 Valid, 2591 Invalid, 12 Unknown, 1285 Unchecked, 19.6s Time] [2023-02-14 02:08:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-02-14 02:08:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 321. [2023-02-14 02:08:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 290 states have (on average 1.217241379310345) internal successors, (353), 320 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:08:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 353 transitions. [2023-02-14 02:08:34,426 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 353 transitions. Word has length 52 [2023-02-14 02:08:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:34,427 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 353 transitions. [2023-02-14 02:08:34,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 51 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:08:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 353 transitions. [2023-02-14 02:08:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-14 02:08:34,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:34,427 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:08:34,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-14 02:08:34,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-02-14 02:08:34,635 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-14 02:08:34,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash 47392293, now seen corresponding path program 2 times [2023-02-14 02:08:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:34,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452551127] [2023-02-14 02:08:34,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:34,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:36,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452551127] [2023-02-14 02:08:36,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452551127] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:08:36,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097076912] [2023-02-14 02:08:36,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 02:08:36,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:08:36,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:08:36,117 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:08:36,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-14 02:08:36,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 02:08:36,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 02:08:36,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-14 02:08:36,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:08:36,285 INFO L350 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 [2023-02-14 02:08:36,653 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:08:36,653 INFO L350 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 11 treesize of output 11 [2023-02-14 02:08:36,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:08:36,864 INFO L350 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 [2023-02-14 02:08:37,316 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:08:37,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-14 02:08:37,323 INFO L350 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 18 treesize of output 20 [2023-02-14 02:08:37,721 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 02:08:37,721 INFO L350 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 1 case distinctions, treesize of input 27 treesize of output 22 [2023-02-14 02:08:37,759 INFO L350 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 21 [2023-02-14 02:08:38,014 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:08:38,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2023-02-14 02:08:38,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2023-02-14 02:08:39,752 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2023-02-14 02:08:39,752 INFO L350 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 53 treesize of output 36 [2023-02-14 02:08:39,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:39,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2023-02-14 02:08:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:40,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:08:49,634 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1922))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1921))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse3 (+ .cse2 8))) (select (store .cse0 .cse1 (store (store (select .cse0 .cse1) .cse2 0) .cse3 v_ArrVal_1928)) (select (select (store .cse4 .cse1 (store (store (select .cse4 .cse1) .cse2 0) .cse3 v_ArrVal_1930)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) 0) 0)) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1930 Int)) (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1921))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store .cse6 .cse7 (let ((.cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1922) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store (select .cse6 .cse7) .cse8 0) (+ .cse8 8) v_ArrVal_1930))))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) 0))) is different from false [2023-02-14 02:08:49,674 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1922))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1921))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse3 (+ 8 .cse2))) (select (store .cse0 .cse1 (store (store (select .cse0 .cse1) .cse2 0) .cse3 v_ArrVal_1928)) (select (select (store .cse4 .cse1 (store (store (select .cse4 .cse1) .cse2 0) .cse3 v_ArrVal_1930)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) 0) 0)) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1930 Int)) (= (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1921))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store .cse7 .cse8 (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1922) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store (select .cse7 .cse8) .cse9 0) (+ 8 .cse9) v_ArrVal_1930))))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) 0)))) is different from false [2023-02-14 02:08:49,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:49,716 INFO L350 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 201 treesize of output 162 [2023-02-14 02:08:49,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:49,734 INFO L350 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 153 treesize of output 114 [2023-02-14 02:08:49,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:49,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1216 treesize of output 1194 [2023-02-14 02:08:49,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:08:51,498 INFO L321 Elim1Store]: treesize reduction 330, result has 58.4 percent of original size [2023-02-14 02:08:51,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 13416 treesize of output 12018 [2023-02-14 02:08:51,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:51,795 INFO L350 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 20112 treesize of output 18276 [2023-02-14 02:08:52,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:52,665 INFO L350 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 22120 treesize of output 20910 [2023-02-14 02:08:58,744 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-14 02:10:14,956 INFO L350 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 5842 treesize of output 5700