./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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/sll-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 a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:03:22,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:03:22,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:03:22,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:03:22,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:03:22,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:03:22,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:03:22,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:03:22,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:03:22,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:03:22,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:03:22,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:03:22,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:03:22,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:03:22,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:03:22,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:03:22,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:03:22,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:03:22,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:03:22,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:03:22,660 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:03:22,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:03:22,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:03:22,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:03:22,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:03:22,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:03:22,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:03:22,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:03:22,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:03:22,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:03:22,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:03:22,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:03:22,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:03:22,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:03:22,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:03:22,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:03:22,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:03:22,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:03:22,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:03:22,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:03:22,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:03:22,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:03:22,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:03:22,697 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:03:22,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:03:22,697 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:03:22,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:03:22,698 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:03:22,698 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:03:22,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:03:22,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:03:22,699 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:03:22,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:03:22,700 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:03:22,700 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:03:22,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:03:22,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:03:22,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:03:22,700 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:03:22,701 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:03:22,701 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:03:22,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:03:22,702 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:03:22,702 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:03:22,702 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:03:22,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:03:22,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:03:22,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:03:22,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:03:22,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:03:22,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:03:22,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:03:22,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:03:22,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 [2022-07-12 19:03:22,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:03:22,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:03:22,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:03:22,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:03:22,913 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:03:22,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-1.i [2022-07-12 19:03:22,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/012baa4d7/27f12bd634c24c05a344643ad3582cb8/FLAG9a3924ae8 [2022-07-12 19:03:23,360 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:03:23,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i [2022-07-12 19:03:23,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/012baa4d7/27f12bd634c24c05a344643ad3582cb8/FLAG9a3924ae8 [2022-07-12 19:03:23,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/012baa4d7/27f12bd634c24c05a344643ad3582cb8 [2022-07-12 19:03:23,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:03:23,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:03:23,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:03:23,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:03:23,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:03:23,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e096302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23, skipping insertion in model container [2022-07-12 19:03:23,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:03:23,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:03:23,634 WARN L230 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/sll-queue-1.i[22387,22400] [2022-07-12 19:03:23,636 WARN L230 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/sll-queue-1.i[22458,22471] [2022-07-12 19:03:23,637 WARN L230 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/sll-queue-1.i[22532,22545] [2022-07-12 19:03:23,637 WARN L230 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/sll-queue-1.i[22624,22637] [2022-07-12 19:03:23,638 WARN L230 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/sll-queue-1.i[22701,22714] [2022-07-12 19:03:23,640 WARN L230 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/sll-queue-1.i[22796,22809] [2022-07-12 19:03:23,641 WARN L230 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/sll-queue-1.i[22873,22886] [2022-07-12 19:03:23,643 WARN L230 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/sll-queue-1.i[22956,22969] [2022-07-12 19:03:23,644 WARN L230 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/sll-queue-1.i[23051,23064] [2022-07-12 19:03:23,646 WARN L230 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/sll-queue-1.i[23128,23141] [2022-07-12 19:03:23,647 WARN L230 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/sll-queue-1.i[23211,23224] [2022-07-12 19:03:23,648 WARN L230 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/sll-queue-1.i[23300,23313] [2022-07-12 19:03:23,650 WARN L230 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/sll-queue-1.i[23386,23399] [2022-07-12 19:03:23,652 WARN L230 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/sll-queue-1.i[23532,23545] [2022-07-12 19:03:23,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:03:23,662 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:03:23,682 WARN L230 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/sll-queue-1.i[22387,22400] [2022-07-12 19:03:23,683 WARN L230 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/sll-queue-1.i[22458,22471] [2022-07-12 19:03:23,683 WARN L230 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/sll-queue-1.i[22532,22545] [2022-07-12 19:03:23,684 WARN L230 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/sll-queue-1.i[22624,22637] [2022-07-12 19:03:23,684 WARN L230 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/sll-queue-1.i[22701,22714] [2022-07-12 19:03:23,685 WARN L230 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/sll-queue-1.i[22796,22809] [2022-07-12 19:03:23,685 WARN L230 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/sll-queue-1.i[22873,22886] [2022-07-12 19:03:23,686 WARN L230 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/sll-queue-1.i[22956,22969] [2022-07-12 19:03:23,686 WARN L230 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/sll-queue-1.i[23051,23064] [2022-07-12 19:03:23,687 WARN L230 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/sll-queue-1.i[23128,23141] [2022-07-12 19:03:23,687 WARN L230 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/sll-queue-1.i[23211,23224] [2022-07-12 19:03:23,688 WARN L230 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/sll-queue-1.i[23300,23313] [2022-07-12 19:03:23,688 WARN L230 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/sll-queue-1.i[23386,23399] [2022-07-12 19:03:23,689 WARN L230 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/sll-queue-1.i[23532,23545] [2022-07-12 19:03:23,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:03:23,706 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:03:23,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23 WrapperNode [2022-07-12 19:03:23,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:03:23,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:03:23,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:03:23,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:03:23,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,762 INFO L137 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 222 [2022-07-12 19:03:23,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:03:23,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:03:23,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:03:23,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:03:23,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:03:23,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:03:23,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:03:23,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:03:23,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (1/1) ... [2022-07-12 19:03:23,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:03:23,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:23,823 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) [2022-07-12 19:03:23,824 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 [2022-07-12 19:03:23,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:03:23,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:03:23,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:03:23,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:03:23,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:03:23,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:03:23,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:03:23,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:03:23,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:03:23,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:03:23,943 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:03:23,944 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:03:24,222 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:03:24,227 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:03:24,230 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-12 19:03:24,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:24 BoogieIcfgContainer [2022-07-12 19:03:24,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:03:24,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:03:24,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:03:24,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:03:24,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:03:23" (1/3) ... [2022-07-12 19:03:24,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28212733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:24, skipping insertion in model container [2022-07-12 19:03:24,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:23" (2/3) ... [2022-07-12 19:03:24,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28212733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:24, skipping insertion in model container [2022-07-12 19:03:24,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:24" (3/3) ... [2022-07-12 19:03:24,240 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2022-07-12 19:03:24,250 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:03:24,251 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-12 19:03:24,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:03:24,301 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ff17295, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@78e33ece [2022-07-12 19:03:24,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-12 19:03:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 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) [2022-07-12 19:03:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:24,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:24,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 19:03:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245343262] [2022-07-12 19:03:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:24,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245343262] [2022-07-12 19:03:24,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245343262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:24,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778513695] [2022-07-12 19:03:24,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:24,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:24,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:24,455 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 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) [2022-07-12 19:03:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,613 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-07-12 19:03:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:24,615 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 [2022-07-12 19:03:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,622 INFO L225 Difference]: With dead ends: 169 [2022-07-12 19:03:24,622 INFO L226 Difference]: Without dead ends: 165 [2022-07-12 19:03:24,624 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 [2022-07-12 19:03:24,628 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 160 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:24,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 109 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-12 19:03:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-12 19:03:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 160 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) [2022-07-12 19:03:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-07-12 19:03:24,653 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 3 [2022-07-12 19:03:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,653 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-07-12 19:03:24,653 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) [2022-07-12 19:03:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-07-12 19:03:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:24,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:24,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:03:24,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,655 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 19:03:24,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451449330] [2022-07-12 19:03:24,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:24,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451449330] [2022-07-12 19:03:24,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451449330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:24,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187756643] [2022-07-12 19:03:24,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:24,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:24,684 INFO L87 Difference]: Start difference. First operand 161 states and 173 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) [2022-07-12 19:03:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,753 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-12 19:03:24,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:24,758 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 [2022-07-12 19:03:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,761 INFO L225 Difference]: With dead ends: 155 [2022-07-12 19:03:24,761 INFO L226 Difference]: Without dead ends: 155 [2022-07-12 19:03:24,761 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 [2022-07-12 19:03:24,762 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 147 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:24,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 112 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-12 19:03:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-07-12 19:03:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.603960396039604) internal successors, (162), 150 states have internal predecessors, (162), 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) [2022-07-12 19:03:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2022-07-12 19:03:24,771 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2022-07-12 19:03:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,771 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2022-07-12 19:03:24,771 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) [2022-07-12 19:03:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-07-12 19:03:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:03:24,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:24,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:03:24,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:24,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-07-12 19:03:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401784472] [2022-07-12 19:03:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:24,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401784472] [2022-07-12 19:03:24,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401784472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161000195] [2022-07-12 19:03:24,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:24,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:24,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:24,838 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-12 19:03:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,940 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-07-12 19:03:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:24,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-07-12 19:03:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,942 INFO L225 Difference]: With dead ends: 161 [2022-07-12 19:03:24,942 INFO L226 Difference]: Without dead ends: 161 [2022-07-12 19:03:24,942 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 [2022-07-12 19:03:24,943 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 260 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:24,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 116 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-12 19:03:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2022-07-12 19:03:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.5555555555555556) internal successors, (168), 152 states have internal predecessors, (168), 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) [2022-07-12 19:03:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2022-07-12 19:03:24,949 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 8 [2022-07-12 19:03:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,949 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2022-07-12 19:03:24,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-12 19:03:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2022-07-12 19:03:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:03:24,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:24,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:03:24,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-07-12 19:03:24,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015335970] [2022-07-12 19:03:24,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:25,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015335970] [2022-07-12 19:03:25,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015335970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824817317] [2022-07-12 19:03:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:25,017 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-12 19:03:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,165 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2022-07-12 19:03:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-07-12 19:03:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,167 INFO L225 Difference]: With dead ends: 244 [2022-07-12 19:03:25,167 INFO L226 Difference]: Without dead ends: 244 [2022-07-12 19:03:25,168 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 [2022-07-12 19:03:25,168 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 318 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:25,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 184 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-12 19:03:25,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 158. [2022-07-12 19:03:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5309734513274336) internal successors, (173), 157 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) [2022-07-12 19:03:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2022-07-12 19:03:25,175 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 8 [2022-07-12 19:03:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,176 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2022-07-12 19:03:25,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-12 19:03:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2022-07-12 19:03:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:03:25,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:25,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:03:25,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1837174119, now seen corresponding path program 1 times [2022-07-12 19:03:25,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410959839] [2022-07-12 19:03:25,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410959839] [2022-07-12 19:03:25,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410959839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:25,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820398821] [2022-07-12 19:03:25,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:25,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:25,209 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2022-07-12 19:03:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,230 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2022-07-12 19:03:25,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:25,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 [2022-07-12 19:03:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,231 INFO L225 Difference]: With dead ends: 148 [2022-07-12 19:03:25,231 INFO L226 Difference]: Without dead ends: 148 [2022-07-12 19:03:25,231 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 [2022-07-12 19:03:25,233 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 125 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:25,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-12 19:03:25,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-12 19:03:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.5) internal successors, (162), 147 states have internal predecessors, (162), 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) [2022-07-12 19:03:25,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-07-12 19:03:25,247 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 9 [2022-07-12 19:03:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,247 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-07-12 19:03:25,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2022-07-12 19:03:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-07-12 19:03:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:25,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:25,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:03:25,249 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:25,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-12 19:03:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191897142] [2022-07-12 19:03:25,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191897142] [2022-07-12 19:03:25,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191897142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:25,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134260958] [2022-07-12 19:03:25,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:25,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:25,300 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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) [2022-07-12 19:03:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,497 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2022-07-12 19:03:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:03:25,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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 [2022-07-12 19:03:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,498 INFO L225 Difference]: With dead ends: 219 [2022-07-12 19:03:25,499 INFO L226 Difference]: Without dead ends: 219 [2022-07-12 19:03:25,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:03:25,500 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 110 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:25,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 682 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-12 19:03:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 147. [2022-07-12 19:03:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 146 states have internal predecessors, (161), 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) [2022-07-12 19:03:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-07-12 19:03:25,504 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 12 [2022-07-12 19:03:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,504 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-07-12 19:03:25,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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) [2022-07-12 19:03:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-07-12 19:03:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:25,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:25,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:03:25,506 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-12 19:03:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660932264] [2022-07-12 19:03:25,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:25,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660932264] [2022-07-12 19:03:25,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660932264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416780733] [2022-07-12 19:03:25,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:25,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:25,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:25,600 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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) [2022-07-12 19:03:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,803 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2022-07-12 19:03:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:25,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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 [2022-07-12 19:03:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,804 INFO L225 Difference]: With dead ends: 211 [2022-07-12 19:03:25,804 INFO L226 Difference]: Without dead ends: 211 [2022-07-12 19:03:25,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:25,805 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 97 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:25,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 676 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-12 19:03:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 136. [2022-07-12 19:03:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 135 states have internal predecessors, (149), 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) [2022-07-12 19:03:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-07-12 19:03:25,809 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 12 [2022-07-12 19:03:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,809 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-07-12 19:03:25,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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) [2022-07-12 19:03:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-07-12 19:03:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:03:25,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:25,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:03:25,810 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1603335132, now seen corresponding path program 1 times [2022-07-12 19:03:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695834740] [2022-07-12 19:03:25,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695834740] [2022-07-12 19:03:25,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695834740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966187173] [2022-07-12 19:03:25,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:25,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:25,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:25,833 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,849 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-07-12 19:03:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:25,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 19:03:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,850 INFO L225 Difference]: With dead ends: 191 [2022-07-12 19:03:25,850 INFO L226 Difference]: Without dead ends: 191 [2022-07-12 19:03:25,850 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 [2022-07-12 19:03:25,851 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 250 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 [2022-07-12 19:03:25,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 250 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-12 19:03:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 149. [2022-07-12 19:03:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 148 states have internal predecessors, (163), 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) [2022-07-12 19:03:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-07-12 19:03:25,854 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 15 [2022-07-12 19:03:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,854 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-07-12 19:03:25,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-07-12 19:03:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 19:03:25,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:25,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 19:03:25,855 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,855 INFO L85 PathProgramCache]: Analyzing trace with hash -775737061, now seen corresponding path program 1 times [2022-07-12 19:03:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741619278] [2022-07-12 19:03:25,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741619278] [2022-07-12 19:03:25,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741619278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:03:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599285827] [2022-07-12 19:03:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:25,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:25,893 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-07-12 19:03:25,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,974 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2022-07-12 19:03:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:25,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2022-07-12 19:03:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,978 INFO L225 Difference]: With dead ends: 149 [2022-07-12 19:03:25,978 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 19:03:25,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:25,979 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:25,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 541 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 19:03:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-07-12 19:03:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.4) internal successors, (161), 146 states have internal predecessors, (161), 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) [2022-07-12 19:03:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-07-12 19:03:25,982 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 19 [2022-07-12 19:03:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,982 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-07-12 19:03:25,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-07-12 19:03:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-07-12 19:03:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 19:03:25,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,983 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] [2022-07-12 19:03:25,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:03:25,983 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:25,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash 73317399, now seen corresponding path program 1 times [2022-07-12 19:03:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289204211] [2022-07-12 19:03:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:26,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:26,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289204211] [2022-07-12 19:03:26,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289204211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:26,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:26,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:03:26,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065376812] [2022-07-12 19:03:26,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:26,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:26,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:26,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:26,033 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-07-12 19:03:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:26,122 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-07-12 19:03:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:26,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2022-07-12 19:03:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:26,124 INFO L225 Difference]: With dead ends: 156 [2022-07-12 19:03:26,124 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 19:03:26,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:03:26,125 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:26,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 572 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 19:03:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-07-12 19:03:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 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) [2022-07-12 19:03:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-07-12 19:03:26,127 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 20 [2022-07-12 19:03:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:26,128 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-07-12 19:03:26,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-07-12 19:03:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-07-12 19:03:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:03:26,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:26,129 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] [2022-07-12 19:03:26,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:03:26,129 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash -800612379, now seen corresponding path program 1 times [2022-07-12 19:03:26,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:26,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14708152] [2022-07-12 19:03:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:26,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:26,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14708152] [2022-07-12 19:03:26,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14708152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:26,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:26,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537776840] [2022-07-12 19:03:26,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:26,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:26,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:26,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:26,161 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-07-12 19:03:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:26,227 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-07-12 19:03:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:26,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-07-12 19:03:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:26,228 INFO L225 Difference]: With dead ends: 152 [2022-07-12 19:03:26,228 INFO L226 Difference]: Without dead ends: 152 [2022-07-12 19:03:26,228 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 [2022-07-12 19:03:26,229 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:26,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-12 19:03:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-12 19:03:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.375) internal successors, (165), 151 states have internal predecessors, (165), 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) [2022-07-12 19:03:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-07-12 19:03:26,231 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 22 [2022-07-12 19:03:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:26,232 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-07-12 19:03:26,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-07-12 19:03:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-07-12 19:03:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:03:26,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:26,233 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] [2022-07-12 19:03:26,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:03:26,233 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1089542561, now seen corresponding path program 1 times [2022-07-12 19:03:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:26,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444309869] [2022-07-12 19:03:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:26,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444309869] [2022-07-12 19:03:26,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444309869] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:26,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024271661] [2022-07-12 19:03:26,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:26,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:26,282 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) [2022-07-12 19:03:26,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 19:03:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:26,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 19:03:26,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:26,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:26,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:26,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:26,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024271661] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:26,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:26,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2022-07-12 19:03:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710503609] [2022-07-12 19:03:26,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:26,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:03:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:03:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:03:26,554 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 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) [2022-07-12 19:03:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:26,760 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2022-07-12 19:03:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:03:26,761 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 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 25 [2022-07-12 19:03:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:26,761 INFO L225 Difference]: With dead ends: 181 [2022-07-12 19:03:26,761 INFO L226 Difference]: Without dead ends: 181 [2022-07-12 19:03:26,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:03:26,762 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 155 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:26,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 712 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-12 19:03:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2022-07-12 19:03:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 130 states have (on average 1.353846153846154) internal successors, (176), 161 states have internal predecessors, (176), 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) [2022-07-12 19:03:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2022-07-12 19:03:26,765 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 25 [2022-07-12 19:03:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:26,765 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2022-07-12 19:03:26,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 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) [2022-07-12 19:03:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2022-07-12 19:03:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:03:26,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:26,766 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] [2022-07-12 19:03:26,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:26,979 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,SelfDestructingSolverStorable11 [2022-07-12 19:03:26,979 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash 583917852, now seen corresponding path program 1 times [2022-07-12 19:03:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:26,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609216733] [2022-07-12 19:03:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:27,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:27,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609216733] [2022-07-12 19:03:27,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609216733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:27,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808176335] [2022-07-12 19:03:27,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:27,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:27,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:27,056 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) [2022-07-12 19:03:27,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 19:03:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:27,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 19:03:27,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:27,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:27,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:27,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808176335] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:27,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:27,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-12 19:03:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508828656] [2022-07-12 19:03:27,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:27,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:27,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:27,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:27,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:27,243 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2022-07-12 19:03:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:27,330 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2022-07-12 19:03:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:03:27,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 [2022-07-12 19:03:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:27,331 INFO L225 Difference]: With dead ends: 172 [2022-07-12 19:03:27,332 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 19:03:27,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:27,332 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 12 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:27,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 378 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 19:03:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-12 19:03:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.371900826446281) internal successors, (166), 152 states have internal predecessors, (166), 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) [2022-07-12 19:03:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2022-07-12 19:03:27,335 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 26 [2022-07-12 19:03:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:27,335 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2022-07-12 19:03:27,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2022-07-12 19:03:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2022-07-12 19:03:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:03:27,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:27,336 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] [2022-07-12 19:03:27,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:27,547 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,SelfDestructingSolverStorable12 [2022-07-12 19:03:27,548 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash -370767273, now seen corresponding path program 1 times [2022-07-12 19:03:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:27,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237746162] [2022-07-12 19:03:27,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:27,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:27,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237746162] [2022-07-12 19:03:27,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237746162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:27,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156782036] [2022-07-12 19:03:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:27,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:27,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:27,673 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) [2022-07-12 19:03:27,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 19:03:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:27,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:03:27,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:27,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:27,785 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:27,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:27,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:27,883 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:27,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:27,900 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:27,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:27,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:27,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:27,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 19:03:27,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 19:03:28,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= 0 (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_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:03:28,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:28,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 20 [2022-07-12 19:03:28,015 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:28,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 36 [2022-07-12 19:03:28,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-07-12 19:03:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:28,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156782036] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:28,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:28,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-07-12 19:03:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616257159] [2022-07-12 19:03:28,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:28,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 19:03:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 19:03:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=363, Unknown=3, NotChecked=120, Total=552 [2022-07-12 19:03:28,162 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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) [2022-07-12 19:03:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:28,693 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2022-07-12 19:03:28,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:03:28,694 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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 29 [2022-07-12 19:03:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:28,695 INFO L225 Difference]: With dead ends: 281 [2022-07-12 19:03:28,695 INFO L226 Difference]: Without dead ends: 281 [2022-07-12 19:03:28,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=749, Unknown=3, NotChecked=180, Total=1122 [2022-07-12 19:03:28,696 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 527 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:28,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1402 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 901 Invalid, 0 Unknown, 531 Unchecked, 0.3s Time] [2022-07-12 19:03:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-12 19:03:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 168. [2022-07-12 19:03:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 167 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) [2022-07-12 19:03:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2022-07-12 19:03:28,698 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 29 [2022-07-12 19:03:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:28,699 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2022-07-12 19:03:28,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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) [2022-07-12 19:03:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-07-12 19:03:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:03:28,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:28,699 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] [2022-07-12 19:03:28,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:28,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:28,907 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:28,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:28,908 INFO L85 PathProgramCache]: Analyzing trace with hash -751968760, now seen corresponding path program 1 times [2022-07-12 19:03:28,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:28,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442787882] [2022-07-12 19:03:28,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:28,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:28,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442787882] [2022-07-12 19:03:28,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442787882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:28,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:28,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365669986] [2022-07-12 19:03:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:28,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:28,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:28,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:28,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:28,943 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-12 19:03:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:28,959 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2022-07-12 19:03:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2022-07-12 19:03:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:28,961 INFO L225 Difference]: With dead ends: 239 [2022-07-12 19:03:28,961 INFO L226 Difference]: Without dead ends: 239 [2022-07-12 19:03:28,962 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 [2022-07-12 19:03:28,963 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 55 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 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 [2022-07-12 19:03:28,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-12 19:03:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 186. [2022-07-12 19:03:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 185 states have internal predecessors, (201), 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) [2022-07-12 19:03:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2022-07-12 19:03:28,967 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 30 [2022-07-12 19:03:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:28,967 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2022-07-12 19:03:28,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-12 19:03:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2022-07-12 19:03:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:03:28,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:28,969 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] [2022-07-12 19:03:28,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 19:03:28,969 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046208, now seen corresponding path program 1 times [2022-07-12 19:03:28,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:28,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999909385] [2022-07-12 19:03:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:29,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:29,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999909385] [2022-07-12 19:03:29,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999909385] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:29,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250696520] [2022-07-12 19:03:29,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:29,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:29,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:29,127 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) [2022-07-12 19:03:29,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 19:03:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:29,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:03:29,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:29,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:29,242 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:03:29,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:29,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:29,374 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:29,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:29,400 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:29,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:29,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:29,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:29,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-12 19:03:29,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (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_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-12 19:03:29,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:29,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-07-12 19:03:29,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:29,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 37 [2022-07-12 19:03:29,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-12 19:03:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:33,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250696520] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:33,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:33,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2022-07-12 19:03:33,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804953626] [2022-07-12 19:03:33,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:33,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 19:03:33,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:33,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 19:03:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=611, Unknown=11, NotChecked=106, Total=870 [2022-07-12 19:03:33,825 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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) [2022-07-12 19:03:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:34,398 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2022-07-12 19:03:34,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:03:34,398 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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 39 [2022-07-12 19:03:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:34,399 INFO L225 Difference]: With dead ends: 247 [2022-07-12 19:03:34,399 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 19:03:34,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=344, Invalid=1293, Unknown=11, NotChecked=158, Total=1806 [2022-07-12 19:03:34,400 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 270 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 689 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:34,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1287 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 662 Invalid, 0 Unknown, 689 Unchecked, 0.3s Time] [2022-07-12 19:03:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 19:03:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 197. [2022-07-12 19:03:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 165 states have (on average 1.309090909090909) internal successors, (216), 196 states have internal predecessors, (216), 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) [2022-07-12 19:03:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 216 transitions. [2022-07-12 19:03:34,403 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 216 transitions. Word has length 39 [2022-07-12 19:03:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:34,403 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 216 transitions. [2022-07-12 19:03:34,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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) [2022-07-12 19:03:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 216 transitions. [2022-07-12 19:03:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:03:34,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:34,406 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] [2022-07-12 19:03:34,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:34,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 19:03:34,611 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:34,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:34,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046209, now seen corresponding path program 1 times [2022-07-12 19:03:34,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:34,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493827277] [2022-07-12 19:03:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:34,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:34,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:34,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493827277] [2022-07-12 19:03:34,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493827277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:34,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517165744] [2022-07-12 19:03:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:34,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:34,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:34,799 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) [2022-07-12 19:03:34,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 19:03:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:34,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 19:03:34,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:34,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:34,925 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:34,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:34,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:34,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:34,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:35,064 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:03:35,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:35,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:35,079 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:35,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:35,121 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:35,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:35,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:35,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:35,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:35,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:35,439 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 19:03:35,456 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)))) is different from false [2022-07-12 19:03:35,463 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-12 19:03:35,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:35,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-07-12 19:03:35,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:35,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 37 [2022-07-12 19:03:35,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-12 19:03:35,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:35,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 [2022-07-12 19:03:35,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:35,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-07-12 19:03:35,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:35,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 19 [2022-07-12 19:03:35,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:35,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 12 [2022-07-12 19:03:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:35,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517165744] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:35,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:35,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2022-07-12 19:03:35,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499506826] [2022-07-12 19:03:35,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:35,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 19:03:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:35,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 19:03:35,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-07-12 19:03:35,610 INFO L87 Difference]: Start difference. First operand 197 states and 216 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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) [2022-07-12 19:03:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:37,051 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2022-07-12 19:03:37,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 19:03:37,052 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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 39 [2022-07-12 19:03:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:37,053 INFO L225 Difference]: With dead ends: 325 [2022-07-12 19:03:37,053 INFO L226 Difference]: Without dead ends: 325 [2022-07-12 19:03:37,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=471, Invalid=2294, Unknown=3, NotChecked=312, Total=3080 [2022-07-12 19:03:37,055 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1069 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 879 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:37,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1111 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1151 Invalid, 0 Unknown, 879 Unchecked, 0.6s Time] [2022-07-12 19:03:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-12 19:03:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 201. [2022-07-12 19:03:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.301775147928994) internal successors, (220), 200 states have internal predecessors, (220), 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) [2022-07-12 19:03:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 220 transitions. [2022-07-12 19:03:37,058 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 220 transitions. Word has length 39 [2022-07-12 19:03:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:37,059 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 220 transitions. [2022-07-12 19:03:37,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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) [2022-07-12 19:03:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2022-07-12 19:03:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:03:37,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:37,060 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] [2022-07-12 19:03:37,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:37,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 19:03:37,273 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:37,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1519790839, now seen corresponding path program 1 times [2022-07-12 19:03:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:37,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828677] [2022-07-12 19:03:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:03:37,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:37,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828677] [2022-07-12 19:03:37,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:37,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:37,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:37,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148868370] [2022-07-12 19:03:37,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:37,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:37,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:37,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:37,303 INFO L87 Difference]: Start difference. First operand 201 states and 220 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2022-07-12 19:03:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:37,308 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2022-07-12 19:03:37,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:37,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 40 [2022-07-12 19:03:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:37,309 INFO L225 Difference]: With dead ends: 202 [2022-07-12 19:03:37,309 INFO L226 Difference]: Without dead ends: 202 [2022-07-12 19:03:37,309 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 [2022-07-12 19:03:37,310 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 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 [2022-07-12 19:03:37,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-12 19:03:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-12 19:03:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 201 states have internal predecessors, (220), 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) [2022-07-12 19:03:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2022-07-12 19:03:37,313 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 40 [2022-07-12 19:03:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:37,313 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2022-07-12 19:03:37,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2022-07-12 19:03:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2022-07-12 19:03:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:03:37,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:37,314 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] [2022-07-12 19:03:37,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 19:03:37,314 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:37,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:37,315 INFO L85 PathProgramCache]: Analyzing trace with hash 231761564, now seen corresponding path program 1 times [2022-07-12 19:03:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:37,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756037558] [2022-07-12 19:03:37,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:37,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756037558] [2022-07-12 19:03:37,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756037558] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:37,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483119904] [2022-07-12 19:03:37,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:37,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:37,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:37,597 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) [2022-07-12 19:03:37,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 19:03:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:37,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 19:03:37,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:37,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:37,698 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:37,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:37,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:37,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:37,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:37,816 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:37,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:37,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:37,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:37,892 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:37,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 63 [2022-07-12 19:03:37,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 13 [2022-07-12 19:03:37,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:37,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 9 [2022-07-12 19:03:38,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 17 [2022-07-12 19:03:38,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:38,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:38,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:38,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 10 [2022-07-12 19:03:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:38,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:38,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 60 [2022-07-12 19:03:38,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:38,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-07-12 19:03:38,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:38,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 41 [2022-07-12 19:03:38,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 11 [2022-07-12 19:03:38,511 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:03:38,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 1 [2022-07-12 19:03:38,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:38,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 19:03:38,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:38,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:38,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:38,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 19:03:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:38,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483119904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:38,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:38,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 37 [2022-07-12 19:03:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071517700] [2022-07-12 19:03:38,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:38,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 19:03:38,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 19:03:38,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 19:03:38,622 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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) [2022-07-12 19:03:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:39,945 INFO L93 Difference]: Finished difference Result 315 states and 338 transitions. [2022-07-12 19:03:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 19:03:39,945 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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 42 [2022-07-12 19:03:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:39,947 INFO L225 Difference]: With dead ends: 315 [2022-07-12 19:03:39,947 INFO L226 Difference]: Without dead ends: 315 [2022-07-12 19:03:39,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=419, Invalid=2887, Unknown=0, NotChecked=0, Total=3306 [2022-07-12 19:03:39,948 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 457 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 605 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:39,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2102 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1241 Invalid, 0 Unknown, 605 Unchecked, 0.5s Time] [2022-07-12 19:03:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-12 19:03:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 201. [2022-07-12 19:03:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 200 states have internal predecessors, (218), 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) [2022-07-12 19:03:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2022-07-12 19:03:39,952 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 42 [2022-07-12 19:03:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:39,953 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2022-07-12 19:03:39,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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) [2022-07-12 19:03:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2022-07-12 19:03:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:03:39,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:39,953 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] [2022-07-12 19:03:39,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:40,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:40,172 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:40,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995560, now seen corresponding path program 1 times [2022-07-12 19:03:40,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:40,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473737155] [2022-07-12 19:03:40,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:40,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:40,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:40,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473737155] [2022-07-12 19:03:40,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473737155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:40,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78266510] [2022-07-12 19:03:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:40,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:40,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:40,310 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) [2022-07-12 19:03:40,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 19:03:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:40,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 19:03:40,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:40,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:40,436 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:03:40,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:40,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:40,547 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:40,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:40,567 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:40,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:40,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:40,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:40,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:40,841 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |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_681 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 19:03:40,852 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_681) |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 [2022-07-12 19:03:40,857 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (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_681) |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_681 (Array Int Int))) (= (select |c_#valid| (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_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2022-07-12 19:03:40,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:40,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 20 [2022-07-12 19:03:40,869 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:40,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 36 [2022-07-12 19:03:40,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-07-12 19:03:40,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:40,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-07-12 19:03:40,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:40,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:40,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:40,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 10 [2022-07-12 19:03:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:40,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78266510] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:40,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:40,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-07-12 19:03:40,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499002079] [2022-07-12 19:03:40,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:40,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 19:03:40,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:40,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 19:03:40,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=539, Unknown=3, NotChecked=150, Total=812 [2022-07-12 19:03:40,963 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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) [2022-07-12 19:03:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:41,423 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2022-07-12 19:03:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:03:41,424 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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 [2022-07-12 19:03:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:41,424 INFO L225 Difference]: With dead ends: 248 [2022-07-12 19:03:41,424 INFO L226 Difference]: Without dead ends: 248 [2022-07-12 19:03:41,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=753, Unknown=3, NotChecked=180, Total=1122 [2022-07-12 19:03:41,425 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 376 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 591 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:41,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1160 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 849 Invalid, 0 Unknown, 591 Unchecked, 0.3s Time] [2022-07-12 19:03:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-12 19:03:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2022-07-12 19:03:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3125) internal successors, (252), 223 states have internal predecessors, (252), 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) [2022-07-12 19:03:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2022-07-12 19:03:41,428 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 44 [2022-07-12 19:03:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:41,428 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2022-07-12 19:03:41,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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) [2022-07-12 19:03:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2022-07-12 19:03:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:03:41,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:41,429 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] [2022-07-12 19:03:41,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:41,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:41,636 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:41,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995559, now seen corresponding path program 1 times [2022-07-12 19:03:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:41,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812996252] [2022-07-12 19:03:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:41,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:41,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812996252] [2022-07-12 19:03:41,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812996252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:41,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290067789] [2022-07-12 19:03:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:41,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:41,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:41,776 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) [2022-07-12 19:03:41,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 19:03:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:41,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-12 19:03:41,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:41,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:41,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:41,929 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:41,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:41,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:41,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:42,045 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:03:42,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:42,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:42,060 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:42,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:42,093 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:42,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:42,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:42,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:42,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:42,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:42,438 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |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_~item~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:03:42,452 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |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~mem4#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 19:03:42,458 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_761) |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| .cse0 v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:03:42,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:42,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 [2022-07-12 19:03:42,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:42,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-07-12 19:03:42,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:42,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 55 [2022-07-12 19:03:42,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:42,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 81 [2022-07-12 19:03:42,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-07-12 19:03:42,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 58 [2022-07-12 19:03:42,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:42,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 19:03:42,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:42,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:42,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290067789] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:42,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:42,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2022-07-12 19:03:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477463493] [2022-07-12 19:03:42,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:42,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 19:03:42,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:42,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 19:03:42,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=618, Unknown=3, NotChecked=156, Total=870 [2022-07-12 19:03:42,615 INFO L87 Difference]: Start difference. First operand 224 states and 252 transitions. Second operand has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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) [2022-07-12 19:03:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:43,358 INFO L93 Difference]: Finished difference Result 247 states and 268 transitions. [2022-07-12 19:03:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:03:43,358 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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 [2022-07-12 19:03:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:43,359 INFO L225 Difference]: With dead ends: 247 [2022-07-12 19:03:43,359 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 19:03:43,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=1198, Unknown=3, NotChecked=228, Total=1722 [2022-07-12 19:03:43,360 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 434 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:43,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1063 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 906 Invalid, 0 Unknown, 486 Unchecked, 0.4s Time] [2022-07-12 19:03:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 19:03:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2022-07-12 19:03:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3072916666666667) internal successors, (251), 223 states have internal predecessors, (251), 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) [2022-07-12 19:03:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 251 transitions. [2022-07-12 19:03:43,363 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 251 transitions. Word has length 44 [2022-07-12 19:03:43,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:43,363 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 251 transitions. [2022-07-12 19:03:43,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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) [2022-07-12 19:03:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 251 transitions. [2022-07-12 19:03:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:03:43,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:43,364 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-12 19:03:43,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 [2022-07-12 19:03:43,571 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,SelfDestructingSolverStorable20 [2022-07-12 19:03:43,571 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash -64101254, now seen corresponding path program 1 times [2022-07-12 19:03:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:43,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169228592] [2022-07-12 19:03:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 19:03:43,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:43,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169228592] [2022-07-12 19:03:43,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169228592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:43,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:43,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:43,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637828988] [2022-07-12 19:03:43,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:43,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:43,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:43,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:43,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:43,607 INFO L87 Difference]: Start difference. First operand 224 states and 251 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-07-12 19:03:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:43,629 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-07-12 19:03:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:43,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 [2022-07-12 19:03:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:43,631 INFO L225 Difference]: With dead ends: 298 [2022-07-12 19:03:43,631 INFO L226 Difference]: Without dead ends: 298 [2022-07-12 19:03:43,631 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 [2022-07-12 19:03:43,632 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 282 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:43,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 282 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-12 19:03:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2022-07-12 19:03:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 241 states have internal predecessors, (270), 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) [2022-07-12 19:03:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2022-07-12 19:03:43,635 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 44 [2022-07-12 19:03:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:43,635 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2022-07-12 19:03:43,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-07-12 19:03:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2022-07-12 19:03:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:03:43,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:43,636 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] [2022-07-12 19:03:43,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 19:03:43,636 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2014223229, now seen corresponding path program 1 times [2022-07-12 19:03:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:43,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894978363] [2022-07-12 19:03:43,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:43,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:03:43,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:43,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894978363] [2022-07-12 19:03:43,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894978363] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:43,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308830593] [2022-07-12 19:03:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:43,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:43,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:43,678 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) [2022-07-12 19:03:43,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 19:03:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:43,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 19:03:43,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:43,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:43,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:03:43,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:03:43,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308830593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:43,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:43,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-12 19:03:43,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613738986] [2022-07-12 19:03:43,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:43,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:03:43,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:43,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:03:43,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:43,861 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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) [2022-07-12 19:03:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:43,942 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2022-07-12 19:03:43,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:03:43,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 45 [2022-07-12 19:03:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:43,943 INFO L225 Difference]: With dead ends: 283 [2022-07-12 19:03:43,943 INFO L226 Difference]: Without dead ends: 275 [2022-07-12 19:03:43,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:03:43,946 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 192 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:43,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 349 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-12 19:03:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 269. [2022-07-12 19:03:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 268 states have internal predecessors, (304), 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) [2022-07-12 19:03:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2022-07-12 19:03:43,950 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 45 [2022-07-12 19:03:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:43,950 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2022-07-12 19:03:43,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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) [2022-07-12 19:03:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2022-07-12 19:03:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:03:43,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:43,951 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-12 19:03:43,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:44,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:44,167 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash 164743237, now seen corresponding path program 1 times [2022-07-12 19:03:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:44,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602574919] [2022-07-12 19:03:44,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:44,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:44,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602574919] [2022-07-12 19:03:44,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602574919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:44,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734369526] [2022-07-12 19:03:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:44,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:44,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:44,428 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) [2022-07-12 19:03:44,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 19:03:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:44,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 19:03:44,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:44,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:44,617 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:44,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:44,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:44,735 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:44,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:44,752 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:44,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:44,804 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:44,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:44,836 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:03:44,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-12 19:03:44,939 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:03:44,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 48 [2022-07-12 19:03:44,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-07-12 19:03:45,010 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:03:45,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 55 [2022-07-12 19:03:45,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:45,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:45,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 19:03:45,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 19:03:45,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (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_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 19:03:45,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (not (= (select (select (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_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 19:03:45,204 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:45,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 21 [2022-07-12 19:03:45,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-07-12 19:03:45,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-12 19:03:45,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_68| Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_14 |v_ULTIMATE.start_main_~item~0#1.offset_68|))) (or (not (= 0 (select |c_#valid| .cse0))) (not (= (select (select (store (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_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-07-12 19:03:45,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:45,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 25 [2022-07-12 19:03:45,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:45,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 76 [2022-07-12 19:03:45,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:45,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 65 [2022-07-12 19:03:45,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-07-12 19:03:45,267 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:03:45,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-12 19:03:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 19:03:45,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734369526] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:45,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:45,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2022-07-12 19:03:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903529048] [2022-07-12 19:03:45,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:45,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 19:03:45,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 19:03:45,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=925, Unknown=7, NotChecked=476, Total=1560 [2022-07-12 19:03:45,380 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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) [2022-07-12 19:03:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:46,464 INFO L93 Difference]: Finished difference Result 336 states and 377 transitions. [2022-07-12 19:03:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 19:03:46,464 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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 45 [2022-07-12 19:03:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:46,465 INFO L225 Difference]: With dead ends: 336 [2022-07-12 19:03:46,465 INFO L226 Difference]: Without dead ends: 336 [2022-07-12 19:03:46,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=396, Invalid=1881, Unknown=7, NotChecked=686, Total=2970 [2022-07-12 19:03:46,467 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 385 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1233 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:46,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1431 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 967 Invalid, 0 Unknown, 1233 Unchecked, 0.4s Time] [2022-07-12 19:03:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-12 19:03:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 292. [2022-07-12 19:03:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 260 states have (on average 1.2615384615384615) internal successors, (328), 291 states have internal predecessors, (328), 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) [2022-07-12 19:03:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 328 transitions. [2022-07-12 19:03:46,472 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 328 transitions. Word has length 45 [2022-07-12 19:03:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:46,472 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 328 transitions. [2022-07-12 19:03:46,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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) [2022-07-12 19:03:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 328 transitions. [2022-07-12 19:03:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:03:46,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:46,473 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] [2022-07-12 19:03:46,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-12 19:03:46,691 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,SelfDestructingSolverStorable23 [2022-07-12 19:03:46,691 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:46,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1983636472, now seen corresponding path program 1 times [2022-07-12 19:03:46,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:46,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173408204] [2022-07-12 19:03:46,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:46,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:46,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:46,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173408204] [2022-07-12 19:03:46,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173408204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:46,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926055053] [2022-07-12 19:03:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:46,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:46,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:46,814 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) [2022-07-12 19:03:46,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 19:03:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:46,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 19:03:46,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:46,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:47,000 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:47,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:47,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:47,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:47,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:47,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:47,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:47,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:47,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:47,251 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-12 19:03:47,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-12 19:03:47,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-12 19:03:47,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:47,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 19:03:47,270 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:47,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-12 19:03:47,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-12 19:03:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:47,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926055053] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:47,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:47,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2022-07-12 19:03:47,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029867211] [2022-07-12 19:03:47,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:47,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 19:03:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:47,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 19:03:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=385, Unknown=3, NotChecked=126, Total=600 [2022-07-12 19:03:47,328 INFO L87 Difference]: Start difference. First operand 292 states and 328 transitions. Second operand has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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) [2022-07-12 19:03:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:47,802 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2022-07-12 19:03:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:03:47,803 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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 [2022-07-12 19:03:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:47,803 INFO L225 Difference]: With dead ends: 301 [2022-07-12 19:03:47,804 INFO L226 Difference]: Without dead ends: 301 [2022-07-12 19:03:47,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=828, Unknown=4, NotChecked=192, Total=1260 [2022-07-12 19:03:47,804 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 409 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:47,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1193 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 753 Invalid, 0 Unknown, 512 Unchecked, 0.3s Time] [2022-07-12 19:03:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-12 19:03:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 294. [2022-07-12 19:03:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 262 states have (on average 1.2595419847328244) internal successors, (330), 293 states have internal predecessors, (330), 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) [2022-07-12 19:03:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 330 transitions. [2022-07-12 19:03:47,808 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 330 transitions. Word has length 46 [2022-07-12 19:03:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:47,808 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 330 transitions. [2022-07-12 19:03:47,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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) [2022-07-12 19:03:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 330 transitions. [2022-07-12 19:03:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 19:03:47,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:47,809 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] [2022-07-12 19:03:47,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:48,025 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,SelfDestructingSolverStorable24 [2022-07-12 19:03:48,025 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:48,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1363188935, now seen corresponding path program 1 times [2022-07-12 19:03:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:48,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914595489] [2022-07-12 19:03:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:48,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:48,043 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2022-07-12 19:03:48,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 19:03:48,050 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 19:03:48,057 INFO L158 Benchmark]: Toolchain (without parser) took 24665.45ms. Allocated memory was 125.8MB in the beginning and 157.3MB in the end (delta: 31.5MB). Free memory was 89.3MB in the beginning and 49.3MB in the end (delta: 40.0MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2022-07-12 19:03:48,057 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 125.8MB. Free memory was 98.9MB in the beginning and 98.9MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:03:48,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.42ms. Allocated memory is still 125.8MB. Free memory was 89.1MB in the beginning and 90.7MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 19:03:48,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.58ms. Allocated memory is still 125.8MB. Free memory was 90.7MB in the beginning and 88.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:03:48,058 INFO L158 Benchmark]: Boogie Preprocessor took 34.44ms. Allocated memory is still 125.8MB. Free memory was 88.7MB in the beginning and 86.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:03:48,058 INFO L158 Benchmark]: RCFGBuilder took 431.68ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 63.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-12 19:03:48,061 INFO L158 Benchmark]: TraceAbstraction took 23821.97ms. Allocated memory was 125.8MB in the beginning and 157.3MB in the end (delta: 31.5MB). Free memory was 63.6MB in the beginning and 49.3MB in the end (delta: 14.3MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2022-07-12 19:03:48,063 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 125.8MB. Free memory was 98.9MB in the beginning and 98.9MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.42ms. Allocated memory is still 125.8MB. Free memory was 89.1MB in the beginning and 90.7MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.58ms. Allocated memory is still 125.8MB. Free memory was 90.7MB in the beginning and 88.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.44ms. Allocated memory is still 125.8MB. Free memory was 88.7MB in the beginning and 86.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.68ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 63.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23821.97ms. Allocated memory was 125.8MB in the beginning and 157.3MB in the end (delta: 31.5MB). Free memory was 63.6MB in the beginning and 49.3MB in the end (delta: 14.3MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 19:03:48,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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/sll-queue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:03:49,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:03:49,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:03:49,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:03:49,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:03:49,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:03:49,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:03:49,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:03:49,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:03:49,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:03:49,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:03:49,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:03:49,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:03:49,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:03:49,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:03:49,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:03:49,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:03:49,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:03:49,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:03:49,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:03:49,813 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:03:49,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:03:49,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:03:49,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:03:49,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:03:49,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:03:49,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:03:49,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:03:49,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:03:49,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:03:49,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:03:49,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:03:49,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:03:49,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:03:49,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:03:49,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:03:49,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:03:49,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:03:49,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:03:49,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:03:49,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:03:49,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:03:49,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:03:49,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:03:49,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:03:49,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:03:49,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:03:49,856 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:03:49,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:03:49,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:03:49,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:03:49,857 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:03:49,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:03:49,858 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:03:49,858 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:03:49,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:03:49,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:03:49,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:03:49,859 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:03:49,864 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:03:49,864 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:03:49,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:03:49,864 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:03:49,864 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:03:49,864 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:03:49,864 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:03:49,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:03:49,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:03:49,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:03:49,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:03:49,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:03:49,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:03:49,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:03:49,866 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:03:49,866 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:03:49,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:03:49,866 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 [2022-07-12 19:03:50,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:03:50,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:03:50,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:03:50,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:03:50,128 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:03:50,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-1.i [2022-07-12 19:03:50,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779c70548/8503ca8f0d904687ba658398ea9d6172/FLAG8ae05ecfa [2022-07-12 19:03:50,583 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:03:50,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i [2022-07-12 19:03:50,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779c70548/8503ca8f0d904687ba658398ea9d6172/FLAG8ae05ecfa [2022-07-12 19:03:50,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779c70548/8503ca8f0d904687ba658398ea9d6172 [2022-07-12 19:03:50,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:03:50,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:03:50,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:03:50,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:03:50,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:03:50,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:03:50" (1/1) ... [2022-07-12 19:03:50,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a344787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:50, skipping insertion in model container [2022-07-12 19:03:50,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:03:50" (1/1) ... [2022-07-12 19:03:50,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:03:50,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:03:50,923 WARN L230 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/sll-queue-1.i[22387,22400] [2022-07-12 19:03:50,925 WARN L230 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/sll-queue-1.i[22458,22471] [2022-07-12 19:03:50,926 WARN L230 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/sll-queue-1.i[22532,22545] [2022-07-12 19:03:50,927 WARN L230 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/sll-queue-1.i[22624,22637] [2022-07-12 19:03:50,928 WARN L230 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/sll-queue-1.i[22701,22714] [2022-07-12 19:03:50,930 WARN L230 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/sll-queue-1.i[22796,22809] [2022-07-12 19:03:50,931 WARN L230 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/sll-queue-1.i[22873,22886] [2022-07-12 19:03:50,931 WARN L230 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/sll-queue-1.i[22956,22969] [2022-07-12 19:03:50,933 WARN L230 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/sll-queue-1.i[23051,23064] [2022-07-12 19:03:50,934 WARN L230 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/sll-queue-1.i[23128,23141] [2022-07-12 19:03:50,937 WARN L230 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/sll-queue-1.i[23211,23224] [2022-07-12 19:03:50,938 WARN L230 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/sll-queue-1.i[23300,23313] [2022-07-12 19:03:50,939 WARN L230 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/sll-queue-1.i[23386,23399] [2022-07-12 19:03:50,940 WARN L230 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/sll-queue-1.i[23532,23545] [2022-07-12 19:03:50,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:03:50,961 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:03:50,982 WARN L230 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/sll-queue-1.i[22387,22400] [2022-07-12 19:03:50,982 WARN L230 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/sll-queue-1.i[22458,22471] [2022-07-12 19:03:50,983 WARN L230 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/sll-queue-1.i[22532,22545] [2022-07-12 19:03:50,984 WARN L230 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/sll-queue-1.i[22624,22637] [2022-07-12 19:03:50,984 WARN L230 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/sll-queue-1.i[22701,22714] [2022-07-12 19:03:50,985 WARN L230 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/sll-queue-1.i[22796,22809] [2022-07-12 19:03:50,986 WARN L230 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/sll-queue-1.i[22873,22886] [2022-07-12 19:03:50,987 WARN L230 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/sll-queue-1.i[22956,22969] [2022-07-12 19:03:50,987 WARN L230 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/sll-queue-1.i[23051,23064] [2022-07-12 19:03:50,988 WARN L230 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/sll-queue-1.i[23128,23141] [2022-07-12 19:03:50,989 WARN L230 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/sll-queue-1.i[23211,23224] [2022-07-12 19:03:50,990 WARN L230 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/sll-queue-1.i[23300,23313] [2022-07-12 19:03:50,990 WARN L230 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/sll-queue-1.i[23386,23399] [2022-07-12 19:03:50,991 WARN L230 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/sll-queue-1.i[23532,23545] [2022-07-12 19:03:50,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:03:51,017 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:03:51,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51 WrapperNode [2022-07-12 19:03:51,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:03:51,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:03:51,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:03:51,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:03:51,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (1/1) ... [2022-07-12 19:03:51,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (1/1) ... [2022-07-12 19:03:51,064 INFO L137 Inliner]: procedures = 122, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2022-07-12 19:03:51,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:03:51,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:03:51,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:03:51,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:03:51,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (1/1) ... [2022-07-12 19:03:51,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (1/1) ... [2022-07-12 19:03:51,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (1/1) ... [2022-07-12 19:03:51,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (1/1) ... [2022-07-12 19:03:51,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (1/1) ... [2022-07-12 19:03:51,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (1/1) ... [2022-07-12 19:03:51,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (1/1) ... [2022-07-12 19:03:51,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:03:51,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:03:51,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:03:51,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:03:51,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (1/1) ... [2022-07-12 19:03:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:03:51,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:51,139 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) [2022-07-12 19:03:51,142 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 [2022-07-12 19:03:51,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 19:03:51,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:03:51,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:03:51,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:03:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:03:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:03:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 19:03:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 19:03:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:03:51,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:03:51,307 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:03:51,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:03:51,744 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:03:51,753 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:03:51,753 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-12 19:03:51,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:51 BoogieIcfgContainer [2022-07-12 19:03:51,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:03:51,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:03:51,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:03:51,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:03:51,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:03:50" (1/3) ... [2022-07-12 19:03:51,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c10290e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:51, skipping insertion in model container [2022-07-12 19:03:51,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:51" (2/3) ... [2022-07-12 19:03:51,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c10290e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:51, skipping insertion in model container [2022-07-12 19:03:51,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:51" (3/3) ... [2022-07-12 19:03:51,760 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2022-07-12 19:03:51,775 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:03:51,775 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-12 19:03:51,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:03:51,818 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13c9828b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ecd6b5e [2022-07-12 19:03:51,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-12 19:03:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 states have internal predecessors, (222), 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) [2022-07-12 19:03:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:51,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:51,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:51,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:51,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 19:03:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:51,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972289467] [2022-07-12 19:03:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:51,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:51,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:51,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:51,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 19:03:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:51,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:03:51,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:51,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:51,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:51,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:51,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972289467] [2022-07-12 19:03:51,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972289467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:51,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:51,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:51,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916549026] [2022-07-12 19:03:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:51,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:51,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:51,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:51,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:51,986 INFO L87 Difference]: Start difference. First operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 states have internal predecessors, (222), 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) [2022-07-12 19:03:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:52,175 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2022-07-12 19:03:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:52,177 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 [2022-07-12 19:03:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:52,182 INFO L225 Difference]: With dead ends: 166 [2022-07-12 19:03:52,183 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 19:03:52,184 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 [2022-07-12 19:03:52,185 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 156 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:52,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 105 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 19:03:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-07-12 19:03:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.7244897959183674) internal successors, (169), 157 states have internal predecessors, (169), 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) [2022-07-12 19:03:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2022-07-12 19:03:52,232 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 3 [2022-07-12 19:03:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:52,233 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2022-07-12 19:03:52,233 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) [2022-07-12 19:03:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-07-12 19:03:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:52,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:52,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:52,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 19:03:52,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:52,439 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:52,440 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 19:03:52,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:52,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207857728] [2022-07-12 19:03:52,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:52,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:52,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:52,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:52,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 19:03:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:52,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:03:52,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:52,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:52,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:52,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:52,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207857728] [2022-07-12 19:03:52,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207857728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:52,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:52,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249560237] [2022-07-12 19:03:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:52,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:52,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:52,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:52,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:52,492 INFO L87 Difference]: Start difference. First operand 158 states and 169 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) [2022-07-12 19:03:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:52,624 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2022-07-12 19:03:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:52,625 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 [2022-07-12 19:03:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:52,626 INFO L225 Difference]: With dead ends: 152 [2022-07-12 19:03:52,626 INFO L226 Difference]: Without dead ends: 152 [2022-07-12 19:03:52,626 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 [2022-07-12 19:03:52,627 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:52,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 108 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-12 19:03:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-07-12 19:03:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.6122448979591837) internal successors, (158), 147 states have internal predecessors, (158), 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) [2022-07-12 19:03:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-07-12 19:03:52,632 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 3 [2022-07-12 19:03:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:52,633 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-07-12 19:03:52,633 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) [2022-07-12 19:03:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-07-12 19:03:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 19:03:52,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:52,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:52,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:52,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:52,834 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:52,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2022-07-12 19:03:52,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:52,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040983535] [2022-07-12 19:03:52,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:52,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:52,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 19:03:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:52,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:03:52,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:52,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:52,936 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:03:52,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-12 19:03:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:52,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:52,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:52,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040983535] [2022-07-12 19:03:52,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040983535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:52,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:52,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:52,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668038436] [2022-07-12 19:03:52,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:52,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:52,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:52,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:52,949 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-07-12 19:03:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:53,123 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2022-07-12 19:03:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:53,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-07-12 19:03:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:53,125 INFO L225 Difference]: With dead ends: 158 [2022-07-12 19:03:53,125 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 19:03:53,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:53,126 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 256 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:53,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 108 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 19:03:53,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2022-07-12 19:03:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.561904761904762) internal successors, (164), 149 states have internal predecessors, (164), 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) [2022-07-12 19:03:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2022-07-12 19:03:53,132 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 7 [2022-07-12 19:03:53,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:53,132 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2022-07-12 19:03:53,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-07-12 19:03:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2022-07-12 19:03:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 19:03:53,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:53,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:53,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-12 19:03:53,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:53,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2022-07-12 19:03:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:53,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659002337] [2022-07-12 19:03:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:53,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:53,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:53,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 19:03:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:53,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:03:53,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:53,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:53,478 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:53,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:03:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:53,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:53,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659002337] [2022-07-12 19:03:53,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659002337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:53,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:53,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:53,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957121204] [2022-07-12 19:03:53,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:53,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:53,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:53,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:53,496 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-07-12 19:03:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:53,762 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2022-07-12 19:03:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:53,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-07-12 19:03:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:53,764 INFO L225 Difference]: With dead ends: 240 [2022-07-12 19:03:53,764 INFO L226 Difference]: Without dead ends: 240 [2022-07-12 19:03:53,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:53,765 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 313 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:53,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 175 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-12 19:03:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 154. [2022-07-12 19:03:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 153 states have internal predecessors, (168), 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) [2022-07-12 19:03:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2022-07-12 19:03:53,771 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 7 [2022-07-12 19:03:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:53,771 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2022-07-12 19:03:53,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-07-12 19:03:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2022-07-12 19:03:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:03:53,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:53,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:53,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:53,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:53,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash 59268142, now seen corresponding path program 1 times [2022-07-12 19:03:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:53,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816797907] [2022-07-12 19:03:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:53,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:53,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:53,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:53,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 19:03:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:54,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:03:54,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:54,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:54,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:54,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816797907] [2022-07-12 19:03:54,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816797907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:54,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:54,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:54,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329638987] [2022-07-12 19:03:54,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:54,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:54,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:54,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:54,033 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-07-12 19:03:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:54,071 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2022-07-12 19:03:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:54,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-07-12 19:03:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:54,073 INFO L225 Difference]: With dead ends: 144 [2022-07-12 19:03:54,073 INFO L226 Difference]: Without dead ends: 144 [2022-07-12 19:03:54,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:54,078 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 122 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:54,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 131 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-12 19:03:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-07-12 19:03:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.5096153846153846) internal successors, (157), 143 states have internal predecessors, (157), 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) [2022-07-12 19:03:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2022-07-12 19:03:54,082 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 8 [2022-07-12 19:03:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:54,082 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2022-07-12 19:03:54,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-07-12 19:03:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2022-07-12 19:03:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 19:03:54,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:54,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:54,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-12 19:03:54,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:54,290 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:54,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2022-07-12 19:03:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:54,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453382090] [2022-07-12 19:03:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:54,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:54,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:54,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:54,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 19:03:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:54,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:03:54,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:54,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:54,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:54,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-12 19:03:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:54,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:54,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:54,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453382090] [2022-07-12 19:03:54,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453382090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:54,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:54,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:54,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462235995] [2022-07-12 19:03:54,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:54,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:54,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:54,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:54,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:54,393 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:54,758 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2022-07-12 19:03:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:03:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 19:03:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:54,759 INFO L225 Difference]: With dead ends: 215 [2022-07-12 19:03:54,759 INFO L226 Difference]: Without dead ends: 215 [2022-07-12 19:03:54,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:03:54,760 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 109 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:54,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 656 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:03:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-12 19:03:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 143. [2022-07-12 19:03:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.5) internal successors, (156), 142 states have internal predecessors, (156), 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) [2022-07-12 19:03:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2022-07-12 19:03:54,764 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 11 [2022-07-12 19:03:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:54,764 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2022-07-12 19:03:54,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2022-07-12 19:03:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 19:03:54,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:54,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:54,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:54,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:54,971 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2022-07-12 19:03:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:54,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124040678] [2022-07-12 19:03:54,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:54,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:54,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:54,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:54,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 19:03:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:55,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:03:55,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:55,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:55,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:55,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:55,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-12 19:03:55,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:55,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:55,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:55,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124040678] [2022-07-12 19:03:55,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124040678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:55,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:55,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535330692] [2022-07-12 19:03:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:55,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:55,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:55,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:55,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:55,126 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:55,533 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2022-07-12 19:03:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:55,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 19:03:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:55,535 INFO L225 Difference]: With dead ends: 207 [2022-07-12 19:03:55,535 INFO L226 Difference]: Without dead ends: 207 [2022-07-12 19:03:55,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:55,535 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 96 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:55,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 650 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:03:55,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-12 19:03:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2022-07-12 19:03:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.45) internal successors, (145), 132 states have internal predecessors, (145), 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) [2022-07-12 19:03:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-12 19:03:55,538 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2022-07-12 19:03:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:55,539 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-12 19:03:55,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-12 19:03:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 19:03:55,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:55,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:55,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:55,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:55,746 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:55,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:55,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1469737219, now seen corresponding path program 1 times [2022-07-12 19:03:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:55,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948157293] [2022-07-12 19:03:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:55,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:55,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:55,748 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:55,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 19:03:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:55,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:03:55,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:55,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:55,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:55,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948157293] [2022-07-12 19:03:55,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948157293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:55,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:55,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:55,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435359151] [2022-07-12 19:03:55,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:55,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:55,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:55,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:55,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:55,810 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-12 19:03:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:55,830 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-07-12 19:03:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:55,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-07-12 19:03:55,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:55,831 INFO L225 Difference]: With dead ends: 185 [2022-07-12 19:03:55,831 INFO L226 Difference]: Without dead ends: 185 [2022-07-12 19:03:55,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:55,832 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 242 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 [2022-07-12 19:03:55,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-12 19:03:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2022-07-12 19:03:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 144 states have internal predecessors, (158), 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) [2022-07-12 19:03:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2022-07-12 19:03:55,835 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 14 [2022-07-12 19:03:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:55,835 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2022-07-12 19:03:55,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-12 19:03:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2022-07-12 19:03:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 19:03:55,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:55,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:55,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:56,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:56,044 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:56,045 INFO L85 PathProgramCache]: Analyzing trace with hash -529144660, now seen corresponding path program 1 times [2022-07-12 19:03:56,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:56,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242800877] [2022-07-12 19:03:56,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:56,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:56,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:56,046 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:56,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 19:03:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:56,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:03:56,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:56,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:56,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:56,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242800877] [2022-07-12 19:03:56,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242800877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:56,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:56,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:56,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177331992] [2022-07-12 19:03:56,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:56,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:56,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:56,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:56,119 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:56,144 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-07-12 19:03:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:56,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 19:03:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:56,145 INFO L225 Difference]: With dead ends: 176 [2022-07-12 19:03:56,145 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 19:03:56,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:56,147 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 31 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:56,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 19:03:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 154. [2022-07-12 19:03:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.396694214876033) internal successors, (169), 153 states have internal predecessors, (169), 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) [2022-07-12 19:03:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2022-07-12 19:03:56,151 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 17 [2022-07-12 19:03:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:56,151 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2022-07-12 19:03:56,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2022-07-12 19:03:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 19:03:56,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:56,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:56,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:56,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:56,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash 271532674, now seen corresponding path program 1 times [2022-07-12 19:03:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:56,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458477119] [2022-07-12 19:03:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:56,362 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:56,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 19:03:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:56,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:03:56,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:56,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:56,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:56,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:56,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:56,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458477119] [2022-07-12 19:03:56,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458477119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:56,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:56,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:03:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339523139] [2022-07-12 19:03:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:56,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:56,484 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-07-12 19:03:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:56,649 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2022-07-12 19:03:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:56,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2022-07-12 19:03:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:56,650 INFO L225 Difference]: With dead ends: 152 [2022-07-12 19:03:56,650 INFO L226 Difference]: Without dead ends: 152 [2022-07-12 19:03:56,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:56,651 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 89 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:56,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 515 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-12 19:03:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-12 19:03:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 151 states have internal predecessors, (167), 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) [2022-07-12 19:03:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-07-12 19:03:56,653 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 18 [2022-07-12 19:03:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:56,653 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-07-12 19:03:56,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-07-12 19:03:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-07-12 19:03:56,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 19:03:56,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:56,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:56,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:56,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:56,859 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:56,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1721073736, now seen corresponding path program 1 times [2022-07-12 19:03:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:56,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528060351] [2022-07-12 19:03:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:56,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:56,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:56,861 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:56,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 19:03:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:56,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:03:56,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:56,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:56,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:56,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528060351] [2022-07-12 19:03:56,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528060351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:56,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:56,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:56,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307529944] [2022-07-12 19:03:56,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:56,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:56,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:56,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:57,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:57,000 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-07-12 19:03:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:57,137 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-07-12 19:03:57,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:03:57,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2022-07-12 19:03:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:57,138 INFO L225 Difference]: With dead ends: 156 [2022-07-12 19:03:57,138 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 19:03:57,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:57,139 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 262 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:57,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 201 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 19:03:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-07-12 19:03:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 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) [2022-07-12 19:03:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-07-12 19:03:57,142 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 19 [2022-07-12 19:03:57,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:57,142 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-07-12 19:03:57,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-07-12 19:03:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-07-12 19:03:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 19:03:57,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:57,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:57,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:57,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:57,348 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:57,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:57,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1701915074, now seen corresponding path program 1 times [2022-07-12 19:03:57,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:57,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777987286] [2022-07-12 19:03:57,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:57,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:57,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:57,350 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:57,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 19:03:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:57,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:03:57,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:57,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:57,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:57,432 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 19:03:57,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-07-12 19:03:57,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:57,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:57,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:57,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:57,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:57,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:57,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777987286] [2022-07-12 19:03:57,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777987286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:57,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:57,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:57,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807932047] [2022-07-12 19:03:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:57,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:57,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:57,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:57,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:57,491 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-07-12 19:03:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:57,636 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-07-12 19:03:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:57,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-07-12 19:03:57,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:57,637 INFO L225 Difference]: With dead ends: 149 [2022-07-12 19:03:57,637 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 19:03:57,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:57,638 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:57,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 438 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 19:03:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2022-07-12 19:03:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 145 states have internal predecessors, (157), 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) [2022-07-12 19:03:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2022-07-12 19:03:57,640 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 19 [2022-07-12 19:03:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:57,640 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2022-07-12 19:03:57,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-07-12 19:03:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2022-07-12 19:03:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:03:57,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:57,644 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] [2022-07-12 19:03:57,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:57,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:57,851 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:57,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:57,851 INFO L85 PathProgramCache]: Analyzing trace with hash 812348068, now seen corresponding path program 1 times [2022-07-12 19:03:57,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:57,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994071174] [2022-07-12 19:03:57,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:57,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:57,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:57,853 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:57,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 19:03:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:57,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:03:57,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:57,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:57,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:57,941 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 19:03:57,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-07-12 19:03:57,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:57,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:57,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:57,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:58,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:58,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:58,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994071174] [2022-07-12 19:03:58,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994071174] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:58,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:03:58,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-12 19:03:58,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688094805] [2022-07-12 19:03:58,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:58,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:58,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:58,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:58,075 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-07-12 19:03:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:58,196 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-12 19:03:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:58,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-07-12 19:03:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:58,197 INFO L225 Difference]: With dead ends: 153 [2022-07-12 19:03:58,197 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 19:03:58,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:58,198 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:58,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 443 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 19:03:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-12 19:03:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 152 states have internal predecessors, (164), 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) [2022-07-12 19:03:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-07-12 19:03:58,200 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 22 [2022-07-12 19:03:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:58,204 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-07-12 19:03:58,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-07-12 19:03:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-07-12 19:03:58,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:03:58,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:58,205 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] [2022-07-12 19:03:58,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:58,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:58,405 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:58,406 INFO L85 PathProgramCache]: Analyzing trace with hash -587014801, now seen corresponding path program 1 times [2022-07-12 19:03:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:58,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5804206] [2022-07-12 19:03:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:58,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:58,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:58,407 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:58,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 19:03:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:58,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:03:58,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:58,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:58,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:58,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5804206] [2022-07-12 19:03:58,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5804206] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:58,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:03:58,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-12 19:03:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498060274] [2022-07-12 19:03:58,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:58,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:58,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:58,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:58,627 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 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) [2022-07-12 19:03:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:58,845 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-12 19:03:58,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:03:58,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 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 23 [2022-07-12 19:03:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:58,846 INFO L225 Difference]: With dead ends: 155 [2022-07-12 19:03:58,846 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 19:03:58,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:03:58,847 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:58,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-12 19:03:58,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 19:03:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-07-12 19:03:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 137 states have internal predecessors, (148), 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) [2022-07-12 19:03:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2022-07-12 19:03:58,849 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 23 [2022-07-12 19:03:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:58,849 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2022-07-12 19:03:58,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 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) [2022-07-12 19:03:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2022-07-12 19:03:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 19:03:58,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:58,849 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] [2022-07-12 19:03:58,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:59,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:03:59,050 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:03:59,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:59,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1469175391, now seen corresponding path program 1 times [2022-07-12 19:03:59,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:59,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190466319] [2022-07-12 19:03:59,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:59,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:59,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:59,051 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:03:59,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 19:03:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:59,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:03:59,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:59,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:59,163 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:59,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:59,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:59,259 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:59,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:59,282 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:59,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:59,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:03:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:59,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:59,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:03:59,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:03:59,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (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_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:03:59,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:59,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 20 [2022-07-12 19:03:59,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:59,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 36 [2022-07-12 19:03:59,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-07-12 19:03:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:59,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:59,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190466319] [2022-07-12 19:03:59,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190466319] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:59,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:03:59,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-12 19:03:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440820997] [2022-07-12 19:03:59,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:59,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 19:03:59,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:59,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 19:03:59,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2022-07-12 19:03:59,518 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 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) [2022-07-12 19:04:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:00,135 INFO L93 Difference]: Finished difference Result 238 states and 255 transitions. [2022-07-12 19:04:00,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:04:00,135 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 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 27 [2022-07-12 19:04:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:00,136 INFO L225 Difference]: With dead ends: 238 [2022-07-12 19:04:00,136 INFO L226 Difference]: Without dead ends: 238 [2022-07-12 19:04:00,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=282, Unknown=3, NotChecked=114, Total=506 [2022-07-12 19:04:00,137 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 392 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:00,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 614 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 454 Unchecked, 0.4s Time] [2022-07-12 19:04:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-12 19:04:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2022-07-12 19:04:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3666666666666667) internal successors, (164), 151 states have internal predecessors, (164), 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) [2022-07-12 19:04:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-07-12 19:04:00,139 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 27 [2022-07-12 19:04:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:00,139 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-07-12 19:04:00,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 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) [2022-07-12 19:04:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-07-12 19:04:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:04:00,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:00,143 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, 1] [2022-07-12 19:04:00,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-12 19:04:00,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:00,350 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:00,350 INFO L85 PathProgramCache]: Analyzing trace with hash -442882051, now seen corresponding path program 1 times [2022-07-12 19:04:00,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:00,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806155472] [2022-07-12 19:04:00,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:00,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:00,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:00,352 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:00,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 19:04:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:00,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:04:00,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:00,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:04:00,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:00,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806155472] [2022-07-12 19:04:00,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806155472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:04:00,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:04:00,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:04:00,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150198445] [2022-07-12 19:04:00,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:04:00,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:04:00,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:00,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:04:00,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:04:00,440 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2022-07-12 19:04:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:00,460 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2022-07-12 19:04:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:04:00,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-07-12 19:04:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:00,473 INFO L225 Difference]: With dead ends: 209 [2022-07-12 19:04:00,473 INFO L226 Difference]: Without dead ends: 209 [2022-07-12 19:04:00,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:04:00,474 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 52 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 236 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 [2022-07-12 19:04:00,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 236 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:04:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-12 19:04:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 169. [2022-07-12 19:04:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 168 states have internal predecessors, (181), 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) [2022-07-12 19:04:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2022-07-12 19:04:00,476 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 28 [2022-07-12 19:04:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:00,477 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2022-07-12 19:04:00,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2022-07-12 19:04:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2022-07-12 19:04:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:04:00,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:00,477 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:04:00,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:00,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:00,684 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549191, now seen corresponding path program 1 times [2022-07-12 19:04:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:00,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775072941] [2022-07-12 19:04:00,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:00,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:00,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:00,686 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:00,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 19:04:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:00,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 19:04:00,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:00,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:00,824 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:04:00,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-12 19:04:00,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:00,940 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:00,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:00,971 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:00,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:01,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:01,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:01,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 19:04:01,165 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 19:04:01,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (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_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 19:04:01,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:01,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-07-12 19:04:01,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:01,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 37 [2022-07-12 19:04:01,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-12 19:04:15,624 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:04:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:19,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:19,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775072941] [2022-07-12 19:04:19,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775072941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:19,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:19,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-12 19:04:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659692935] [2022-07-12 19:04:19,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:19,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 19:04:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:19,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 19:04:19,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=206, Unknown=5, NotChecked=96, Total=380 [2022-07-12 19:04:19,751 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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) [2022-07-12 19:04:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:20,202 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2022-07-12 19:04:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:04:20,202 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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 35 [2022-07-12 19:04:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:20,203 INFO L225 Difference]: With dead ends: 216 [2022-07-12 19:04:20,203 INFO L226 Difference]: Without dead ends: 216 [2022-07-12 19:04:20,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=118, Invalid=309, Unknown=5, NotChecked=120, Total=552 [2022-07-12 19:04:20,204 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 244 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 598 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:20,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 965 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 257 Invalid, 0 Unknown, 598 Unchecked, 0.3s Time] [2022-07-12 19:04:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-12 19:04:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2022-07-12 19:04:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 178 states have internal predecessors, (194), 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) [2022-07-12 19:04:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2022-07-12 19:04:20,207 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 35 [2022-07-12 19:04:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:20,207 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2022-07-12 19:04:20,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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) [2022-07-12 19:04:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2022-07-12 19:04:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:04:20,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:20,208 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:04:20,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-12 19:04:20,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:20,415 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549192, now seen corresponding path program 1 times [2022-07-12 19:04:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:20,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042315450] [2022-07-12 19:04:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:20,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:20,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:20,417 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:20,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 19:04:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:20,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 19:04:20,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:20,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,546 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:20,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,659 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:20,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:20,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,689 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:20,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:20,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:21,128 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 19:04:21,168 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-07-12 19:04:21,189 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2022-07-12 19:04:21,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:21,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:21,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:21,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-07-12 19:04:21,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-07-12 19:04:21,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:21,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 [2022-07-12 19:04:21,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:21,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-07-12 19:04:21,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:21,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 19 [2022-07-12 19:04:21,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:21,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 12 [2022-07-12 19:04:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:21,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:21,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042315450] [2022-07-12 19:04:21,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042315450] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:21,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:21,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-12 19:04:21,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177452012] [2022-07-12 19:04:21,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:21,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:04:21,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:21,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:04:21,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-12 19:04:21,397 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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) [2022-07-12 19:04:23,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:23,109 INFO L93 Difference]: Finished difference Result 303 states and 324 transitions. [2022-07-12 19:04:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:04:23,110 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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 35 [2022-07-12 19:04:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:23,115 INFO L225 Difference]: With dead ends: 303 [2022-07-12 19:04:23,115 INFO L226 Difference]: Without dead ends: 303 [2022-07-12 19:04:23,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=610, Unknown=3, NotChecked=162, Total=930 [2022-07-12 19:04:23,116 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 395 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:23,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 636 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 529 Invalid, 0 Unknown, 711 Unchecked, 1.1s Time] [2022-07-12 19:04:23,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-12 19:04:23,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 183. [2022-07-12 19:04:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 182 states have internal predecessors, (198), 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) [2022-07-12 19:04:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2022-07-12 19:04:23,120 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 35 [2022-07-12 19:04:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:23,121 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2022-07-12 19:04:23,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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) [2022-07-12 19:04:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2022-07-12 19:04:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:04:23,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:23,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:04:23,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:23,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:23,329 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1057065939, now seen corresponding path program 1 times [2022-07-12 19:04:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:23,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443165541] [2022-07-12 19:04:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:23,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:23,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:23,331 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:23,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 19:04:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:23,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:04:23,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:23,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:23,490 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:23,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:23,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:23,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:23,607 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:23,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-12 19:04:23,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:23,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 [2022-07-12 19:04:23,645 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:23,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 51 [2022-07-12 19:04:23,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 17 [2022-07-12 19:04:23,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-12 19:04:23,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 21 [2022-07-12 19:04:23,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-07-12 19:04:23,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:23,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:24,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 57 [2022-07-12 19:04:24,015 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:04:24,032 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.offset|)) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:04:24,040 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0)))) is different from false [2022-07-12 19:04:24,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:24,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 19:04:24,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:24,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-12 19:04:24,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-12 19:04:24,079 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:04:24,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 1 [2022-07-12 19:04:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:24,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:24,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443165541] [2022-07-12 19:04:24,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443165541] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:24,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:24,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-12 19:04:24,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807075351] [2022-07-12 19:04:24,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:24,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 19:04:24,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:24,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 19:04:24,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=336, Unknown=3, NotChecked=114, Total=506 [2022-07-12 19:04:24,181 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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) [2022-07-12 19:04:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:25,827 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2022-07-12 19:04:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 19:04:25,828 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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 38 [2022-07-12 19:04:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:25,828 INFO L225 Difference]: With dead ends: 301 [2022-07-12 19:04:25,828 INFO L226 Difference]: Without dead ends: 301 [2022-07-12 19:04:25,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=995, Unknown=4, NotChecked=204, Total=1406 [2022-07-12 19:04:25,829 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 403 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:25,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1301 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 857 Invalid, 0 Unknown, 523 Unchecked, 1.1s Time] [2022-07-12 19:04:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-12 19:04:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 182. [2022-07-12 19:04:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 181 states have internal predecessors, (196), 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) [2022-07-12 19:04:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2022-07-12 19:04:25,832 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 38 [2022-07-12 19:04:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:25,833 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2022-07-12 19:04:25,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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) [2022-07-12 19:04:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2022-07-12 19:04:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:04:25,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:25,833 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] [2022-07-12 19:04:25,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-12 19:04:26,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:26,041 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:26,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322345, now seen corresponding path program 1 times [2022-07-12 19:04:26,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:26,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522319414] [2022-07-12 19:04:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:26,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:26,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:26,043 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:26,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 19:04:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:26,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 19:04:26,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:26,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:26,200 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:04:26,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-12 19:04:26,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:26,309 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:26,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:26,335 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:26,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:26,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:26,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 20 [2022-07-12 19:04:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:26,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:26,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 19:04:26,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (_ bv1 1) (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:04:26,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (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_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 19:04:26,661 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:26,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-07-12 19:04:26,670 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:26,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 43 [2022-07-12 19:04:26,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-07-12 19:04:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:30,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:30,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522319414] [2022-07-12 19:04:30,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522319414] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:30,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:30,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-12 19:04:30,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946361222] [2022-07-12 19:04:30,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:30,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 19:04:30,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:30,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 19:04:30,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=242, Unknown=5, NotChecked=102, Total=420 [2022-07-12 19:04:30,913 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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) [2022-07-12 19:04:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:31,385 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-07-12 19:04:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:04:31,385 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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 40 [2022-07-12 19:04:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:31,386 INFO L225 Difference]: With dead ends: 218 [2022-07-12 19:04:31,386 INFO L226 Difference]: Without dead ends: 218 [2022-07-12 19:04:31,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=106, Invalid=321, Unknown=5, NotChecked=120, Total=552 [2022-07-12 19:04:31,387 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 232 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:31,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 686 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 887 Unchecked, 0.3s Time] [2022-07-12 19:04:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-12 19:04:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2022-07-12 19:04:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 201 states have internal predecessors, (226), 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) [2022-07-12 19:04:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2022-07-12 19:04:31,391 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 40 [2022-07-12 19:04:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:31,392 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2022-07-12 19:04:31,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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) [2022-07-12 19:04:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2022-07-12 19:04:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:04:31,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:31,393 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] [2022-07-12 19:04:31,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:31,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:31,610 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:31,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322346, now seen corresponding path program 1 times [2022-07-12 19:04:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:31,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299294356] [2022-07-12 19:04:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:31,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:31,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:31,612 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:31,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 19:04:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:31,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 19:04:31,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:31,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:31,740 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:31,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:31,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:31,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:31,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:31,849 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:31,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:31,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:31,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:31,880 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:31,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:31,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:32,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:32,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:32,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:32,346 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 19:04:32,380 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 19:04:32,398 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-12 19:04:32,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:32,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 [2022-07-12 19:04:32,430 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:32,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-07-12 19:04:32,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:32,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 55 [2022-07-12 19:04:32,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:32,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 81 [2022-07-12 19:04:32,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-07-12 19:04:32,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 58 [2022-07-12 19:04:33,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:33,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 28 [2022-07-12 19:04:33,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:33,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 39 [2022-07-12 19:04:33,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-12 19:04:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:35,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:35,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299294356] [2022-07-12 19:04:35,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299294356] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:35,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:35,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-12 19:04:35,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328705852] [2022-07-12 19:04:35,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:35,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:04:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:35,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:04:35,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-12 19:04:35,220 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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) [2022-07-12 19:04:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:36,518 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2022-07-12 19:04:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:04:36,519 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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 40 [2022-07-12 19:04:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:36,520 INFO L225 Difference]: With dead ends: 217 [2022-07-12 19:04:36,520 INFO L226 Difference]: Without dead ends: 217 [2022-07-12 19:04:36,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=164, Invalid=495, Unknown=3, NotChecked=150, Total=812 [2022-07-12 19:04:36,521 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 389 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 649 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:36,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 509 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 458 Invalid, 0 Unknown, 649 Unchecked, 0.8s Time] [2022-07-12 19:04:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-12 19:04:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2022-07-12 19:04:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 201 states have internal predecessors, (225), 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) [2022-07-12 19:04:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2022-07-12 19:04:36,534 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 40 [2022-07-12 19:04:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:36,534 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2022-07-12 19:04:36,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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) [2022-07-12 19:04:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2022-07-12 19:04:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:04:36,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:36,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:04:36,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-12 19:04:36,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:36,743 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:36,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash -466746806, now seen corresponding path program 1 times [2022-07-12 19:04:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:36,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228177009] [2022-07-12 19:04:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:36,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:36,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:36,745 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:36,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 19:04:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:36,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 19:04:36,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:36,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:36,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:04:36,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:04:36,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:36,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228177009] [2022-07-12 19:04:36,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228177009] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:36,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:36,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-12 19:04:36,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680649693] [2022-07-12 19:04:36,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:36,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:04:36,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:36,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:04:36,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:04:36,952 INFO L87 Difference]: Start difference. First operand 202 states and 225 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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) [2022-07-12 19:04:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:37,130 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2022-07-12 19:04:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:04:37,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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 41 [2022-07-12 19:04:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:37,131 INFO L225 Difference]: With dead ends: 229 [2022-07-12 19:04:37,132 INFO L226 Difference]: Without dead ends: 229 [2022-07-12 19:04:37,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:04:37,132 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 181 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:37,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 334 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:04:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-12 19:04:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2022-07-12 19:04:37,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 191 states have (on average 1.324607329842932) internal successors, (253), 222 states have internal predecessors, (253), 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) [2022-07-12 19:04:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-07-12 19:04:37,135 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 41 [2022-07-12 19:04:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:37,135 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-07-12 19:04:37,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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) [2022-07-12 19:04:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-07-12 19:04:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:04:37,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:37,136 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:04:37,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:37,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:37,336 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1696634608, now seen corresponding path program 1 times [2022-07-12 19:04:37,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:37,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217144191] [2022-07-12 19:04:37,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:37,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:37,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:37,339 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:37,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 19:04:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:37,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:04:37,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 19:04:37,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:04:37,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:37,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217144191] [2022-07-12 19:04:37,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217144191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:04:37,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:04:37,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:04:37,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595589683] [2022-07-12 19:04:37,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:04:37,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:04:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:37,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:04:37,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:04:37,453 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2022-07-12 19:04:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:37,483 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2022-07-12 19:04:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:04:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 41 [2022-07-12 19:04:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:37,484 INFO L225 Difference]: With dead ends: 283 [2022-07-12 19:04:37,484 INFO L226 Difference]: Without dead ends: 283 [2022-07-12 19:04:37,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:04:37,485 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 61 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 270 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:37,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 270 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:04:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-12 19:04:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 241. [2022-07-12 19:04:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.3014354066985645) internal successors, (272), 240 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) [2022-07-12 19:04:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2022-07-12 19:04:37,488 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 41 [2022-07-12 19:04:37,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:37,488 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2022-07-12 19:04:37,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2022-07-12 19:04:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2022-07-12 19:04:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:04:37,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:37,489 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:04:37,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:37,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:37,696 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1584201975, now seen corresponding path program 1 times [2022-07-12 19:04:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:37,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56930426] [2022-07-12 19:04:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:37,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:37,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:37,704 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:37,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 19:04:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:37,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 19:04:37,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:37,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:37,836 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:37,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:37,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:37,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:37,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:37,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:37,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:37,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:37,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:38,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-12 19:04:38,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-12 19:04:38,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-12 19:04:38,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:38,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 19:04:38,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:38,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-12 19:04:38,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-12 19:04:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:38,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:38,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56930426] [2022-07-12 19:04:38,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56930426] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:38,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:38,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-07-12 19:04:38,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332688807] [2022-07-12 19:04:38,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:38,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 19:04:38,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:38,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 19:04:38,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=130, Unknown=3, NotChecked=72, Total=240 [2022-07-12 19:04:38,122 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 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) [2022-07-12 19:04:38,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:38,951 INFO L93 Difference]: Finished difference Result 258 states and 284 transitions. [2022-07-12 19:04:38,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 19:04:38,951 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 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 42 [2022-07-12 19:04:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:38,952 INFO L225 Difference]: With dead ends: 258 [2022-07-12 19:04:38,952 INFO L226 Difference]: Without dead ends: 258 [2022-07-12 19:04:38,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=493, Unknown=3, NotChecked=150, Total=812 [2022-07-12 19:04:38,954 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 168 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:38,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 899 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 547 Invalid, 0 Unknown, 451 Unchecked, 0.6s Time] [2022-07-12 19:04:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-12 19:04:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2022-07-12 19:04:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 242 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) [2022-07-12 19:04:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 274 transitions. [2022-07-12 19:04:38,957 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 274 transitions. Word has length 42 [2022-07-12 19:04:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:38,957 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 274 transitions. [2022-07-12 19:04:38,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 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) [2022-07-12 19:04:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2022-07-12 19:04:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:04:38,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:38,958 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] [2022-07-12 19:04:38,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-12 19:04:39,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:39,177 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:39,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1471647316, now seen corresponding path program 1 times [2022-07-12 19:04:39,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:39,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408765597] [2022-07-12 19:04:39,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:39,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:39,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:39,179 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:39,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 19:04:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:39,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:04:39,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:39,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:04:39,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408765597] [2022-07-12 19:04:39,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408765597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:04:39,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:04:39,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:04:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316552114] [2022-07-12 19:04:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:04:39,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:04:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:39,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:04:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:04:39,299 INFO L87 Difference]: Start difference. First operand 243 states and 274 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2022-07-12 19:04:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:39,326 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2022-07-12 19:04:39,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:04:39,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2022-07-12 19:04:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:39,328 INFO L225 Difference]: With dead ends: 256 [2022-07-12 19:04:39,328 INFO L226 Difference]: Without dead ends: 256 [2022-07-12 19:04:39,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:04:39,328 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 46 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:39,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 357 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:04:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-12 19:04:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 237. [2022-07-12 19:04:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 205 states have (on average 1.273170731707317) internal successors, (261), 236 states have internal predecessors, (261), 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) [2022-07-12 19:04:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 261 transitions. [2022-07-12 19:04:39,332 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 261 transitions. Word has length 42 [2022-07-12 19:04:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:39,332 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 261 transitions. [2022-07-12 19:04:39,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2022-07-12 19:04:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 261 transitions. [2022-07-12 19:04:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:04:39,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:39,333 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:04:39,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:39,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:39,547 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:39,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1095816814, now seen corresponding path program 1 times [2022-07-12 19:04:39,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:39,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418219331] [2022-07-12 19:04:39,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:39,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:39,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:39,549 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:39,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 19:04:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:39,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 19:04:39,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:39,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:39,708 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:39,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:39,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:39,809 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:39,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:39,832 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:39,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:39,880 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:39,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:39,917 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:04:39,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-12 19:04:40,042 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:04:40,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 48 [2022-07-12 19:04:40,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-07-12 19:04:40,134 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:04:40,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 55 [2022-07-12 19:04:40,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:40,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:40,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:04:40,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:04:40,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (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_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:04:40,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (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_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:04:40,374 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:40,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 21 [2022-07-12 19:04:40,382 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2022-07-12 19:04:40,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2022-07-12 19:04:40,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.offset_75| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |v_ULTIMATE.start_main_~item~0#1.offset_75|))) (or (not (= (_ bv0 32) (select (select (store (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_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select |c_#valid| .cse0) (_ bv0 1)))))) is different from false [2022-07-12 19:04:40,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:40,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 25 [2022-07-12 19:04:40,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:40,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 76 [2022-07-12 19:04:40,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:40,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 65 [2022-07-12 19:04:40,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-07-12 19:04:40,485 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:04:40,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-12 19:04:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 19:04:40,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:40,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418219331] [2022-07-12 19:04:40,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418219331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:40,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:40,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-07-12 19:04:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625779116] [2022-07-12 19:04:40,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:40,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 19:04:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:40,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 19:04:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=274, Unknown=10, NotChecked=280, Total=650 [2022-07-12 19:04:40,621 INFO L87 Difference]: Start difference. First operand 237 states and 261 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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) [2022-07-12 19:04:41,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:41,591 INFO L93 Difference]: Finished difference Result 294 states and 322 transitions. [2022-07-12 19:04:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:04:41,592 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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 42 [2022-07-12 19:04:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:41,593 INFO L225 Difference]: With dead ends: 294 [2022-07-12 19:04:41,593 INFO L226 Difference]: Without dead ends: 294 [2022-07-12 19:04:41,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=648, Unknown=11, NotChecked=420, Total=1260 [2022-07-12 19:04:41,594 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 253 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1334 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:41,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 955 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 441 Invalid, 0 Unknown, 1334 Unchecked, 0.5s Time] [2022-07-12 19:04:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-12 19:04:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 259. [2022-07-12 19:04:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 227 states have (on average 1.251101321585903) internal successors, (284), 258 states have internal predecessors, (284), 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) [2022-07-12 19:04:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 284 transitions. [2022-07-12 19:04:41,598 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 284 transitions. Word has length 42 [2022-07-12 19:04:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:41,599 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 284 transitions. [2022-07-12 19:04:41,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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) [2022-07-12 19:04:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 284 transitions. [2022-07-12 19:04:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:04:41,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:41,600 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] [2022-07-12 19:04:41,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:41,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:41,810 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1865620530, now seen corresponding path program 1 times [2022-07-12 19:04:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:41,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373864702] [2022-07-12 19:04:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:41,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:41,812 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:41,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 19:04:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:41,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 19:04:41,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:41,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:41,978 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:41,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:42,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:42,077 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:42,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:42,097 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:42,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:42,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:42,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:42,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_805 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:04:42,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_805 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (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_805) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:04:42,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:42,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 19:04:42,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:42,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-12 19:04:42,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-12 19:04:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:42,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:42,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373864702] [2022-07-12 19:04:42,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373864702] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:42,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:42,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-07-12 19:04:42,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919232933] [2022-07-12 19:04:42,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:42,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 19:04:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:42,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 19:04:42,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=190, Unknown=11, NotChecked=58, Total=306 [2022-07-12 19:04:42,509 INFO L87 Difference]: Start difference. First operand 259 states and 284 transitions. Second operand has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 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) [2022-07-12 19:04:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:43,578 INFO L93 Difference]: Finished difference Result 265 states and 286 transitions. [2022-07-12 19:04:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:04:43,578 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 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 [2022-07-12 19:04:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:43,579 INFO L225 Difference]: With dead ends: 265 [2022-07-12 19:04:43,579 INFO L226 Difference]: Without dead ends: 265 [2022-07-12 19:04:43,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=594, Unknown=11, NotChecked=110, Total=930 [2022-07-12 19:04:43,579 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 551 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:43,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 683 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 485 Invalid, 0 Unknown, 395 Unchecked, 0.6s Time] [2022-07-12 19:04:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-12 19:04:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 260. [2022-07-12 19:04:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.25) internal successors, (285), 259 states have internal predecessors, (285), 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) [2022-07-12 19:04:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2022-07-12 19:04:43,583 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 43 [2022-07-12 19:04:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:43,583 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2022-07-12 19:04:43,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 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) [2022-07-12 19:04:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2022-07-12 19:04:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:04:43,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:43,584 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] [2022-07-12 19:04:43,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:43,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:43,791 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1999661141, now seen corresponding path program 1 times [2022-07-12 19:04:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:43,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214359168] [2022-07-12 19:04:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:43,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:43,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:43,793 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:43,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 19:04:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:43,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:04:43,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:04:43,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:04:43,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:43,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214359168] [2022-07-12 19:04:43,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214359168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:04:43,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:04:43,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:04:43,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446324507] [2022-07-12 19:04:43,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:04:43,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:04:43,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:43,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:04:43,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:04:43,899 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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) [2022-07-12 19:04:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:44,055 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2022-07-12 19:04:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:04:44,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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 [2022-07-12 19:04:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:44,056 INFO L225 Difference]: With dead ends: 260 [2022-07-12 19:04:44,056 INFO L226 Difference]: Without dead ends: 260 [2022-07-12 19:04:44,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:04:44,056 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 109 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:44,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 172 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:04:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-12 19:04:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2022-07-12 19:04:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 222 states have (on average 1.2522522522522523) internal successors, (278), 252 states have internal predecessors, (278), 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) [2022-07-12 19:04:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 278 transitions. [2022-07-12 19:04:44,059 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 278 transitions. Word has length 44 [2022-07-12 19:04:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:44,059 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 278 transitions. [2022-07-12 19:04:44,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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) [2022-07-12 19:04:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 278 transitions. [2022-07-12 19:04:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:04:44,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:44,060 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:04:44,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:44,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:44,260 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:04:44,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash -433899271, now seen corresponding path program 1 times [2022-07-12 19:04:44,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:44,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310194112] [2022-07-12 19:04:44,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:44,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:44,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:44,262 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:04:44,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 19:04:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:44,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:04:44,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:44,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:44,419 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:44,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:44,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:44,502 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:04:44,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:04:44,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 19:04:44,572 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-12 19:04:44,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 70 [2022-07-12 19:04:44,585 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-12 19:04:44,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-07-12 19:04:44,881 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 19:04:44,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 36 [2022-07-12 19:04:44,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-12 19:04:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:44,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:59,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:59,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2809 treesize of output 1959 [2022-07-12 19:05:41,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:41,434 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:05:41,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 57 [2022-07-12 19:05:43,511 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (let ((.cse0 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse203 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse203 (store (store (select |c_#memory_$Pointer$.base| .cse203) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse1 (not .cse8)) (.cse21 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse202 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse202 (select (select (store |c_#memory_$Pointer$.base| .cse202 (store (store (select |c_#memory_$Pointer$.base| .cse202) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse11 (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse201 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse201 (store (store (select |c_#memory_$Pointer$.base| .cse201) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (let ((.cse2 (= (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (.cse3 (and .cse21 .cse11)) (.cse9 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse199 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse200 (select (select (store |c_#memory_$Pointer$.base| .cse199 (store (store (select |c_#memory_$Pointer$.base| .cse199) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (= .cse199 .cse200) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse200)))))) (.cse15 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse198 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse198 (store (store (select |c_#memory_$Pointer$.base| .cse198) |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse198)))) (.cse23 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse197 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse197 (select (select (store |c_#memory_$Pointer$.base| .cse197 (store (store (select |c_#memory_$Pointer$.base| .cse197) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16)))) (.cse24 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse196 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse196 (select (select (store |c_#memory_$Pointer$.base| .cse196 (store (store (select |c_#memory_$Pointer$.base| .cse196) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse4 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse10 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse194 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse195 (select (select (store |c_#memory_$Pointer$.base| .cse194 (store (store (select |c_#memory_$Pointer$.base| .cse194) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse194 .cse195) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse195)))))))) (.cse20 (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32))) (.cse19 (or .cse0 .cse1)) (.cse27 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse193 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse193 (select (select (store |c_#memory_$Pointer$.base| .cse193 (store (store (select |c_#memory_$Pointer$.base| .cse193) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32))))) (.cse28 (or (and .cse0 .cse21) .cse1)) (.cse7 (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse12 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse1 .cse2) (or .cse4 (forall ((v_ArrVal_883 (_ BitVec 32)) (v_arrayElimCell_140 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32))) (= (select (let ((.cse5 (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse6 (store (store (select |c_#memory_$Pointer$.base| .cse6) v_arrayElimCell_141 (_ bv0 32)) (bvadd v_arrayElimCell_141 (_ bv4 32)) v_ArrVal_883))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) v_arrayElimCell_140) (_ bv0 32)))) .cse7 (or .cse8 .cse9) .cse10 (or .cse11 .cse1 .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| .cse14 (store (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse14 .cse13))))))) (or (and (or .cse3 .cse1) (or .cse1 (and .cse15 (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))))) .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| .cse17 (store (store (select |c_#memory_$Pointer$.base| .cse17) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 .cse18) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse18))))))) .cse19 .cse1 (or .cse1 (and .cse0 .cse11)) .cse9 (or .cse20 (and (or .cse1 .cse15) (or .cse21 .cse1) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse22 (select (select (store |c_#memory_$Pointer$.base| .cse22 (store (store (select |c_#memory_$Pointer$.base| .cse22) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse23 .cse24)) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| .cse25 (store (store (select |c_#memory_$Pointer$.base| .cse25) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse25 .cse26) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse26))))))) .cse23 .cse27 (or .cse20 .cse1) .cse28 .cse24 (or .cse4 (let ((.cse80 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse190 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse190 (store (store (select |c_#memory_$Pointer$.base| .cse190) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse52 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse189 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse189 (store (store (select |c_#memory_$Pointer$.base| .cse189) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (let ((.cse43 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (let ((.cse188 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse188 (select (select (store |c_#memory_$Pointer$.base| .cse188 (store (store (select |c_#memory_$Pointer$.base| .cse188) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse38 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse187 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse187 (store (store (select |c_#memory_$Pointer$.base| .cse187) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse74 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse186 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse186 (store (store (select |c_#memory_$Pointer$.base| .cse186) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse185 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse184 (select (select (store |c_#memory_$Pointer$.base| .cse185 (store (store (select |c_#memory_$Pointer$.base| .cse185) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse184) (= .cse185 .cse184)))))) (.cse76 (or .cse52 .cse12)) (.cse111 (or .cse80 .cse12)) (.cse46 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse183 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse182 (select (select (store |c_#memory_$Pointer$.base| .cse183 (store (store (select |c_#memory_$Pointer$.base| .cse183) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse182) (= .cse183 .cse182))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse100 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse180 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse180 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse181 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse181 (store (store (select |c_#memory_$Pointer$.base| .cse181) v_arrayElimCell_136 (_ bv0 32)) .cse180 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse58 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse179 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse179 (store (store (select |c_#memory_$Pointer$.base| .cse179) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse99 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse178 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse177 (select (select (store |c_#memory_$Pointer$.base| .cse178 (store (store (select |c_#memory_$Pointer$.base| .cse178) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse177) (= .cse178 .cse177)))))))) (.cse112 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse175 (select (select (let ((.cse176 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse176 (store (store (select |c_#memory_$Pointer$.base| .cse176) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse175) (= .cse175 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (.cse68 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse173 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse172 (select (select (let ((.cse174 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse174 (store (store (select |c_#memory_$Pointer$.base| .cse174) v_arrayElimCell_136 (_ bv0 32)) .cse173 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse172) (= .cse173 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse172 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse81 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse171 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse170 (select (select (store |c_#memory_$Pointer$.base| .cse171 (store (store (select |c_#memory_$Pointer$.base| .cse171) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse170 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse171 .cse170))))))) (.cse118 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse169 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse169 (store (store (select |c_#memory_$Pointer$.base| .cse169) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse75 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse166 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse168 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse167 (select (select (store |c_#memory_$Pointer$.base| .cse166 (store (store (select |c_#memory_$Pointer$.base| .cse166) v_arrayElimCell_136 (_ bv0 32)) .cse168 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse166 .cse167) (= .cse168 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse167 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse82 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse164 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse164 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse165 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse165 (store (store (select |c_#memory_$Pointer$.base| .cse165) v_arrayElimCell_136 (_ bv0 32)) .cse164 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse53 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse162 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse163 (select (select (store |c_#memory_$Pointer$.base| .cse162 (store (store (select |c_#memory_$Pointer$.base| .cse162) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse162 .cse163) (= .cse163 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse44 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse160 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse161 (select (select (store |c_#memory_$Pointer$.base| .cse160 (store (store (select |c_#memory_$Pointer$.base| .cse160) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse160 .cse161) (= .cse161 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse113 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse159 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse159 (store (store (select |c_#memory_$Pointer$.base| .cse159) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse117 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse156 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse158 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse157 (select (select (store |c_#memory_$Pointer$.base| .cse156 (store (store (select |c_#memory_$Pointer$.base| .cse156) v_arrayElimCell_136 (_ bv0 32)) .cse158 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse156 .cse157) (= .cse158 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse157 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse29 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse155 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse155 (select (select (store |c_#memory_$Pointer$.base| .cse155 (store (store (select |c_#memory_$Pointer$.base| .cse155) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse115 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse154 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse154 (select (select (store |c_#memory_$Pointer$.base| .cse154 (store (store (select |c_#memory_$Pointer$.base| .cse154) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16)))) (.cse31 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse152 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$.base| .cse152 (store (store (select |c_#memory_$Pointer$.base| .cse152) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse152 .cse153) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse153 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse107 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse151 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse150 (select (select (store |c_#memory_$Pointer$.base| .cse151 (store (store (select |c_#memory_$Pointer$.base| .cse151) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse150) (= .cse151 .cse150) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse148 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse149 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse149 (select (select (store |c_#memory_$Pointer$.base| .cse149 (store (store (select |c_#memory_$Pointer$.base| .cse149) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (and (or .cse29 .cse8) .cse30 .cse31 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse34 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| .cse32 (store (store (select |c_#memory_$Pointer$.base| .cse32) v_arrayElimCell_136 (_ bv0 32)) .cse34 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse32 .cse33)) (= .cse34 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse33 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse37 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) .cse37 (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse35 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse36 .cse35)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse37))))) .cse20 .cse38 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse39 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse39 (select (select (store |c_#memory_$Pointer$.base| .cse39 (store (store (select |c_#memory_$Pointer$.base| .cse39) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse41 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse40 (select (select (let ((.cse42 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse42 (store (store (select |c_#memory_$Pointer$.base| .cse42) v_arrayElimCell_136 (_ bv0 32)) .cse41 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse40) (= .cse41 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse40 |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse12 .cse43) (or (and .cse11 .cse44) .cse1) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse45 (store (store (select |c_#memory_$Pointer$.base| .cse45) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse46 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse47 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse49 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse48 (select (select (store |c_#memory_$Pointer$.base| .cse47 (store (store (select |c_#memory_$Pointer$.base| .cse47) v_arrayElimCell_136 (_ bv0 32)) .cse49 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse47 .cse48) (= .cse49 (_ bv0 32)) (= .cse48 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse50 (select (select (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse50) (= .cse50 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (or .cse8 (and .cse52 .cse53)) .cse10 (or .cse20 (let ((.cse54 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse57 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse57 (select (select (store |c_#memory_$Pointer$.base| .cse57 (store (store (select |c_#memory_$Pointer$.base| .cse57) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and .cse54 (or .cse54 .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse56 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse55 (select (select (store |c_#memory_$Pointer$.base| .cse56 (store (store (select |c_#memory_$Pointer$.base| .cse56) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse55) (= .cse56 .cse55))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) .cse43))) .cse58 (or .cse53 .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse60 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse59 (select (select (store |c_#memory_$Pointer$.base| .cse60 (store (store (select |c_#memory_$Pointer$.base| .cse60) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse59) (= .cse60 .cse59))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse62 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse61 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse61 (store (store (select |c_#memory_$Pointer$.base| .cse61) v_arrayElimCell_136 (_ bv0 32)) .cse62 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse62 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse64 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse63 (store (store (select |c_#memory_$Pointer$.base| .cse63) v_arrayElimCell_136 (_ bv0 32)) .cse64 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse64) (= .cse64 (_ bv0 32))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse65 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse65 (store (store (select |c_#memory_$Pointer$.base| .cse65) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse67 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse66 (select (select (store |c_#memory_$Pointer$.base| .cse67 (store (store (select |c_#memory_$Pointer$.base| .cse67) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse66) (not (= .cse67 .cse66)))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or .cse8 .cse68) .cse19 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse70 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse71 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse69 (select (select (store |c_#memory_$Pointer$.base| .cse70 (store (store (select |c_#memory_$Pointer$.base| .cse70) v_arrayElimCell_136 (_ bv0 32)) .cse71 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse69) (= .cse70 .cse69) (= .cse71 (_ bv0 32)))))) .cse1 (or .cse8 (and (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse72 (select (select (let ((.cse73 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse73 (store (store (select |c_#memory_$Pointer$.base| .cse73) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse72) (= .cse72 |c_ULTIMATE.start_main_~item~0#1.base|)))))) .cse74)) (or .cse75 .cse8) .cse76 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse78 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse77 (select (select (store |c_#memory_$Pointer$.base| .cse78 (store (store (select |c_#memory_$Pointer$.base| .cse78) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse77) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (= .cse78 .cse77)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse79 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse79 (store (store (select |c_#memory_$Pointer$.base| .cse79) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse80 (or .cse8 .cse53) (or .cse12 (and .cse29 .cse1 .cse81)) (or .cse8 .cse82) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse84 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse83 (select (select (store |c_#memory_$Pointer$.base| .cse84 (store (store (select |c_#memory_$Pointer$.base| .cse84) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse83) (= .cse84 .cse83))))) (or .cse8 (and .cse38 .cse29)) .cse52 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse85 (select (select (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse85) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (= .cse86 .cse85)) (= (_ bv4 32) v_arrayElimIndex_16))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse88 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse87 (select (select (store |c_#memory_$Pointer$.base| .cse88 (store (store (select |c_#memory_$Pointer$.base| .cse88) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse87) (not (= .cse88 .cse87)))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or .cse8 (and .cse75 .cse82)) (or .cse8 .cse52) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse90 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse91 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse89 (select (select (store |c_#memory_$Pointer$.base| .cse90 (store (store (select |c_#memory_$Pointer$.base| .cse90) v_arrayElimCell_136 (_ bv0 32)) .cse91 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse89) (= .cse90 .cse89) (= .cse91 |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse74 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse92 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse92 (store (store (select |c_#memory_$Pointer$.base| .cse92) (_ bv4294967292 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse94 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse95 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse93 (select (select (store |c_#memory_$Pointer$.base| .cse94 (store (store (select |c_#memory_$Pointer$.base| .cse94) v_arrayElimCell_136 (_ bv0 32)) .cse95 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse93) (= .cse94 .cse93) (= .cse95 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse96 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse96 (select (select (store |c_#memory_$Pointer$.base| .cse96 (store (store (select |c_#memory_$Pointer$.base| .cse96) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse82 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse98 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (let ((.cse97 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse97 (select (select (store |c_#memory_$Pointer$.base| .cse97 (store (store (select |c_#memory_$Pointer$.base| .cse97) v_arrayElimCell_136 (_ bv0 32)) .cse98 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse98 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse99 .cse100 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse102 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse103 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse101 (select (select (store |c_#memory_$Pointer$.base| .cse102 (store (store (select |c_#memory_$Pointer$.base| .cse102) v_arrayElimCell_136 (_ bv0 32)) .cse103 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse101) (= .cse102 .cse101) (= .cse103 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (let ((.cse104 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse104 (select (select (store |c_#memory_$Pointer$.base| .cse104 (store (store (select |c_#memory_$Pointer$.base| .cse104) v_arrayElimCell_136 (_ bv0 32)) .cse105 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= .cse105 (_ bv0 32))))) .cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse106 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse106 (select (select (store |c_#memory_$Pointer$.base| .cse106 (store (store (select |c_#memory_$Pointer$.base| .cse106) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse107) .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse109 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse108 (select (select (store |c_#memory_$Pointer$.base| .cse109 (store (store (select |c_#memory_$Pointer$.base| .cse109) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse108) (= .cse109 .cse108) (= .cse108 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse110 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse110 (select (select (store |c_#memory_$Pointer$.base| .cse110 (store (store (select |c_#memory_$Pointer$.base| .cse110) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (or .cse8 (and .cse76 .cse52 .cse111 .cse112 .cse68 .cse113)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse114 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse114 (store (store (select |c_#memory_$Pointer$.base| .cse114) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse53 .cse111 (or .cse8 .cse115) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse116 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse116 (store (store (select |c_#memory_$Pointer$.base| .cse116) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (or (and .cse31 .cse75 .cse80 .cse52 .cse82 .cse100 .cse53 .cse117) .cse8) (or .cse8 (and .cse46 .cse118)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse119 (select (select (let ((.cse120 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse120 (store (store (select |c_#memory_$Pointer$.base| .cse120) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse119) (= .cse119 |c_ULTIMATE.start_main_~item~0#1.base|)))) (or .cse8 (and .cse100 .cse117)) (or .cse8 (and .cse58 .cse99)) .cse27 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse122 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse123 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse121 (select (select (store |c_#memory_$Pointer$.base| .cse122 (store (store (select |c_#memory_$Pointer$.base| .cse122) v_arrayElimCell_136 (_ bv0 32)) .cse123 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse121) (= .cse122 .cse121) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse123 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse124 (select (select (let ((.cse125 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse125 (store (store (select |c_#memory_$Pointer$.base| .cse125) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse124) (= .cse124 |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse112 .cse68 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse127 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse126 (store (store (select |c_#memory_$Pointer$.base| .cse126) v_arrayElimCell_136 (_ bv0 32)) .cse127 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse127 (_ bv0 32))))) .cse28 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse128 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse128 (store (store (select |c_#memory_$Pointer$.base| .cse128) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse81 .cse12 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse130 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse129 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse129 (store (store (select |c_#memory_$Pointer$.base| .cse129) v_arrayElimCell_136 (_ bv0 32)) .cse130 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse130 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse118 (or .cse8 (and .cse75 .cse52 .cse82 .cse53)) (or (and (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse131 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse131 (select (select (store |c_#memory_$Pointer$.base| .cse131 (store (store (select |c_#memory_$Pointer$.base| .cse131) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse7 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse132 (select (select (let ((.cse133 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse133 (store (store (select |c_#memory_$Pointer$.base| .cse133) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse132 |c_ULTIMATE.start_main_~item~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse132)))) .cse11 .cse44 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) .cse1 .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse134 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse135 (select (select (store |c_#memory_$Pointer$.base| .cse134 (store (store (select |c_#memory_$Pointer$.base| .cse134) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse134 .cse135)) (= .cse135 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse137 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse138 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse136 (select (select (store |c_#memory_$Pointer$.base| .cse137 (store (store (select |c_#memory_$Pointer$.base| .cse137) v_arrayElimCell_136 (_ bv0 32)) .cse138 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse136) (= .cse137 .cse136) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse138) (= .cse138 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse139 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse139 (_ bv0 32)) (= (select (select (let ((.cse140 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse140 (store (store (select |c_#memory_$Pointer$.base| .cse140) v_arrayElimCell_136 (_ bv0 32)) .cse139 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (or .cse12 (and .cse80 .cse52)) .cse113 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse142 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse143 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse141 (select (select (store |c_#memory_$Pointer$.base| .cse142 (store (store (select |c_#memory_$Pointer$.base| .cse142) v_arrayElimCell_136 (_ bv0 32)) .cse143 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse141) (= .cse142 .cse141) (= .cse143 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse141 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse117 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse145 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse144 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse144 (store (store (select |c_#memory_$Pointer$.base| .cse144) v_arrayElimCell_136 (_ bv0 32)) .cse145 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse145 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and .cse29 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse146 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse146 (select (select (store |c_#memory_$Pointer$.base| .cse146 (store (store (select |c_#memory_$Pointer$.base| .cse146) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (let ((.cse147 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse147 (select (select (store |c_#memory_$Pointer$.base| .cse147 (store (store (select |c_#memory_$Pointer$.base| .cse147) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) .cse148 .cse115) .cse12) (or .cse8 (and .cse31 .cse80)) .cse107 (or .cse8 .cse148))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse192 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse191 (select (select (store |c_#memory_$Pointer$.base| .cse192 (store (store (select |c_#memory_$Pointer$.base| .cse192) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse191 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse192 .cse191) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse191))))))))) is different from true [2022-07-12 19:05:48,281 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse93 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse134 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse134 (select (select (store |c_#memory_$Pointer$.base| .cse134 (store (store (select |c_#memory_$Pointer$.base| .cse134) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)))))) (and (or .cse0 (forall ((v_ArrVal_883 (_ BitVec 32)) (v_arrayElimCell_140 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32))) (= (select (let ((.cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (store (select |c_#memory_$Pointer$.base| .cse2) v_arrayElimCell_141 (_ bv0 32)) (bvadd v_arrayElimCell_141 (_ bv4 32)) v_ArrVal_883))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) v_arrayElimCell_140) (_ bv0 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| .cse3 (store (store (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse3 .cse4) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse4))))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| .cse6 (store (store (select |c_#memory_$Pointer$.base| .cse6) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse6 .cse5))))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| .cse7 (store (store (select |c_#memory_$Pointer$.base| .cse7) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 .cse8) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse8))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| .cse9 (store (store (select |c_#memory_$Pointer$.base| .cse9) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (= .cse9 .cse10) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse10))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.base| .cse11 (store (store (select |c_#memory_$Pointer$.base| .cse11) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 .cse12) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse12))))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse13 (select (select (store |c_#memory_$Pointer$.base| .cse13 (store (store (select |c_#memory_$Pointer$.base| .cse13) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (or .cse0 (and (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse14 (select (select (store |c_#memory_$Pointer$.base| .cse14 (store (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse15) (= .cse16 .cse15))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| .cse17 (store (store (select |c_#memory_$Pointer$.base| .cse17) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 .cse18) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse18 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse21 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| .cse19 (store (store (select |c_#memory_$Pointer$.base| .cse19) v_arrayElimCell_136 (_ bv0 32)) .cse21 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse19 .cse20)) (= .cse21 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse20 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse24 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse22 (select (select (store |c_#memory_$Pointer$.base| .cse23 (store (store (select |c_#memory_$Pointer$.base| .cse23) .cse24 (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse23 .cse22)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse24))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse27 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| .cse26 (store (store (select |c_#memory_$Pointer$.base| .cse26) v_arrayElimCell_136 (_ bv0 32)) .cse27 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse25) (= .cse26 .cse25) (= .cse27 (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse28 (store (store (select |c_#memory_$Pointer$.base| .cse28) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse30 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse29 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse29 (store (store (select |c_#memory_$Pointer$.base| .cse29) v_arrayElimCell_136 (_ bv0 32)) .cse30 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse30 (_ bv0 32))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse31 (select (select (store |c_#memory_$Pointer$.base| .cse31 (store (store (select |c_#memory_$Pointer$.base| .cse31) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse33 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse32 (select (select (let ((.cse34 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse34 (store (store (select |c_#memory_$Pointer$.base| .cse34) v_arrayElimCell_136 (_ bv0 32)) .cse33 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse32) (= .cse33 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse32 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse35) (= .cse36 .cse35))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse37 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse39 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| .cse37 (store (store (select |c_#memory_$Pointer$.base| .cse37) v_arrayElimCell_136 (_ bv0 32)) .cse39 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse37 .cse38) (= .cse39 (_ bv0 32)) (= .cse38 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse40 (store (store (select |c_#memory_$Pointer$.base| .cse40) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse41 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse41 (select (select (store |c_#memory_$Pointer$.base| .cse41 (store (store (select |c_#memory_$Pointer$.base| .cse41) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse42 (select (select (store |c_#memory_$Pointer$.base| .cse43 (store (store (select |c_#memory_$Pointer$.base| .cse43) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse42) (= .cse43 .cse42))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse45 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse44 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse44 (store (store (select |c_#memory_$Pointer$.base| .cse44) v_arrayElimCell_136 (_ bv0 32)) .cse45 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse45 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse46 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse46 (select (select (store |c_#memory_$Pointer$.base| .cse46 (store (store (select |c_#memory_$Pointer$.base| .cse46) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse47 (select (select (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse48 (store (store (select |c_#memory_$Pointer$.base| .cse48) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse47) (= .cse47 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse49 (store (store (select |c_#memory_$Pointer$.base| .cse49) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse50 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse50 (select (select (store |c_#memory_$Pointer$.base| .cse50 (store (store (select |c_#memory_$Pointer$.base| .cse50) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse53 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse54 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.base| .cse53 (store (store (select |c_#memory_$Pointer$.base| .cse53) v_arrayElimCell_136 (_ bv0 32)) .cse54 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse52) (= .cse53 .cse52) (= .cse54 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse55 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse57 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse56 (select (select (store |c_#memory_$Pointer$.base| .cse55 (store (store (select |c_#memory_$Pointer$.base| .cse55) v_arrayElimCell_136 (_ bv0 32)) .cse57 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse55 .cse56) (= .cse57 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse56 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse58 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse58 (select (select (store |c_#memory_$Pointer$.base| .cse58 (store (store (select |c_#memory_$Pointer$.base| .cse58) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse59 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse59 (store (store (select |c_#memory_$Pointer$.base| .cse59) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse60 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse60 (store (store (select |c_#memory_$Pointer$.base| .cse60) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse62 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse61 (select (select (store |c_#memory_$Pointer$.base| .cse62 (store (store (select |c_#memory_$Pointer$.base| .cse62) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse61) (= .cse62 .cse61))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse63 (store (store (select |c_#memory_$Pointer$.base| .cse63) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse64 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse64 (store (store (select |c_#memory_$Pointer$.base| .cse64) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse66 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse67 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse65 (select (select (store |c_#memory_$Pointer$.base| .cse66 (store (store (select |c_#memory_$Pointer$.base| .cse66) v_arrayElimCell_136 (_ bv0 32)) .cse67 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse65) (= .cse66 .cse65) (= .cse67 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse68 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse68 (store (store (select |c_#memory_$Pointer$.base| .cse68) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse69 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse69 (store (store (select |c_#memory_$Pointer$.base| .cse69) (_ bv4294967292 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse71 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse72 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| .cse71 (store (store (select |c_#memory_$Pointer$.base| .cse71) v_arrayElimCell_136 (_ bv0 32)) .cse72 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse70) (= .cse71 .cse70) (= .cse72 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse73 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse73 (select (select (store |c_#memory_$Pointer$.base| .cse73 (store (store (select |c_#memory_$Pointer$.base| .cse73) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse74 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse74 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse75 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse75 (store (store (select |c_#memory_$Pointer$.base| .cse75) v_arrayElimCell_136 (_ bv0 32)) .cse74 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse77 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (let ((.cse76 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse76 (select (select (store |c_#memory_$Pointer$.base| .cse76 (store (store (select |c_#memory_$Pointer$.base| .cse76) v_arrayElimCell_136 (_ bv0 32)) .cse77 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse77 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse79 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse78 (select (select (store |c_#memory_$Pointer$.base| .cse79 (store (store (select |c_#memory_$Pointer$.base| .cse79) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse78) (= .cse79 .cse78))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse80 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse80 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse81 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse81 (store (store (select |c_#memory_$Pointer$.base| .cse81) v_arrayElimCell_136 (_ bv0 32)) .cse80 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse83 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse84 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse82 (select (select (store |c_#memory_$Pointer$.base| .cse83 (store (store (select |c_#memory_$Pointer$.base| .cse83) v_arrayElimCell_136 (_ bv0 32)) .cse84 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse82) (= .cse83 .cse82) (= .cse84 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse85 (select (select (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse85) (= .cse86 .cse85) (= .cse85 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse87 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse87 (store (store (select |c_#memory_$Pointer$.base| .cse87) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse88 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse89 (select (select (store |c_#memory_$Pointer$.base| .cse88 (store (store (select |c_#memory_$Pointer$.base| .cse88) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse88 .cse89) (= .cse89 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse90 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse90 (store (store (select |c_#memory_$Pointer$.base| .cse90) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse91 (select (select (let ((.cse92 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse92 (store (store (select |c_#memory_$Pointer$.base| .cse92) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse91) (= .cse91 |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse93 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse95 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse96 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse94 (select (select (store |c_#memory_$Pointer$.base| .cse95 (store (store (select |c_#memory_$Pointer$.base| .cse95) v_arrayElimCell_136 (_ bv0 32)) .cse96 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse94) (= .cse95 .cse94) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse96 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse97 (select (select (let ((.cse98 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse98 (store (store (select |c_#memory_$Pointer$.base| .cse98) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse97) (= .cse97 |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse99 (select (select (let ((.cse100 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse100 (store (store (select |c_#memory_$Pointer$.base| .cse100) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse99) (= .cse99 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse102 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse101 (select (select (let ((.cse103 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse103 (store (store (select |c_#memory_$Pointer$.base| .cse103) v_arrayElimCell_136 (_ bv0 32)) .cse102 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse101) (= .cse102 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse101 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse104 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse104 (store (store (select |c_#memory_$Pointer$.base| .cse104) v_arrayElimCell_136 (_ bv0 32)) .cse105 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse105 (_ bv0 32))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse107 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse106 (select (select (store |c_#memory_$Pointer$.base| .cse107 (store (store (select |c_#memory_$Pointer$.base| .cse107) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse106 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse107 .cse106)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse109 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse108 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse108 (store (store (select |c_#memory_$Pointer$.base| .cse108) v_arrayElimCell_136 (_ bv0 32)) .cse109 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse109 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (let ((.cse110 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse110 (select (select (store |c_#memory_$Pointer$.base| .cse110 (store (store (select |c_#memory_$Pointer$.base| .cse110) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse111 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse111 (select (select (store |c_#memory_$Pointer$.base| .cse111 (store (store (select |c_#memory_$Pointer$.base| .cse111) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse112 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse112 (store (store (select |c_#memory_$Pointer$.base| .cse112) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse113 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse114 (select (select (store |c_#memory_$Pointer$.base| .cse113 (store (store (select |c_#memory_$Pointer$.base| .cse113) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse113 .cse114)) (= .cse114 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse115 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse116 (select (select (store |c_#memory_$Pointer$.base| .cse115 (store (store (select |c_#memory_$Pointer$.base| .cse115) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse115 .cse116) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse116))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse117 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse117 (_ bv0 32)) (= (select (select (let ((.cse118 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse118 (store (store (select |c_#memory_$Pointer$.base| .cse118) v_arrayElimCell_136 (_ bv0 32)) .cse117 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse119 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse119 (store (store (select |c_#memory_$Pointer$.base| .cse119) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse121 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse122 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse120 (select (select (store |c_#memory_$Pointer$.base| .cse121 (store (store (select |c_#memory_$Pointer$.base| .cse121) v_arrayElimCell_136 (_ bv0 32)) .cse122 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse120) (= .cse121 .cse120) (= .cse122 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse120 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse123 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse125 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse124 (select (select (store |c_#memory_$Pointer$.base| .cse123 (store (store (select |c_#memory_$Pointer$.base| .cse123) v_arrayElimCell_136 (_ bv0 32)) .cse125 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse123 .cse124) (= .cse125 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse124 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse127 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse126 (store (store (select |c_#memory_$Pointer$.base| .cse126) v_arrayElimCell_136 (_ bv0 32)) .cse127 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse127 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse128 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse128 (select (select (store |c_#memory_$Pointer$.base| .cse128 (store (store (select |c_#memory_$Pointer$.base| .cse128) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse130 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse129 (select (select (store |c_#memory_$Pointer$.base| .cse130 (store (store (select |c_#memory_$Pointer$.base| .cse130) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse129) (= .cse130 .cse129) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))))) .cse93 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse131 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse131 (select (select (store |c_#memory_$Pointer$.base| .cse131 (store (store (select |c_#memory_$Pointer$.base| .cse131) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse133 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse132 (select (select (store |c_#memory_$Pointer$.base| .cse133 (store (store (select |c_#memory_$Pointer$.base| .cse133) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse132 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse133 .cse132) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse132))))))) is different from true [2022-07-12 19:05:48,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:48,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:48,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:05:48,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 924 treesize of output 667 [2022-07-12 19:05:49,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:49,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:49,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:49,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:49,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:49,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:49,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:49,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:50,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:50,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:50,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:50,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:50,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:50,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:54,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:54,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310194112] [2022-07-12 19:05:54,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310194112] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:05:54,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:05:54,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2022-07-12 19:05:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827007206] [2022-07-12 19:05:54,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:05:54,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 19:05:54,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:54,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 19:05:54,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=5, NotChecked=78, Total=506 [2022-07-12 19:05:54,675 INFO L87 Difference]: Start difference. First operand 253 states and 278 transitions. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 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) [2022-07-12 19:05:57,165 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse93 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse134 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse134 (select (select (store |c_#memory_$Pointer$.base| .cse134 (store (store (select |c_#memory_$Pointer$.base| .cse134) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)))))) (and (= (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) .cse0 (or .cse0 (forall ((v_ArrVal_883 (_ BitVec 32)) (v_arrayElimCell_140 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32))) (= (select (let ((.cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (store (select |c_#memory_$Pointer$.base| .cse2) v_arrayElimCell_141 (_ bv0 32)) (bvadd v_arrayElimCell_141 (_ bv4 32)) v_ArrVal_883))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) v_arrayElimCell_140) (_ bv0 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| .cse3 (store (store (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse3 .cse4) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse4))))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| .cse6 (store (store (select |c_#memory_$Pointer$.base| .cse6) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse6 .cse5))))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| .cse7 (store (store (select |c_#memory_$Pointer$.base| .cse7) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 .cse8) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse8))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| .cse9 (store (store (select |c_#memory_$Pointer$.base| .cse9) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (= .cse9 .cse10) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse10))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.base| .cse11 (store (store (select |c_#memory_$Pointer$.base| .cse11) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 .cse12) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse12))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse13 (select (select (store |c_#memory_$Pointer$.base| .cse13 (store (store (select |c_#memory_$Pointer$.base| .cse13) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (or .cse0 (and (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse14 (select (select (store |c_#memory_$Pointer$.base| .cse14 (store (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse15) (= .cse16 .cse15))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| .cse17 (store (store (select |c_#memory_$Pointer$.base| .cse17) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 .cse18) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse18 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse21 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| .cse19 (store (store (select |c_#memory_$Pointer$.base| .cse19) v_arrayElimCell_136 (_ bv0 32)) .cse21 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse19 .cse20)) (= .cse21 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse20 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse24 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse22 (select (select (store |c_#memory_$Pointer$.base| .cse23 (store (store (select |c_#memory_$Pointer$.base| .cse23) .cse24 (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse23 .cse22)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse24))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse27 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| .cse26 (store (store (select |c_#memory_$Pointer$.base| .cse26) v_arrayElimCell_136 (_ bv0 32)) .cse27 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse25) (= .cse26 .cse25) (= .cse27 (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse28 (store (store (select |c_#memory_$Pointer$.base| .cse28) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse30 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse29 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse29 (store (store (select |c_#memory_$Pointer$.base| .cse29) v_arrayElimCell_136 (_ bv0 32)) .cse30 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse30 (_ bv0 32))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse31 (select (select (store |c_#memory_$Pointer$.base| .cse31 (store (store (select |c_#memory_$Pointer$.base| .cse31) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse33 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse32 (select (select (let ((.cse34 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse34 (store (store (select |c_#memory_$Pointer$.base| .cse34) v_arrayElimCell_136 (_ bv0 32)) .cse33 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse32) (= .cse33 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse32 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse35) (= .cse36 .cse35))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse37 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse39 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| .cse37 (store (store (select |c_#memory_$Pointer$.base| .cse37) v_arrayElimCell_136 (_ bv0 32)) .cse39 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse37 .cse38) (= .cse39 (_ bv0 32)) (= .cse38 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse40 (store (store (select |c_#memory_$Pointer$.base| .cse40) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse41 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse41 (select (select (store |c_#memory_$Pointer$.base| .cse41 (store (store (select |c_#memory_$Pointer$.base| .cse41) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse42 (select (select (store |c_#memory_$Pointer$.base| .cse43 (store (store (select |c_#memory_$Pointer$.base| .cse43) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse42) (= .cse43 .cse42))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse45 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse44 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse44 (store (store (select |c_#memory_$Pointer$.base| .cse44) v_arrayElimCell_136 (_ bv0 32)) .cse45 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse45 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse46 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse46 (select (select (store |c_#memory_$Pointer$.base| .cse46 (store (store (select |c_#memory_$Pointer$.base| .cse46) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse47 (select (select (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse48 (store (store (select |c_#memory_$Pointer$.base| .cse48) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse47) (= .cse47 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse49 (store (store (select |c_#memory_$Pointer$.base| .cse49) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse50 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse50 (select (select (store |c_#memory_$Pointer$.base| .cse50 (store (store (select |c_#memory_$Pointer$.base| .cse50) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse53 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse54 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.base| .cse53 (store (store (select |c_#memory_$Pointer$.base| .cse53) v_arrayElimCell_136 (_ bv0 32)) .cse54 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse52) (= .cse53 .cse52) (= .cse54 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse55 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse57 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse56 (select (select (store |c_#memory_$Pointer$.base| .cse55 (store (store (select |c_#memory_$Pointer$.base| .cse55) v_arrayElimCell_136 (_ bv0 32)) .cse57 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse55 .cse56) (= .cse57 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse56 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse58 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse58 (select (select (store |c_#memory_$Pointer$.base| .cse58 (store (store (select |c_#memory_$Pointer$.base| .cse58) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse59 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse59 (store (store (select |c_#memory_$Pointer$.base| .cse59) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse60 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse60 (store (store (select |c_#memory_$Pointer$.base| .cse60) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse62 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse61 (select (select (store |c_#memory_$Pointer$.base| .cse62 (store (store (select |c_#memory_$Pointer$.base| .cse62) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse61) (= .cse62 .cse61))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse63 (store (store (select |c_#memory_$Pointer$.base| .cse63) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse64 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse64 (store (store (select |c_#memory_$Pointer$.base| .cse64) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse66 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse67 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse65 (select (select (store |c_#memory_$Pointer$.base| .cse66 (store (store (select |c_#memory_$Pointer$.base| .cse66) v_arrayElimCell_136 (_ bv0 32)) .cse67 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse65) (= .cse66 .cse65) (= .cse67 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse68 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse68 (store (store (select |c_#memory_$Pointer$.base| .cse68) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse69 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse69 (store (store (select |c_#memory_$Pointer$.base| .cse69) (_ bv4294967292 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse71 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse72 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| .cse71 (store (store (select |c_#memory_$Pointer$.base| .cse71) v_arrayElimCell_136 (_ bv0 32)) .cse72 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse70) (= .cse71 .cse70) (= .cse72 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse73 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse73 (select (select (store |c_#memory_$Pointer$.base| .cse73 (store (store (select |c_#memory_$Pointer$.base| .cse73) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse74 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse74 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse75 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse75 (store (store (select |c_#memory_$Pointer$.base| .cse75) v_arrayElimCell_136 (_ bv0 32)) .cse74 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse77 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (let ((.cse76 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse76 (select (select (store |c_#memory_$Pointer$.base| .cse76 (store (store (select |c_#memory_$Pointer$.base| .cse76) v_arrayElimCell_136 (_ bv0 32)) .cse77 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse77 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse79 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse78 (select (select (store |c_#memory_$Pointer$.base| .cse79 (store (store (select |c_#memory_$Pointer$.base| .cse79) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse78) (= .cse79 .cse78))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse80 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse80 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse81 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse81 (store (store (select |c_#memory_$Pointer$.base| .cse81) v_arrayElimCell_136 (_ bv0 32)) .cse80 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse83 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse84 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse82 (select (select (store |c_#memory_$Pointer$.base| .cse83 (store (store (select |c_#memory_$Pointer$.base| .cse83) v_arrayElimCell_136 (_ bv0 32)) .cse84 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse82) (= .cse83 .cse82) (= .cse84 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse85 (select (select (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse85) (= .cse86 .cse85) (= .cse85 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse87 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse87 (store (store (select |c_#memory_$Pointer$.base| .cse87) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse88 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse89 (select (select (store |c_#memory_$Pointer$.base| .cse88 (store (store (select |c_#memory_$Pointer$.base| .cse88) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse88 .cse89) (= .cse89 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse90 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse90 (store (store (select |c_#memory_$Pointer$.base| .cse90) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse91 (select (select (let ((.cse92 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse92 (store (store (select |c_#memory_$Pointer$.base| .cse92) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse91) (= .cse91 |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse93 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse95 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse96 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse94 (select (select (store |c_#memory_$Pointer$.base| .cse95 (store (store (select |c_#memory_$Pointer$.base| .cse95) v_arrayElimCell_136 (_ bv0 32)) .cse96 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse94) (= .cse95 .cse94) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse96 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse97 (select (select (let ((.cse98 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse98 (store (store (select |c_#memory_$Pointer$.base| .cse98) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse97) (= .cse97 |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse99 (select (select (let ((.cse100 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse100 (store (store (select |c_#memory_$Pointer$.base| .cse100) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse99) (= .cse99 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse102 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse101 (select (select (let ((.cse103 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse103 (store (store (select |c_#memory_$Pointer$.base| .cse103) v_arrayElimCell_136 (_ bv0 32)) .cse102 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse101) (= .cse102 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse101 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse104 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse104 (store (store (select |c_#memory_$Pointer$.base| .cse104) v_arrayElimCell_136 (_ bv0 32)) .cse105 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse105 (_ bv0 32))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse107 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse106 (select (select (store |c_#memory_$Pointer$.base| .cse107 (store (store (select |c_#memory_$Pointer$.base| .cse107) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse106 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse107 .cse106)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse109 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse108 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse108 (store (store (select |c_#memory_$Pointer$.base| .cse108) v_arrayElimCell_136 (_ bv0 32)) .cse109 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse109 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (let ((.cse110 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse110 (select (select (store |c_#memory_$Pointer$.base| .cse110 (store (store (select |c_#memory_$Pointer$.base| .cse110) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse111 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse111 (select (select (store |c_#memory_$Pointer$.base| .cse111 (store (store (select |c_#memory_$Pointer$.base| .cse111) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse112 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse112 (store (store (select |c_#memory_$Pointer$.base| .cse112) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse113 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse114 (select (select (store |c_#memory_$Pointer$.base| .cse113 (store (store (select |c_#memory_$Pointer$.base| .cse113) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse113 .cse114)) (= .cse114 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse115 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse116 (select (select (store |c_#memory_$Pointer$.base| .cse115 (store (store (select |c_#memory_$Pointer$.base| .cse115) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse115 .cse116) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse116))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse117 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse117 (_ bv0 32)) (= (select (select (let ((.cse118 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse118 (store (store (select |c_#memory_$Pointer$.base| .cse118) v_arrayElimCell_136 (_ bv0 32)) .cse117 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse119 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse119 (store (store (select |c_#memory_$Pointer$.base| .cse119) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse121 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse122 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse120 (select (select (store |c_#memory_$Pointer$.base| .cse121 (store (store (select |c_#memory_$Pointer$.base| .cse121) v_arrayElimCell_136 (_ bv0 32)) .cse122 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse120) (= .cse121 .cse120) (= .cse122 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse120 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse123 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse125 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse124 (select (select (store |c_#memory_$Pointer$.base| .cse123 (store (store (select |c_#memory_$Pointer$.base| .cse123) v_arrayElimCell_136 (_ bv0 32)) .cse125 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse123 .cse124) (= .cse125 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse124 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse127 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse126 (store (store (select |c_#memory_$Pointer$.base| .cse126) v_arrayElimCell_136 (_ bv0 32)) .cse127 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse127 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse128 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse128 (select (select (store |c_#memory_$Pointer$.base| .cse128 (store (store (select |c_#memory_$Pointer$.base| .cse128) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse130 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse129 (select (select (store |c_#memory_$Pointer$.base| .cse130 (store (store (select |c_#memory_$Pointer$.base| .cse130) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse129) (= .cse130 .cse129) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))))) .cse93 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse131 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse131 (select (select (store |c_#memory_$Pointer$.base| .cse131 (store (store (select |c_#memory_$Pointer$.base| .cse131) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse133 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse132 (select (select (store |c_#memory_$Pointer$.base| .cse133 (store (store (select |c_#memory_$Pointer$.base| .cse133) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse132 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse133 .cse132) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse132))))))) is different from true [2022-07-12 19:05:59,268 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (let ((.cse1 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse203 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse203 (store (store (select |c_#memory_$Pointer$.base| .cse203) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse2 (not .cse8)) (.cse21 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse202 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse202 (select (select (store |c_#memory_$Pointer$.base| .cse202 (store (store (select |c_#memory_$Pointer$.base| .cse202) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse11 (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse201 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse201 (store (store (select |c_#memory_$Pointer$.base| .cse201) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (let ((.cse3 (= (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (.cse4 (and .cse21 .cse11)) (.cse9 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse199 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse200 (select (select (store |c_#memory_$Pointer$.base| .cse199 (store (store (select |c_#memory_$Pointer$.base| .cse199) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (= .cse199 .cse200) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse200)))))) (.cse15 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse198 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse198 (store (store (select |c_#memory_$Pointer$.base| .cse198) |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse198)))) (.cse23 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse197 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse197 (select (select (store |c_#memory_$Pointer$.base| .cse197 (store (store (select |c_#memory_$Pointer$.base| .cse197) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16)))) (.cse24 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse196 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse196 (select (select (store |c_#memory_$Pointer$.base| .cse196 (store (store (select |c_#memory_$Pointer$.base| .cse196) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse10 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse194 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse195 (select (select (store |c_#memory_$Pointer$.base| .cse194 (store (store (select |c_#memory_$Pointer$.base| .cse194) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse194 .cse195) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse195)))))))) (.cse20 (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32))) (.cse19 (or .cse1 .cse2)) (.cse27 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse193 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse193 (select (select (store |c_#memory_$Pointer$.base| .cse193 (store (store (select |c_#memory_$Pointer$.base| .cse193) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32))))) (.cse28 (or (and .cse1 .cse21) .cse2)) (.cse7 (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse12 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)))) (and .cse0 (or .cse1 .cse2 .cse3) (or .cse4 .cse2 .cse3) (or .cse0 (forall ((v_ArrVal_883 (_ BitVec 32)) (v_arrayElimCell_140 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32))) (= (select (let ((.cse5 (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse6 (store (store (select |c_#memory_$Pointer$.base| .cse6) v_arrayElimCell_141 (_ bv0 32)) (bvadd v_arrayElimCell_141 (_ bv4 32)) v_ArrVal_883))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) v_arrayElimCell_140) (_ bv0 32)))) .cse7 (or .cse8 .cse9) .cse10 (or .cse11 .cse2 .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| .cse14 (store (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse14 .cse13))))))) (or (and (or .cse4 .cse2) (or .cse2 (and .cse15 (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))))) .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| .cse17 (store (store (select |c_#memory_$Pointer$.base| .cse17) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 .cse18) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse18))))))) .cse19 .cse2 (or .cse2 (and .cse1 .cse11)) .cse9 (or .cse20 (and (or .cse2 .cse15) (or .cse21 .cse2) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse22 (select (select (store |c_#memory_$Pointer$.base| .cse22 (store (store (select |c_#memory_$Pointer$.base| .cse22) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse23 .cse24)) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| .cse25 (store (store (select |c_#memory_$Pointer$.base| .cse25) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse25 .cse26) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse26))))))) .cse23 .cse27 (or .cse20 .cse2) .cse28 .cse24 (or .cse0 (let ((.cse80 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse190 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse190 (store (store (select |c_#memory_$Pointer$.base| .cse190) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse52 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse189 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse189 (store (store (select |c_#memory_$Pointer$.base| .cse189) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (let ((.cse43 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (let ((.cse188 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse188 (select (select (store |c_#memory_$Pointer$.base| .cse188 (store (store (select |c_#memory_$Pointer$.base| .cse188) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse38 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse187 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse187 (store (store (select |c_#memory_$Pointer$.base| .cse187) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse74 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse186 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse186 (store (store (select |c_#memory_$Pointer$.base| .cse186) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse185 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse184 (select (select (store |c_#memory_$Pointer$.base| .cse185 (store (store (select |c_#memory_$Pointer$.base| .cse185) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse184) (= .cse185 .cse184)))))) (.cse76 (or .cse52 .cse12)) (.cse111 (or .cse80 .cse12)) (.cse46 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse183 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse182 (select (select (store |c_#memory_$Pointer$.base| .cse183 (store (store (select |c_#memory_$Pointer$.base| .cse183) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse182) (= .cse183 .cse182))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse100 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse180 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse180 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse181 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse181 (store (store (select |c_#memory_$Pointer$.base| .cse181) v_arrayElimCell_136 (_ bv0 32)) .cse180 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse58 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse179 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse179 (store (store (select |c_#memory_$Pointer$.base| .cse179) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse99 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse178 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse177 (select (select (store |c_#memory_$Pointer$.base| .cse178 (store (store (select |c_#memory_$Pointer$.base| .cse178) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse177) (= .cse178 .cse177)))))))) (.cse112 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse175 (select (select (let ((.cse176 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse176 (store (store (select |c_#memory_$Pointer$.base| .cse176) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse175) (= .cse175 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (.cse68 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse173 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse172 (select (select (let ((.cse174 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse174 (store (store (select |c_#memory_$Pointer$.base| .cse174) v_arrayElimCell_136 (_ bv0 32)) .cse173 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse172) (= .cse173 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse172 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse81 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse171 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse170 (select (select (store |c_#memory_$Pointer$.base| .cse171 (store (store (select |c_#memory_$Pointer$.base| .cse171) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse170 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse171 .cse170))))))) (.cse118 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse169 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse169 (store (store (select |c_#memory_$Pointer$.base| .cse169) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse75 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse166 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse168 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse167 (select (select (store |c_#memory_$Pointer$.base| .cse166 (store (store (select |c_#memory_$Pointer$.base| .cse166) v_arrayElimCell_136 (_ bv0 32)) .cse168 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse166 .cse167) (= .cse168 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse167 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse82 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse164 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse164 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse165 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse165 (store (store (select |c_#memory_$Pointer$.base| .cse165) v_arrayElimCell_136 (_ bv0 32)) .cse164 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse53 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse162 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse163 (select (select (store |c_#memory_$Pointer$.base| .cse162 (store (store (select |c_#memory_$Pointer$.base| .cse162) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse162 .cse163) (= .cse163 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse44 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse160 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse161 (select (select (store |c_#memory_$Pointer$.base| .cse160 (store (store (select |c_#memory_$Pointer$.base| .cse160) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse160 .cse161) (= .cse161 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse113 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse159 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse159 (store (store (select |c_#memory_$Pointer$.base| .cse159) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse117 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse156 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse158 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse157 (select (select (store |c_#memory_$Pointer$.base| .cse156 (store (store (select |c_#memory_$Pointer$.base| .cse156) v_arrayElimCell_136 (_ bv0 32)) .cse158 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse156 .cse157) (= .cse158 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse157 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse29 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse155 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse155 (select (select (store |c_#memory_$Pointer$.base| .cse155 (store (store (select |c_#memory_$Pointer$.base| .cse155) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse115 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse154 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse154 (select (select (store |c_#memory_$Pointer$.base| .cse154 (store (store (select |c_#memory_$Pointer$.base| .cse154) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16)))) (.cse31 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse152 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$.base| .cse152 (store (store (select |c_#memory_$Pointer$.base| .cse152) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse152 .cse153) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse153 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse107 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse151 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse150 (select (select (store |c_#memory_$Pointer$.base| .cse151 (store (store (select |c_#memory_$Pointer$.base| .cse151) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse150) (= .cse151 .cse150) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse148 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse149 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse149 (select (select (store |c_#memory_$Pointer$.base| .cse149 (store (store (select |c_#memory_$Pointer$.base| .cse149) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (and (or .cse29 .cse8) .cse30 .cse31 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse34 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| .cse32 (store (store (select |c_#memory_$Pointer$.base| .cse32) v_arrayElimCell_136 (_ bv0 32)) .cse34 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse32 .cse33)) (= .cse34 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse33 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse37 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) .cse37 (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse35 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse36 .cse35)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse37))))) .cse20 .cse38 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse39 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse39 (select (select (store |c_#memory_$Pointer$.base| .cse39 (store (store (select |c_#memory_$Pointer$.base| .cse39) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse41 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse40 (select (select (let ((.cse42 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse42 (store (store (select |c_#memory_$Pointer$.base| .cse42) v_arrayElimCell_136 (_ bv0 32)) .cse41 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse40) (= .cse41 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse40 |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse12 .cse43) (or (and .cse11 .cse44) .cse2) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse45 (store (store (select |c_#memory_$Pointer$.base| .cse45) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse46 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse47 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse49 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse48 (select (select (store |c_#memory_$Pointer$.base| .cse47 (store (store (select |c_#memory_$Pointer$.base| .cse47) v_arrayElimCell_136 (_ bv0 32)) .cse49 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse47 .cse48) (= .cse49 (_ bv0 32)) (= .cse48 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse50 (select (select (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse50) (= .cse50 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (or .cse8 (and .cse52 .cse53)) .cse10 (or .cse20 (let ((.cse54 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse57 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse57 (select (select (store |c_#memory_$Pointer$.base| .cse57 (store (store (select |c_#memory_$Pointer$.base| .cse57) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and .cse54 (or .cse54 .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse56 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse55 (select (select (store |c_#memory_$Pointer$.base| .cse56 (store (store (select |c_#memory_$Pointer$.base| .cse56) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse55) (= .cse56 .cse55))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) .cse43))) .cse58 (or .cse53 .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse60 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse59 (select (select (store |c_#memory_$Pointer$.base| .cse60 (store (store (select |c_#memory_$Pointer$.base| .cse60) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse59) (= .cse60 .cse59))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse62 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse61 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse61 (store (store (select |c_#memory_$Pointer$.base| .cse61) v_arrayElimCell_136 (_ bv0 32)) .cse62 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse62 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse64 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse63 (store (store (select |c_#memory_$Pointer$.base| .cse63) v_arrayElimCell_136 (_ bv0 32)) .cse64 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse64) (= .cse64 (_ bv0 32))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse65 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse65 (store (store (select |c_#memory_$Pointer$.base| .cse65) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse67 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse66 (select (select (store |c_#memory_$Pointer$.base| .cse67 (store (store (select |c_#memory_$Pointer$.base| .cse67) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse66) (not (= .cse67 .cse66)))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or .cse8 .cse68) .cse19 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse70 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse71 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse69 (select (select (store |c_#memory_$Pointer$.base| .cse70 (store (store (select |c_#memory_$Pointer$.base| .cse70) v_arrayElimCell_136 (_ bv0 32)) .cse71 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse69) (= .cse70 .cse69) (= .cse71 (_ bv0 32)))))) .cse2 (or .cse8 (and (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse72 (select (select (let ((.cse73 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse73 (store (store (select |c_#memory_$Pointer$.base| .cse73) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse72) (= .cse72 |c_ULTIMATE.start_main_~item~0#1.base|)))))) .cse74)) (or .cse75 .cse8) .cse76 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse78 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse77 (select (select (store |c_#memory_$Pointer$.base| .cse78 (store (store (select |c_#memory_$Pointer$.base| .cse78) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse77) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (= .cse78 .cse77)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse79 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse79 (store (store (select |c_#memory_$Pointer$.base| .cse79) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse80 (or .cse8 .cse53) (or .cse12 (and .cse29 .cse2 .cse81)) (or .cse8 .cse82) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse84 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse83 (select (select (store |c_#memory_$Pointer$.base| .cse84 (store (store (select |c_#memory_$Pointer$.base| .cse84) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse83) (= .cse84 .cse83))))) (or .cse8 (and .cse38 .cse29)) .cse52 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse85 (select (select (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse85) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (= .cse86 .cse85)) (= (_ bv4 32) v_arrayElimIndex_16))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse88 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse87 (select (select (store |c_#memory_$Pointer$.base| .cse88 (store (store (select |c_#memory_$Pointer$.base| .cse88) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse87) (not (= .cse88 .cse87)))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or .cse8 (and .cse75 .cse82)) (or .cse8 .cse52) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse90 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse91 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse89 (select (select (store |c_#memory_$Pointer$.base| .cse90 (store (store (select |c_#memory_$Pointer$.base| .cse90) v_arrayElimCell_136 (_ bv0 32)) .cse91 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse89) (= .cse90 .cse89) (= .cse91 |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse74 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse92 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse92 (store (store (select |c_#memory_$Pointer$.base| .cse92) (_ bv4294967292 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse94 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse95 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse93 (select (select (store |c_#memory_$Pointer$.base| .cse94 (store (store (select |c_#memory_$Pointer$.base| .cse94) v_arrayElimCell_136 (_ bv0 32)) .cse95 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse93) (= .cse94 .cse93) (= .cse95 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse96 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse96 (select (select (store |c_#memory_$Pointer$.base| .cse96 (store (store (select |c_#memory_$Pointer$.base| .cse96) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse82 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse98 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (let ((.cse97 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse97 (select (select (store |c_#memory_$Pointer$.base| .cse97 (store (store (select |c_#memory_$Pointer$.base| .cse97) v_arrayElimCell_136 (_ bv0 32)) .cse98 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse98 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse99 .cse100 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse102 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse103 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse101 (select (select (store |c_#memory_$Pointer$.base| .cse102 (store (store (select |c_#memory_$Pointer$.base| .cse102) v_arrayElimCell_136 (_ bv0 32)) .cse103 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse101) (= .cse102 .cse101) (= .cse103 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (let ((.cse104 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse104 (select (select (store |c_#memory_$Pointer$.base| .cse104 (store (store (select |c_#memory_$Pointer$.base| .cse104) v_arrayElimCell_136 (_ bv0 32)) .cse105 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= .cse105 (_ bv0 32))))) .cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse106 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse106 (select (select (store |c_#memory_$Pointer$.base| .cse106 (store (store (select |c_#memory_$Pointer$.base| .cse106) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse107) .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse109 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse108 (select (select (store |c_#memory_$Pointer$.base| .cse109 (store (store (select |c_#memory_$Pointer$.base| .cse109) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse108) (= .cse109 .cse108) (= .cse108 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse110 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse110 (select (select (store |c_#memory_$Pointer$.base| .cse110 (store (store (select |c_#memory_$Pointer$.base| .cse110) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (or .cse8 (and .cse76 .cse52 .cse111 .cse112 .cse68 .cse113)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse114 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse114 (store (store (select |c_#memory_$Pointer$.base| .cse114) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse53 .cse111 (or .cse8 .cse115) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse116 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse116 (store (store (select |c_#memory_$Pointer$.base| .cse116) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (or (and .cse31 .cse75 .cse80 .cse52 .cse82 .cse100 .cse53 .cse117) .cse8) (or .cse8 (and .cse46 .cse118)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse119 (select (select (let ((.cse120 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse120 (store (store (select |c_#memory_$Pointer$.base| .cse120) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse119) (= .cse119 |c_ULTIMATE.start_main_~item~0#1.base|)))) (or .cse8 (and .cse100 .cse117)) (or .cse8 (and .cse58 .cse99)) .cse27 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse122 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse123 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse121 (select (select (store |c_#memory_$Pointer$.base| .cse122 (store (store (select |c_#memory_$Pointer$.base| .cse122) v_arrayElimCell_136 (_ bv0 32)) .cse123 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse121) (= .cse122 .cse121) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse123 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse124 (select (select (let ((.cse125 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse125 (store (store (select |c_#memory_$Pointer$.base| .cse125) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse124) (= .cse124 |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse112 .cse68 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse127 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse126 (store (store (select |c_#memory_$Pointer$.base| .cse126) v_arrayElimCell_136 (_ bv0 32)) .cse127 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse127 (_ bv0 32))))) .cse28 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse128 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse128 (store (store (select |c_#memory_$Pointer$.base| .cse128) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse81 .cse12 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse130 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse129 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse129 (store (store (select |c_#memory_$Pointer$.base| .cse129) v_arrayElimCell_136 (_ bv0 32)) .cse130 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse130 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse118 (or .cse8 (and .cse75 .cse52 .cse82 .cse53)) (or (and (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse131 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse131 (select (select (store |c_#memory_$Pointer$.base| .cse131 (store (store (select |c_#memory_$Pointer$.base| .cse131) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse7 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse132 (select (select (let ((.cse133 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse133 (store (store (select |c_#memory_$Pointer$.base| .cse133) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse132 |c_ULTIMATE.start_main_~item~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse132)))) .cse11 .cse44 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) .cse2 .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse134 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse135 (select (select (store |c_#memory_$Pointer$.base| .cse134 (store (store (select |c_#memory_$Pointer$.base| .cse134) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse134 .cse135)) (= .cse135 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse137 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse138 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse136 (select (select (store |c_#memory_$Pointer$.base| .cse137 (store (store (select |c_#memory_$Pointer$.base| .cse137) v_arrayElimCell_136 (_ bv0 32)) .cse138 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse136) (= .cse137 .cse136) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse138) (= .cse138 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse139 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse139 (_ bv0 32)) (= (select (select (let ((.cse140 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse140 (store (store (select |c_#memory_$Pointer$.base| .cse140) v_arrayElimCell_136 (_ bv0 32)) .cse139 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (or .cse12 (and .cse80 .cse52)) .cse113 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse142 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse143 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse141 (select (select (store |c_#memory_$Pointer$.base| .cse142 (store (store (select |c_#memory_$Pointer$.base| .cse142) v_arrayElimCell_136 (_ bv0 32)) .cse143 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse141) (= .cse142 .cse141) (= .cse143 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse141 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse117 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse145 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse144 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse144 (store (store (select |c_#memory_$Pointer$.base| .cse144) v_arrayElimCell_136 (_ bv0 32)) .cse145 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse145 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and .cse29 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse146 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse146 (select (select (store |c_#memory_$Pointer$.base| .cse146 (store (store (select |c_#memory_$Pointer$.base| .cse146) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (let ((.cse147 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse147 (select (select (store |c_#memory_$Pointer$.base| .cse147 (store (store (select |c_#memory_$Pointer$.base| .cse147) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) .cse148 .cse115) .cse12) (or .cse8 (and .cse31 .cse80)) .cse107 (or .cse8 .cse148))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse192 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse191 (select (select (store |c_#memory_$Pointer$.base| .cse192 (store (store (select |c_#memory_$Pointer$.base| .cse192) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse191 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse192 .cse191) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse191))))))))) is different from true [2022-07-12 19:06:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:06:02,249 INFO L93 Difference]: Finished difference Result 248 states and 268 transitions. [2022-07-12 19:06:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:06:02,250 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 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 [2022-07-12 19:06:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:06:02,250 INFO L225 Difference]: With dead ends: 248 [2022-07-12 19:06:02,250 INFO L226 Difference]: Without dead ends: 248 [2022-07-12 19:06:02,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=81, Invalid=480, Unknown=7, NotChecked=188, Total=756 [2022-07-12 19:06:02,251 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 75 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 622 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:06:02,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1149 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 622 Unchecked, 2.7s Time] [2022-07-12 19:06:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-12 19:06:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2022-07-12 19:06:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 215 states have (on average 1.2372093023255815) internal successors, (266), 245 states have internal predecessors, (266), 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) [2022-07-12 19:06:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 266 transitions. [2022-07-12 19:06:02,254 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 266 transitions. Word has length 44 [2022-07-12 19:06:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:06:02,254 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 266 transitions. [2022-07-12 19:06:02,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 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) [2022-07-12 19:06:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 266 transitions. [2022-07-12 19:06:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:06:02,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:06:02,255 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-12 19:06:02,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-12 19:06:02,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:06:02,455 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:06:02,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:06:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash 813102997, now seen corresponding path program 1 times [2022-07-12 19:06:02,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:06:02,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775945025] [2022-07-12 19:06:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:06:02,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:06:02,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:06:02,457 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:06:02,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 19:06:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:06:02,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 19:06:02,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:06:02,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:06:02,909 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:02,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:06:03,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:06:03,749 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:06:03,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-12 19:06:03,954 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:06:03,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-12 19:06:04,277 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:04,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:06:04,573 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:06:04,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-12 19:06:05,549 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:06:05,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 49 [2022-07-12 19:06:05,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-07-12 19:06:06,314 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:06:06,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 56 [2022-07-12 19:06:06,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-07-12 19:06:07,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-07-12 19:06:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:07,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:06:07,929 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-07-12 19:06:08,471 INFO L356 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2022-07-12 19:06:08,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 25 [2022-07-12 19:06:08,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~item~0#1.base| (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_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-12 19:06:08,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (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_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) is different from false [2022-07-12 19:06:08,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_39| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_39|))) (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (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| |v_ULTIMATE.start_main_#t~malloc3#1.base_39|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_39| v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-07-12 19:06:08,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:08,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-07-12 19:06:08,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_16 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_16) .cse0 v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-07-12 19:06:09,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_16 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_16) .cse0 v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|)))) is different from false [2022-07-12 19:06:09,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_91| (_ BitVec 32)) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_16 |v_ULTIMATE.start_main_~item~0#1.offset_91|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_16) .cse1 v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse1)))))) is different from false [2022-07-12 19:06:09,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:09,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-07-12 19:06:09,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:09,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 71 [2022-07-12 19:06:09,359 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:09,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 60 [2022-07-12 19:06:09,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 42 [2022-07-12 19:06:09,478 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:06:09,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-12 19:06:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-12 19:06:10,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:06:10,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775945025] [2022-07-12 19:06:10,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775945025] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:06:10,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:06:10,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-07-12 19:06:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837270791] [2022-07-12 19:06:10,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:06:10,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 19:06:10,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:06:10,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 19:06:10,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=257, Unknown=13, NotChecked=266, Total=600 [2022-07-12 19:06:10,368 INFO L87 Difference]: Start difference. First operand 246 states and 266 transitions. Second operand has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 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) [2022-07-12 19:06:20,429 WARN L233 SmtUtils]: Spent 7.04s on a formula simplification. DAG size of input: 32 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:06:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:06:25,776 INFO L93 Difference]: Finished difference Result 283 states and 306 transitions. [2022-07-12 19:06:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:06:25,776 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 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 [2022-07-12 19:06:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:06:25,777 INFO L225 Difference]: With dead ends: 283 [2022-07-12 19:06:25,777 INFO L226 Difference]: Without dead ends: 283 [2022-07-12 19:06:25,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=137, Invalid=632, Unknown=15, NotChecked=406, Total=1190 [2022-07-12 19:06:25,778 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 198 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1039 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:06:25,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1053 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 620 Invalid, 0 Unknown, 1039 Unchecked, 5.1s Time] [2022-07-12 19:06:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-12 19:06:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 249. [2022-07-12 19:06:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 218 states have (on average 1.238532110091743) internal successors, (270), 248 states have internal predecessors, (270), 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) [2022-07-12 19:06:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 270 transitions. [2022-07-12 19:06:25,782 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 270 transitions. Word has length 44 [2022-07-12 19:06:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:06:25,782 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 270 transitions. [2022-07-12 19:06:25,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 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) [2022-07-12 19:06:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 270 transitions. [2022-07-12 19:06:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:06:25,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:06:25,783 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-12 19:06:25,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-12 19:06:25,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:06:25,998 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:06:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:06:25,998 INFO L85 PathProgramCache]: Analyzing trace with hash 813102998, now seen corresponding path program 1 times [2022-07-12 19:06:25,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:06:25,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222201937] [2022-07-12 19:06:25,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:06:25,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:06:25,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:06:26,000 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:06:26,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 19:06:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:06:26,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 19:06:26,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:06:26,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:06:26,428 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:26,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:06:26,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:06:26,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:06:27,495 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:06:27,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-12 19:06:27,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:27,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 [2022-07-12 19:06:27,773 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:06:27,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-12 19:06:27,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:27,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 [2022-07-12 19:06:28,369 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:28,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:06:28,731 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:06:28,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-12 19:06:28,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 19:06:29,983 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:06:29,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 63 [2022-07-12 19:06:30,102 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:06:30,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 44 [2022-07-12 19:06:30,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 8 [2022-07-12 19:06:30,998 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:06:30,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 70 [2022-07-12 19:06:31,107 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:06:31,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 53 [2022-07-12 19:06:31,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-07-12 19:06:32,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 19 [2022-07-12 19:06:32,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-07-12 19:06:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:32,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:06:33,548 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 19:06:33,732 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-12 19:06:33,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:33,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 70 [2022-07-12 19:06:34,057 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-12 19:06:34,230 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32))) (forall ((v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (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|) |c_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_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-12 19:06:34,404 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (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|) |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1)))))) is different from false [2022-07-12 19:06:35,048 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:35,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-07-12 19:06:35,193 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) .cse1 v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_18) .cse1 v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse1)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1)))))) is different from false [2022-07-12 19:06:35,613 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~mem4#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse1))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1013) .cse1 v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_18) .cse1 v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_#t~mem4#1.offset|)))))) is different from false [2022-07-12 19:06:35,770 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse1 (select v_arrayElimArr_18 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (or (not (= (_ bv0 1) (select |c_#valid| .cse1))) (= .cse2 (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_18) .cse1 v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1013) .cse1 v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)))))) is different from false [2022-07-12 19:06:35,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:35,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 34 [2022-07-12 19:06:36,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:36,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 158 treesize of output 149 [2022-07-12 19:06:36,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 126 [2022-07-12 19:06:36,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 110 [2022-07-12 19:06:36,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:36,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 26 [2022-07-12 19:06:36,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:36,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:36,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 41 [2022-07-12 19:06:36,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 11 [2022-07-12 19:06:36,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:36,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 26 [2022-07-12 19:06:36,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:36,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-07-12 19:06:37,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:37,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:37,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 37 [2022-07-12 19:06:37,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:37,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:37,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-12 19:06:37,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-12 19:06:37,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:37,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-07-12 19:06:40,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:40,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 149 treesize of output 489 [2022-07-12 19:06:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-12 19:06:45,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:06:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222201937] [2022-07-12 19:06:45,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222201937] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:06:45,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:06:45,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-12 19:06:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922825778] [2022-07-12 19:06:45,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:06:45,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 19:06:45,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:06:45,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 19:06:45,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=297, Unknown=8, NotChecked=328, Total=702 [2022-07-12 19:06:45,587 INFO L87 Difference]: Start difference. First operand 249 states and 270 transitions. Second operand has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 27 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) [2022-07-12 19:07:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:07:01,670 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2022-07-12 19:07:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:07:01,672 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 27 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 44 [2022-07-12 19:07:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:07:01,673 INFO L225 Difference]: With dead ends: 281 [2022-07-12 19:07:01,673 INFO L226 Difference]: Without dead ends: 281 [2022-07-12 19:07:01,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=110, Invalid=513, Unknown=9, NotChecked=424, Total=1056 [2022-07-12 19:07:01,673 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 123 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1082 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:07:01,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1432 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 683 Invalid, 0 Unknown, 1082 Unchecked, 6.1s Time] [2022-07-12 19:07:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-12 19:07:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 249. [2022-07-12 19:07:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 248 states have internal predecessors, (269), 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) [2022-07-12 19:07:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 269 transitions. [2022-07-12 19:07:01,676 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 269 transitions. Word has length 44 [2022-07-12 19:07:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:07:01,676 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 269 transitions. [2022-07-12 19:07:01,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 27 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) [2022-07-12 19:07:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2022-07-12 19:07:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:07:01,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:07:01,676 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-12 19:07:01,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-12 19:07:01,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:07:01,885 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 19:07:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:07:01,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1823961394, now seen corresponding path program 2 times [2022-07-12 19:07:01,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:07:01,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474630904] [2022-07-12 19:07:01,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:07:01,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:07:01,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:07:01,886 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:07:01,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-12 19:07:02,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:07:02,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:07:02,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 19:07:02,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:07:02,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:07:02,285 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:07:02,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:07:02,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:07:02,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-12 19:07:03,186 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 19:07:03,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:07:03,375 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:07:03,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 19:07:03,990 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-12 19:07:03,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 70 [2022-07-12 19:07:04,080 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-12 19:07:04,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-07-12 19:07:06,083 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 19:07:06,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 36 [2022-07-12 19:07:06,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-12 19:07:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:07:06,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:07:31,088 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:07:31,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 113463 treesize of output 103619 [2022-07-12 19:07:34,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:07:34,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 124744 treesize of output 123696 [2022-07-12 19:07:35,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:07:35,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138292 treesize of output 121812