./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:20:15,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:20:15,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:20:15,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:20:15,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:20:15,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:20:15,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:20:15,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:20:15,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:20:15,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:20:15,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:20:15,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:20:15,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:20:15,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:20:15,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:20:15,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:20:15,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:20:15,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:20:15,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:20:15,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:20:15,752 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:20:15,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:20:15,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:20:15,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:20:15,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:20:15,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:20:15,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:20:15,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:20:15,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:20:15,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:20:15,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:20:15,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:20:15,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:20:15,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:20:15,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:20:15,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:20:15,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:20:15,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:20:15,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:20:15,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:20:15,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:20:15,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:20:15,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:20:15,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:20:15,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:20:15,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:20:15,793 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:20:15,794 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:20:15,794 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:20:15,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:20:15,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:20:15,795 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:20:15,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:20:15,796 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:20:15,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:20:15,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:20:15,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:20:15,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:20:15,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:20:15,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:20:15,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:20:15,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:20:15,798 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:20:15,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:20:15,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:20:15,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:20:15,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:20:15,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:15,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:20:15,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:20:15,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:20:15,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:20:15,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:20:15,801 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:20:15,801 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:20:15,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:20:15,801 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 ! call(reach_error())) ) 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2022-07-12 03:20:16,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:20:16,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:20:16,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:20:16,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:20:16,032 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:20:16,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-07-12 03:20:16,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7b730bb/a1f50a0afaae49dda4fbc424575daa0f/FLAG148657321 [2022-07-12 03:20:16,454 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:20:16,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-07-12 03:20:16,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7b730bb/a1f50a0afaae49dda4fbc424575daa0f/FLAG148657321 [2022-07-12 03:20:16,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7b730bb/a1f50a0afaae49dda4fbc424575daa0f [2022-07-12 03:20:16,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:20:16,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:20:16,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:16,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:20:16,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:20:16,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:16" (1/1) ... [2022-07-12 03:20:16,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b2c86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:16, skipping insertion in model container [2022-07-12 03:20:16,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:16" (1/1) ... [2022-07-12 03:20:16,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:20:16,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:20:17,078 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/dll-rb-cnstr_1-1.i[22569,22582] [2022-07-12 03:20:17,081 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/dll-rb-cnstr_1-1.i[22645,22658] [2022-07-12 03:20:17,082 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/dll-rb-cnstr_1-1.i[22715,22728] [2022-07-12 03:20:17,083 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/dll-rb-cnstr_1-1.i[22822,22835] [2022-07-12 03:20:17,083 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/dll-rb-cnstr_1-1.i[22894,22907] [2022-07-12 03:20:17,084 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/dll-rb-cnstr_1-1.i[23045,23058] [2022-07-12 03:20:17,085 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/dll-rb-cnstr_1-1.i[23119,23132] [2022-07-12 03:20:17,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:17,094 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:20:17,140 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/dll-rb-cnstr_1-1.i[22569,22582] [2022-07-12 03:20:17,141 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/dll-rb-cnstr_1-1.i[22645,22658] [2022-07-12 03:20:17,141 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/dll-rb-cnstr_1-1.i[22715,22728] [2022-07-12 03:20:17,142 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/dll-rb-cnstr_1-1.i[22822,22835] [2022-07-12 03:20:17,152 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/dll-rb-cnstr_1-1.i[22894,22907] [2022-07-12 03:20:17,153 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/dll-rb-cnstr_1-1.i[23045,23058] [2022-07-12 03:20:17,153 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/dll-rb-cnstr_1-1.i[23119,23132] [2022-07-12 03:20:17,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:17,172 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:20:17,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17 WrapperNode [2022-07-12 03:20:17,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:17,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:17,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:20:17,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:20:17,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (1/1) ... [2022-07-12 03:20:17,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (1/1) ... [2022-07-12 03:20:17,211 INFO L137 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2022-07-12 03:20:17,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:17,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:20:17,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:20:17,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:20:17,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (1/1) ... [2022-07-12 03:20:17,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (1/1) ... [2022-07-12 03:20:17,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (1/1) ... [2022-07-12 03:20:17,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (1/1) ... [2022-07-12 03:20:17,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (1/1) ... [2022-07-12 03:20:17,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (1/1) ... [2022-07-12 03:20:17,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (1/1) ... [2022-07-12 03:20:17,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:20:17,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:20:17,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:20:17,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:20:17,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (1/1) ... [2022-07-12 03:20:17,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:17,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:17,282 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 03:20:17,283 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 03:20:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:20:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:20:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:20:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:20:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:20:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:20:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:20:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:20:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:20:17,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:20:17,427 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:20:17,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:20:17,674 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:20:17,679 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:20:17,680 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-07-12 03:20:17,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:17 BoogieIcfgContainer [2022-07-12 03:20:17,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:20:17,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:20:17,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:20:17,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:20:17,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:20:16" (1/3) ... [2022-07-12 03:20:17,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3f1c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:17, skipping insertion in model container [2022-07-12 03:20:17,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:17" (2/3) ... [2022-07-12 03:20:17,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3f1c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:17, skipping insertion in model container [2022-07-12 03:20:17,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:17" (3/3) ... [2022-07-12 03:20:17,689 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2022-07-12 03:20:17,701 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:20:17,702 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-07-12 03:20:17,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:20:17,769 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@54b698fd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9320ef2 [2022-07-12 03:20:17,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-12 03:20:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 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 03:20:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 03:20:17,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:17,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 03:20:17,788 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:17,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:17,794 INFO L85 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2022-07-12 03:20:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:17,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060122251] [2022-07-12 03:20:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:17,949 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 03:20:17,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:17,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060122251] [2022-07-12 03:20:17,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060122251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:17,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:17,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:20:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720240019] [2022-07-12 03:20:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:17,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:20:17,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:20:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:20:17,995 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:18,016 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2022-07-12 03:20:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:20:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 03:20:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:18,026 INFO L225 Difference]: With dead ends: 92 [2022-07-12 03:20:18,026 INFO L226 Difference]: Without dead ends: 41 [2022-07-12 03:20:18,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:20:18,033 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:18,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-12 03:20:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-07-12 03:20:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 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 03:20:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-07-12 03:20:18,070 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2022-07-12 03:20:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:18,071 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-07-12 03:20:18,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-07-12 03:20:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 03:20:18,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:18,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:18,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:20:18,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:18,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:18,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2022-07-12 03:20:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:18,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652606324] [2022-07-12 03:20:18,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:18,180 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 03:20:18,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:18,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652606324] [2022-07-12 03:20:18,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652606324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:18,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:18,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584297523] [2022-07-12 03:20:18,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:18,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:18,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:18,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:18,189 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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 03:20:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:18,271 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-12 03:20:18,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:18,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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 03:20:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:18,276 INFO L225 Difference]: With dead ends: 44 [2022-07-12 03:20:18,276 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 03:20:18,277 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 03:20:18,278 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 59 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:18,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 03:20:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-07-12 03:20:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 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 03:20:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-07-12 03:20:18,296 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 7 [2022-07-12 03:20:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:18,296 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-07-12 03:20:18,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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 03:20:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-07-12 03:20:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 03:20:18,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:18,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:18,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:20:18,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:18,306 INFO L85 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2022-07-12 03:20:18,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:18,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291839935] [2022-07-12 03:20:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:18,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:18,419 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 03:20:18,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291839935] [2022-07-12 03:20:18,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291839935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:18,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:18,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065444076] [2022-07-12 03:20:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:18,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:18,422 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.0) 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 03:20:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:18,464 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-07-12 03:20:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:18,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) 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 03:20:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:18,465 INFO L225 Difference]: With dead ends: 37 [2022-07-12 03:20:18,465 INFO L226 Difference]: Without dead ends: 35 [2022-07-12 03:20:18,466 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 03:20:18,466 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:18,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-12 03:20:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-12 03:20:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 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 03:20:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-12 03:20:18,470 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 8 [2022-07-12 03:20:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:18,470 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-12 03:20:18,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) 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 03:20:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-12 03:20:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:20:18,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:18,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:18,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:20:18,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:18,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2022-07-12 03:20:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:18,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488348191] [2022-07-12 03:20:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:18,561 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 03:20:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:18,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488348191] [2022-07-12 03:20:18,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488348191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:18,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:18,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612218221] [2022-07-12 03:20:18,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:18,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:18,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:18,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:18,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:18,567 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:18,670 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-07-12 03:20:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:18,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 03:20:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:18,671 INFO L225 Difference]: With dead ends: 60 [2022-07-12 03:20:18,671 INFO L226 Difference]: Without dead ends: 58 [2022-07-12 03:20:18,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:18,672 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:18,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 88 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-12 03:20:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2022-07-12 03:20:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 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 03:20:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-07-12 03:20:18,678 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 10 [2022-07-12 03:20:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:18,678 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-07-12 03:20:18,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-07-12 03:20:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:20:18,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:18,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:18,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:20:18,679 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2022-07-12 03:20:18,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:18,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65705195] [2022-07-12 03:20:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:18,787 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 03:20:18,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:18,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65705195] [2022-07-12 03:20:18,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65705195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:18,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:18,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:18,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657675772] [2022-07-12 03:20:18,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:18,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:18,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:18,794 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 03:20:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:18,863 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-12 03:20:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:18,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 03:20:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:18,864 INFO L225 Difference]: With dead ends: 42 [2022-07-12 03:20:18,864 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 03:20:18,864 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 03:20:18,865 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:18,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 70 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 03:20:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-12 03:20:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 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 03:20:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-07-12 03:20:18,872 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 11 [2022-07-12 03:20:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:18,872 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-07-12 03:20:18,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 03:20:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-07-12 03:20:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:20:18,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:18,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:18,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:20:18,874 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2022-07-12 03:20:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:18,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747451245] [2022-07-12 03:20:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:18,962 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 03:20:18,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:18,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747451245] [2022-07-12 03:20:18,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747451245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:18,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:18,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765699912] [2022-07-12 03:20:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:18,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:18,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:18,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:18,965 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 03:20:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:19,044 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-07-12 03:20:19,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:20:19,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 03:20:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:19,045 INFO L225 Difference]: With dead ends: 55 [2022-07-12 03:20:19,045 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 03:20:19,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 03:20:19,046 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:19,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 03:20:19,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-07-12 03:20:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 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 03:20:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-07-12 03:20:19,062 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 14 [2022-07-12 03:20:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:19,062 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-07-12 03:20:19,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 03:20:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-07-12 03:20:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:20:19,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:19,063 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:19,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:20:19,064 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:19,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2022-07-12 03:20:19,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:19,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652775270] [2022-07-12 03:20:19,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:19,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:19,123 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 03:20:19,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:19,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652775270] [2022-07-12 03:20:19,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652775270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:19,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433081069] [2022-07-12 03:20:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:19,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:19,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:19,126 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 03:20:19,127 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 03:20:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:19,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 03:20:19,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:19,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:19,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:19,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:19,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-12 03:20:19,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:19,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:19,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:19,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-12 03:20:19,386 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 03:20:19,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:19,394 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 22 treesize of output 10 [2022-07-12 03:20:19,398 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 03:20:19,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:19,450 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 03:20:19,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433081069] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:19,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:19,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-12 03:20:19,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608480568] [2022-07-12 03:20:19,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:19,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:20:19,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:19,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:20:19,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:19,453 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 03:20:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:19,602 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-07-12 03:20:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 03:20:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:19,602 INFO L225 Difference]: With dead ends: 59 [2022-07-12 03:20:19,602 INFO L226 Difference]: Without dead ends: 37 [2022-07-12 03:20:19,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:20:19,603 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:19,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 129 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-12 03:20:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-12 03:20:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 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 03:20:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-07-12 03:20:19,606 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 17 [2022-07-12 03:20:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:19,606 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-07-12 03:20:19,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 03:20:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-07-12 03:20:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 03:20:19,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:19,606 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] [2022-07-12 03:20:19,628 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 03:20:19,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:19,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:19,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2022-07-12 03:20:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:19,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664004738] [2022-07-12 03:20:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:19,945 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 03:20:19,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:19,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664004738] [2022-07-12 03:20:19,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664004738] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:19,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590581126] [2022-07-12 03:20:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:19,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:19,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:19,947 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 03:20:19,987 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 03:20:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:20,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 03:20:20,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:20,081 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 03:20:20,084 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 13 treesize of output 9 [2022-07-12 03:20:20,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:20,122 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-07-12 03:20:20,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:20,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:20,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:20,129 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 03:20:20,134 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-07-12 03:20:20,139 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 50 treesize of output 30 [2022-07-12 03:20:20,142 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 18 treesize of output 16 [2022-07-12 03:20:20,154 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:20:20,155 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 03:20:20,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:20,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:20,204 INFO L356 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2022-07-12 03:20:20,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-07-12 03:20:20,214 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:20:20,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:20:20,271 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 03:20:20,273 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 03:20:20,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:20,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:20,320 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 33 treesize of output 34 [2022-07-12 03:20:20,326 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 71 treesize of output 51 [2022-07-12 03:20:20,330 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 22 [2022-07-12 03:20:20,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:20,504 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 60 treesize of output 52 [2022-07-12 03:20:20,507 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 97 treesize of output 85 [2022-07-12 03:20:20,512 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 42 treesize of output 38 [2022-07-12 03:20:20,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:20,637 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 66 treesize of output 58 [2022-07-12 03:20:20,640 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 110 treesize of output 98 [2022-07-12 03:20:20,643 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 40 treesize of output 36 [2022-07-12 03:20:21,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:21,249 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:20:21,249 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2022-07-12 03:20:21,250 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 03:20:21,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590581126] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:21,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:21,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-12 03:20:21,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490060265] [2022-07-12 03:20:21,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:21,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:20:21,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:21,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:20:21,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=116, Unknown=1, NotChecked=0, Total=156 [2022-07-12 03:20:21,252 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 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 03:20:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:21,441 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-12 03:20:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:20:21,442 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 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 21 [2022-07-12 03:20:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:21,442 INFO L225 Difference]: With dead ends: 49 [2022-07-12 03:20:21,442 INFO L226 Difference]: Without dead ends: 47 [2022-07-12 03:20:21,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=192, Unknown=1, NotChecked=0, Total=272 [2022-07-12 03:20:21,443 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:21,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 123 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 97 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-07-12 03:20:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-12 03:20:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-07-12 03:20:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 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 03:20:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-12 03:20:21,446 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2022-07-12 03:20:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:21,446 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-12 03:20:21,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 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 03:20:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-12 03:20:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:20:21,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:21,446 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] [2022-07-12 03:20:21,473 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 03:20:21,647 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,SelfDestructingSolverStorable7 [2022-07-12 03:20:21,647 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:21,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2022-07-12 03:20:21,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:21,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737721785] [2022-07-12 03:20:21,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:21,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:21,801 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 03:20:21,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:21,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737721785] [2022-07-12 03:20:21,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737721785] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:21,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98220546] [2022-07-12 03:20:21,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:21,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:21,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:21,803 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 03:20:21,836 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 03:20:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:21,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-12 03:20:21,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:21,932 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 03:20:21,966 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-07-12 03:20:21,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-07-12 03:20:21,983 INFO L356 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-07-12 03:20:21,984 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 2 case distinctions, treesize of input 90 treesize of output 78 [2022-07-12 03:20:21,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:21,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:21,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:21,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:21,991 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 28 treesize of output 25 [2022-07-12 03:20:21,994 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 30 treesize of output 28 [2022-07-12 03:20:22,006 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-12 03:20:22,006 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 25 treesize of output 29 [2022-07-12 03:20:22,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:22,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:22,058 INFO L356 Elim1Store]: treesize reduction 59, result has 25.3 percent of original size [2022-07-12 03:20:22,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 104 [2022-07-12 03:20:22,063 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-07-12 03:20:22,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:22,108 INFO L356 Elim1Store]: treesize reduction 156, result has 30.4 percent of original size [2022-07-12 03:20:22,109 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 03:20:22,131 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 03:20:22,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:22,310 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_37| input size 67 context size 67 output size 67 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) 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 03:20:22,314 INFO L158 Benchmark]: Toolchain (without parser) took 5463.17ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 77.7MB in the beginning and 57.1MB in the end (delta: 20.6MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2022-07-12 03:20:22,314 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 39.7MB in the beginning and 39.6MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:20:22,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.26ms. Allocated memory is still 109.1MB. Free memory was 77.1MB in the beginning and 76.5MB in the end (delta: 616.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:20:22,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.33ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:20:22,315 INFO L158 Benchmark]: Boogie Preprocessor took 42.33ms. Allocated memory is still 109.1MB. Free memory was 74.4MB in the beginning and 72.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:20:22,315 INFO L158 Benchmark]: RCFGBuilder took 427.19ms. Allocated memory is still 109.1MB. Free memory was 72.7MB in the beginning and 55.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 03:20:22,315 INFO L158 Benchmark]: TraceAbstraction took 4630.39ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 55.0MB in the beginning and 57.1MB in the end (delta: -2.1MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2022-07-12 03:20:22,316 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.17ms. Allocated memory is still 83.9MB. Free memory was 39.7MB in the beginning and 39.6MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.26ms. Allocated memory is still 109.1MB. Free memory was 77.1MB in the beginning and 76.5MB in the end (delta: 616.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.33ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.33ms. Allocated memory is still 109.1MB. Free memory was 74.4MB in the beginning and 72.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 427.19ms. Allocated memory is still 109.1MB. Free memory was 72.7MB in the beginning and 55.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4630.39ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 55.0MB in the beginning and 57.1MB in the end (delta: -2.1MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_37| input size 67 context size 67 output size 67 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_37| input size 67 context size 67 output size 67: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 03:20:22,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:20:24,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:20:24,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:20:24,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:20:24,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:20:24,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:20:24,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:20:24,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:20:24,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:20:24,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:20:24,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:20:24,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:20:24,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:20:24,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:20:24,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:20:24,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:20:24,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:20:24,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:20:24,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:20:24,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:20:24,193 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:20:24,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:20:24,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:20:24,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:20:24,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:20:24,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:20:24,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:20:24,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:20:24,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:20:24,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:20:24,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:20:24,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:20:24,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:20:24,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:20:24,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:20:24,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:20:24,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:20:24,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:20:24,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:20:24,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:20:24,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:20:24,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:20:24,217 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:20:24,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:20:24,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:20:24,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:20:24,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:20:24,243 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:20:24,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:20:24,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:20:24,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:20:24,245 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:20:24,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:20:24,245 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:20:24,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:20:24,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:20:24,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:20:24,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:20:24,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:20:24,246 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:20:24,246 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:20:24,247 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:20:24,247 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:20:24,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:20:24,247 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:20:24,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:20:24,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:20:24,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:20:24,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:20:24,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:24,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:20:24,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:20:24,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:20:24,248 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:20:24,248 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:20:24,249 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:20:24,249 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:20:24,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:20:24,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:20:24,249 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 ! call(reach_error())) ) 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2022-07-12 03:20:24,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:20:24,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:20:24,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:20:24,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:20:24,532 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:20:24,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-07-12 03:20:24,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbac22652/9358ad24d1534e03b8086048458a4b4d/FLAG6f234056e [2022-07-12 03:20:25,040 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:20:25,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-07-12 03:20:25,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbac22652/9358ad24d1534e03b8086048458a4b4d/FLAG6f234056e [2022-07-12 03:20:25,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbac22652/9358ad24d1534e03b8086048458a4b4d [2022-07-12 03:20:25,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:20:25,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:20:25,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:25,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:20:25,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:20:25,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25397b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25, skipping insertion in model container [2022-07-12 03:20:25,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:20:25,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:20:25,695 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/dll-rb-cnstr_1-1.i[22569,22582] [2022-07-12 03:20:25,699 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/dll-rb-cnstr_1-1.i[22645,22658] [2022-07-12 03:20:25,700 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/dll-rb-cnstr_1-1.i[22715,22728] [2022-07-12 03:20:25,702 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/dll-rb-cnstr_1-1.i[22822,22835] [2022-07-12 03:20:25,704 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/dll-rb-cnstr_1-1.i[22894,22907] [2022-07-12 03:20:25,706 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/dll-rb-cnstr_1-1.i[23045,23058] [2022-07-12 03:20:25,706 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/dll-rb-cnstr_1-1.i[23119,23132] [2022-07-12 03:20:25,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:25,728 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:20:25,753 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/dll-rb-cnstr_1-1.i[22569,22582] [2022-07-12 03:20:25,754 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/dll-rb-cnstr_1-1.i[22645,22658] [2022-07-12 03:20:25,754 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/dll-rb-cnstr_1-1.i[22715,22728] [2022-07-12 03:20:25,755 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/dll-rb-cnstr_1-1.i[22822,22835] [2022-07-12 03:20:25,755 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/dll-rb-cnstr_1-1.i[22894,22907] [2022-07-12 03:20:25,756 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/dll-rb-cnstr_1-1.i[23045,23058] [2022-07-12 03:20:25,756 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/dll-rb-cnstr_1-1.i[23119,23132] [2022-07-12 03:20:25,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:25,776 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:20:25,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25 WrapperNode [2022-07-12 03:20:25,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:25,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:25,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:20:25,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:20:25,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,829 INFO L137 Inliner]: procedures = 122, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2022-07-12 03:20:25,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:25,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:20:25,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:20:25,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:20:25,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:20:25,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:20:25,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:20:25,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:20:25,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (1/1) ... [2022-07-12 03:20:25,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:25,891 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 03:20:25,912 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 03:20:25,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:20:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:20:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:20:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:20:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:20:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:20:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 03:20:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:20:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:20:25,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:20:26,053 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:20:26,055 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:20:26,617 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:20:26,622 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:20:26,623 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-07-12 03:20:26,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:26 BoogieIcfgContainer [2022-07-12 03:20:26,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:20:26,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:20:26,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:20:26,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:20:26,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:20:25" (1/3) ... [2022-07-12 03:20:26,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f3347e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:26, skipping insertion in model container [2022-07-12 03:20:26,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:25" (2/3) ... [2022-07-12 03:20:26,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f3347e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:26, skipping insertion in model container [2022-07-12 03:20:26,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:26" (3/3) ... [2022-07-12 03:20:26,635 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2022-07-12 03:20:26,649 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:20:26,650 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-07-12 03:20:26,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:20:26,706 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@2247ec04, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d231d70 [2022-07-12 03:20:26,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-12 03:20:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 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 03:20:26,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 03:20:26,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:26,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 03:20:26,728 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:26,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash 891569350, now seen corresponding path program 1 times [2022-07-12 03:20:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:26,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870876214] [2022-07-12 03:20:26,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:26,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:26,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:26,743 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 03:20:26,753 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 03:20:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:26,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:20:26,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:26,861 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 03:20:26,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:26,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:26,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870876214] [2022-07-12 03:20:26,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870876214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:26,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:26,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:20:26,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781254614] [2022-07-12 03:20:26,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:26,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:20:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:26,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:20:26,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:20:26,893 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:26,906 INFO L93 Difference]: Finished difference Result 90 states and 148 transitions. [2022-07-12 03:20:26,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:20:26,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 03:20:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:26,914 INFO L225 Difference]: With dead ends: 90 [2022-07-12 03:20:26,914 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 03:20:26,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:20:26,934 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:26,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 03:20:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-12 03:20:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 39 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 03:20:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-12 03:20:26,963 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 6 [2022-07-12 03:20:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:26,964 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-12 03:20:26,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-12 03:20:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 03:20:26,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:26,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 03:20:26,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:27,178 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 03:20:27,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:27,180 INFO L85 PathProgramCache]: Analyzing trace with hash 889692517, now seen corresponding path program 1 times [2022-07-12 03:20:27,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:27,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724577497] [2022-07-12 03:20:27,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:27,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:27,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:27,194 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 03:20:27,215 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 03:20:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:27,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:20:27,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:27,348 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 03:20:27,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:27,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:27,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724577497] [2022-07-12 03:20:27,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724577497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:27,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:27,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:27,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325949317] [2022-07-12 03:20:27,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:27,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:27,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:27,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:27,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:27,351 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:27,628 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-07-12 03:20:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:27,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 03:20:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:27,629 INFO L225 Difference]: With dead ends: 43 [2022-07-12 03:20:27,629 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 03:20:27,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 03:20:27,630 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 58 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:27,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 36 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 03:20:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 03:20:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-07-12 03:20:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 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 03:20:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-07-12 03:20:27,637 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 6 [2022-07-12 03:20:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:27,637 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-07-12 03:20:27,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-07-12 03:20:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 03:20:27,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:27,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:27,663 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 03:20:27,845 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 03:20:27,846 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:27,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723981, now seen corresponding path program 1 times [2022-07-12 03:20:27,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:27,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317051583] [2022-07-12 03:20:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:27,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:27,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:27,850 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 03:20:27,853 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 03:20:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:27,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:20:27,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:28,026 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 13 treesize of output 9 [2022-07-12 03:20:28,060 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 19 treesize of output 7 [2022-07-12 03:20:28,068 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 03:20:28,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:28,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:28,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317051583] [2022-07-12 03:20:28,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317051583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:28,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:28,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2324553] [2022-07-12 03:20:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:28,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:28,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:28,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:28,071 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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 03:20:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:28,460 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-07-12 03:20:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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 03:20:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:28,464 INFO L225 Difference]: With dead ends: 36 [2022-07-12 03:20:28,464 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:20:28,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 03:20:28,465 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:28,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 03:20:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:20:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-12 03:20:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 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 03:20:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-07-12 03:20:28,469 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 7 [2022-07-12 03:20:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:28,469 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-07-12 03:20:28,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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 03:20:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-07-12 03:20:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:20:28,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:28,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:28,496 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 03:20:28,679 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 03:20:28,682 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash 590587384, now seen corresponding path program 1 times [2022-07-12 03:20:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:28,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641319580] [2022-07-12 03:20:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:28,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:28,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:28,689 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 03:20:28,689 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 03:20:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:28,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 03:20:28,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:28,761 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 13 treesize of output 9 [2022-07-12 03:20:28,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 19 treesize of output 7 [2022-07-12 03:20:28,858 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 03:20:28,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:28,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:28,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641319580] [2022-07-12 03:20:28,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641319580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:28,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:28,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:28,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993206279] [2022-07-12 03:20:28,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:28,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:28,862 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 03:20:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:29,787 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-07-12 03:20:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 03:20:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:29,788 INFO L225 Difference]: With dead ends: 58 [2022-07-12 03:20:29,788 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 03:20:29,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:29,789 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:29,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 85 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 03:20:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 03:20:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2022-07-12 03:20:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 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 03:20:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-07-12 03:20:29,793 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 9 [2022-07-12 03:20:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:29,794 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-07-12 03:20:29,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 03:20:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-07-12 03:20:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:20:29,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:29,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:29,804 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 03:20:30,002 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 03:20:30,002 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:30,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1507179337, now seen corresponding path program 1 times [2022-07-12 03:20:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:30,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41034528] [2022-07-12 03:20:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:30,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:30,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:30,006 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 03:20:30,008 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 03:20:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:30,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 03:20:30,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:31,007 INFO L356 Elim1Store]: treesize reduction 147, result has 30.3 percent of original size [2022-07-12 03:20:31,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 296 [2022-07-12 03:20:32,387 INFO L356 Elim1Store]: treesize reduction 147, result has 30.3 percent of original size [2022-07-12 03:20:32,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 244 [2022-07-12 03:20:32,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:32,493 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 13 treesize of output 17 [2022-07-12 03:20:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:32,721 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 19 treesize of output 23 [2022-07-12 03:20:32,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:32,921 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 13 treesize of output 17 [2022-07-12 03:20:32,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:33,034 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 19 treesize of output 23 [2022-07-12 03:20:33,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:33,120 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 19 treesize of output 23 [2022-07-12 03:20:33,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:33,196 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 19 treesize of output 23 [2022-07-12 03:20:34,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:34,903 INFO L356 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2022-07-12 03:20:34,903 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 209 treesize of output 152 [2022-07-12 03:20:34,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:34,934 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 0 case distinctions, treesize of input 17 treesize of output 11 [2022-07-12 03:20:34,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:34,987 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 0 case distinctions, treesize of input 17 treesize of output 11 [2022-07-12 03:20:35,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:35,091 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 0 case distinctions, treesize of input 53 treesize of output 43 [2022-07-12 03:20:35,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:35,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:35,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:35,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 72 [2022-07-12 03:20:35,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:35,336 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 0 case distinctions, treesize of input 17 treesize of output 11 [2022-07-12 03:20:35,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:35,346 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-12 03:20:35,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:35,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:35,394 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-12 03:20:35,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 107 [2022-07-12 03:20:35,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:35,429 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-12 03:20:35,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:35,440 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-12 03:20:35,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:35,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:35,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:35,537 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-12 03:20:35,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 92 [2022-07-12 03:20:35,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:35,547 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-12 03:20:35,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:35,798 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-12 03:20:35,798 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 36 [2022-07-12 03:20:35,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:35,809 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-12 03:20:35,948 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 03:20:35,952 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 03:20:35,962 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 03:20:35,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:35,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:35,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41034528] [2022-07-12 03:20:35,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41034528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:35,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:35,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:35,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322051335] [2022-07-12 03:20:35,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:35,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:35,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:35,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:35,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:35,967 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:36,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:36,661 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-07-12 03:20:36,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:36,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 03:20:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:36,664 INFO L225 Difference]: With dead ends: 40 [2022-07-12 03:20:36,664 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 03:20:36,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 03:20:36,664 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:36,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 03:20:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 03:20:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-12 03:20:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 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 03:20:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-12 03:20:36,667 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 10 [2022-07-12 03:20:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:36,668 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-12 03:20:36,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-12 03:20:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:20:36,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:36,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:36,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:36,875 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 03:20:36,876 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2079156959, now seen corresponding path program 1 times [2022-07-12 03:20:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:36,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667764428] [2022-07-12 03:20:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:36,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:36,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:36,878 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 03:20:36,879 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 03:20:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:36,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 03:20:36,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:36,937 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 13 treesize of output 9 [2022-07-12 03:20:36,965 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 19 treesize of output 7 [2022-07-12 03:20:36,975 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 03:20:36,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:36,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:36,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667764428] [2022-07-12 03:20:36,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667764428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:36,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:36,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633548406] [2022-07-12 03:20:36,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:36,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:36,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:36,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:36,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:36,977 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:37,323 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-07-12 03:20:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:37,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 03:20:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:37,324 INFO L225 Difference]: With dead ends: 66 [2022-07-12 03:20:37,324 INFO L226 Difference]: Without dead ends: 54 [2022-07-12 03:20:37,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:37,325 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:37,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 81 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 03:20:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-12 03:20:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2022-07-12 03:20:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 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 03:20:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-07-12 03:20:37,330 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 13 [2022-07-12 03:20:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:37,330 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-07-12 03:20:37,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-07-12 03:20:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:20:37,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:37,331 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:37,347 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 03:20:37,541 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 03:20:37,541 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:37,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash -734247455, now seen corresponding path program 1 times [2022-07-12 03:20:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:37,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127444234] [2022-07-12 03:20:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:37,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:37,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:37,543 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 03:20:37,544 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 03:20:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:37,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:20:37,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:37,636 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-12 03:20:37,636 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 2 case distinctions, treesize of input 21 treesize of output 26 [2022-07-12 03:20:37,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:37,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:37,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:37,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-12 03:20:37,703 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 03:20:37,708 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 03:20:37,719 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 03:20:37,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:37,767 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 03:20:37,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:37,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127444234] [2022-07-12 03:20:37,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127444234] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:37,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:20:37,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-12 03:20:37,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046711194] [2022-07-12 03:20:37,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:37,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:37,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:37,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:37,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:37,769 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:38,836 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-07-12 03:20:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:38,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 03:20:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:38,839 INFO L225 Difference]: With dead ends: 55 [2022-07-12 03:20:38,839 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 03:20:38,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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 03:20:38,840 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:38,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 03:20:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 03:20:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-12 03:20:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 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 03:20:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-12 03:20:38,842 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 16 [2022-07-12 03:20:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:38,843 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-12 03:20:38,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-12 03:20:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:20:38,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:38,843 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 03:20:38,851 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 03:20:39,047 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 03:20:39,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:20:39,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:39,048 INFO L85 PathProgramCache]: Analyzing trace with hash -587248931, now seen corresponding path program 1 times [2022-07-12 03:20:39,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:39,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346064599] [2022-07-12 03:20:39,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:39,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:39,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:39,050 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 03:20:39,051 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 03:20:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:39,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 03:20:39,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:39,288 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 03:20:39,293 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 13 treesize of output 9 [2022-07-12 03:20:39,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:39,329 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-07-12 03:20:39,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:39,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:39,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:39,342 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 03:20:39,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:39,359 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 03:20:39,363 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 03:20:39,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:39,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:39,454 INFO L356 Elim1Store]: treesize reduction 236, result has 4.5 percent of original size [2022-07-12 03:20:39,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 71 [2022-07-12 03:20:39,461 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 0 case distinctions, treesize of input 53 treesize of output 53 [2022-07-12 03:20:39,467 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 126 treesize of output 94 [2022-07-12 03:20:39,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:39,475 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 28 treesize of output 26 [2022-07-12 03:20:39,480 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 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-12 03:20:39,502 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:20:39,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:20:39,667 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 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 03:20:39,678 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 03:20:39,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:39,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:39,753 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 66 treesize of output 67 [2022-07-12 03:20:39,757 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 153 treesize of output 117 [2022-07-12 03:20:39,768 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 57 treesize of output 55 [2022-07-12 03:20:39,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:39,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 144 [2022-07-12 03:20:40,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2022-07-12 03:20:40,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2022-07-12 03:21:13,210 WARN L233 SmtUtils]: Spent 23.81s on a formula simplification. DAG size of input: 163 DAG size of output: 102 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:21:35,096 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse18 (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse64)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse64))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477)))))) (.cse0 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv0 1)))) (.cse3 (not .cse13)) (.cse31 (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse63)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse63))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))))) (and (or .cse0 (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (= ~unnamed1~0~BLACK (select (select (store (store .cse1 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv4 32) v_subst_1) (= ~unnamed1~0~BLACK (select (select (store .cse1 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32))))))) .cse3) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478))) (.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (= (_ bv4 32) v_subst_1) (= ~unnamed1~0~BLACK (select (select (store (store .cse4 v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5)) (= ~unnamed1~0~BLACK (select (select (store (store (store (store .cse4 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse6 (select v_arrayElimArr_12 (_ bv12 32))) (.cse9 (store .cse7 v_ArrVal_477 v_ArrVal_506)) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse6)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse6))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse7 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse8)) (= ~unnamed1~0~BLACK (select (select (store .cse9 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse8)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse9 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse8)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse10)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse10))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (or (and (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse11)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse11))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse12)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse12))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477)))))) .cse13) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse14 (select v_arrayElimArr_12 (_ bv12 32))) (.cse17 (store .cse15 v_ArrVal_477 v_ArrVal_506)) (.cse16 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse14)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse14))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse15 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse16)) (= ~unnamed1~0~BLACK (select (select (store .cse17 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse16)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse17 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse16)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) .cse18 (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse19)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse19))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (or (and (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse20)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse20))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse21)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse21))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) .cse18 (forall ((v_ArrVal_477 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse22)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse22))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse23 (select v_arrayElimArr_12 (_ bv12 32))) (.cse26 (store .cse24 v_ArrVal_477 v_ArrVal_506)) (.cse25 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse23)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse23))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse24 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse25)) (= ~unnamed1~0~BLACK (select (select (store .cse26 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse25)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse26 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse25)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse27 (select v_arrayElimArr_12 (_ bv12 32))) (.cse30 (store .cse28 v_ArrVal_477 v_ArrVal_506)) (.cse29 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse27)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse27))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse28 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse29)) (= ~unnamed1~0~BLACK (select (select (store .cse30 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse29)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse30 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse29)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))))) .cse31) .cse13) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506)) (.cse33 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store (store .cse32 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse33)) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (= (_ bv4 32) v_subst_1) (= ~unnamed1~0~BLACK (select (select (store .cse32 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse33)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478))) (.cse35 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (= (_ bv4 32) v_subst_1) (= ~unnamed1~0~BLACK (select (select (store (store .cse34 v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse35)) (= ~unnamed1~0~BLACK (select (select (store (store (store (store .cse34 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse35)) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) .cse13) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_subst_1 (_ BitVec 32))) (or (= (_ bv4 32) v_subst_1) (forall ((v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506)) (.cse37 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store .cse36 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse37)) (= ~unnamed1~0~BLACK (select (select (store (store .cse36 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse37))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse38)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse38))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) (or (and .cse18 .cse31) .cse13) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506)) (.cse40 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store (store .cse39 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse40)) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (= (_ bv4 32) v_subst_1) (= ~unnamed1~0~BLACK (select (select (store .cse39 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse40)) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) .cse13) (or (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) .cse13) (or .cse0 (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)))) .cse3) (or .cse0 (and (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select v_arrayElimArr_12 (_ bv12 32))) (.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506)) (.cse43 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse41)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse41))) (= ~unnamed1~0~BLACK (select (select (store .cse42 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse43)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse42 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse43))))) (not (= (_ bv0 1) (bvneg (select (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1)) v_arrayElimCell_51)))))) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse44)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse44))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= (_ bv0 1) (bvneg (select (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1)) v_arrayElimCell_51))))))) .cse3) (or (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478))) (.cse46 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store .cse45 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse46)) (= ~unnamed1~0~BLACK (select (select (store (store .cse45 v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse46)) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) .cse13) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478))) (.cse48 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store .cse47 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse48)) (= ~unnamed1~0~BLACK (select (select (store (store .cse47 v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse48)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse49 (select v_arrayElimArr_12 (_ bv12 32))) (.cse52 (store .cse50 v_ArrVal_477 v_ArrVal_506)) (.cse51 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse49)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse49))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse50 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse51)) (= ~unnamed1~0~BLACK (select (select (store .cse52 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse51)) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse52 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse51)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) .cse13) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse53 (select v_arrayElimArr_12 (_ bv12 32))) (.cse56 (store .cse54 v_ArrVal_477 v_ArrVal_506)) (.cse55 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse53)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse53))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse54 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse55)) (= ~unnamed1~0~BLACK (select (select (store .cse56 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse55)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse56 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse55)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) .cse13) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse57)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse57))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (or .cse0 (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_12 (_ bv12 32))) (.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506)) (.cse60 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse58)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse58))) (= ~unnamed1~0~BLACK (select (select (store .cse59 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse60)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse59 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse60))))) .cse3) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478))) (.cse62 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store .cse61 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse62)) (= ~unnamed1~0~BLACK (select (select (store (store .cse61 v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse62)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) .cse31))) is different from true [2022-07-12 03:21:35,459 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 1 [2022-07-12 03:21:35,495 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,495 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 1 [2022-07-12 03:21:35,528 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,529 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 2 case distinctions, treesize of input 52 treesize of output 1 [2022-07-12 03:21:35,573 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 1 [2022-07-12 03:21:35,619 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,620 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 1 [2022-07-12 03:21:35,658 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,658 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 2 case distinctions, treesize of input 52 treesize of output 1 [2022-07-12 03:21:35,691 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,691 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 2 case distinctions, treesize of input 24 treesize of output 1 [2022-07-12 03:21:35,727 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 1 [2022-07-12 03:21:35,764 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,765 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 1 [2022-07-12 03:21:35,796 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,796 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 1 [2022-07-12 03:21:35,836 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,836 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 1 [2022-07-12 03:21:35,883 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,883 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 2 case distinctions, treesize of input 82 treesize of output 1 [2022-07-12 03:21:35,927 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,927 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 1 [2022-07-12 03:21:35,976 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:35,976 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 1 [2022-07-12 03:21:36,016 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,017 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 1 [2022-07-12 03:21:36,049 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,049 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 2 case distinctions, treesize of input 82 treesize of output 1 [2022-07-12 03:21:36,081 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,082 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 2 case distinctions, treesize of input 55 treesize of output 1 [2022-07-12 03:21:36,118 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,119 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 1 [2022-07-12 03:21:36,162 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 1 [2022-07-12 03:21:36,197 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,197 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 1 [2022-07-12 03:21:36,230 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 1 [2022-07-12 03:21:36,267 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,268 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 2 case distinctions, treesize of input 52 treesize of output 1 [2022-07-12 03:21:36,303 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,303 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2022-07-12 03:21:36,346 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,346 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 2 case distinctions, treesize of input 79 treesize of output 1 [2022-07-12 03:21:36,380 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,380 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 1 [2022-07-12 03:21:36,414 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,415 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 2 case distinctions, treesize of input 55 treesize of output 1 [2022-07-12 03:21:36,445 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:36,445 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 1 [2022-07-12 03:21:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 03:21:36,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:21:36,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346064599] [2022-07-12 03:21:36,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346064599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:21:36,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:21:36,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-12 03:21:36,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268051368] [2022-07-12 03:21:36,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:21:36,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 03:21:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:21:36,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 03:21:36,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=66, Unknown=3, NotChecked=16, Total=110 [2022-07-12 03:21:36,454 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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 03:21:38,643 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse18 (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse64)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse64))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477)))))) (.cse0 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv0 1)))) (.cse3 (not .cse13)) (.cse31 (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse63)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse63))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))))) (and (or .cse0 (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (= ~unnamed1~0~BLACK (select (select (store (store .cse1 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv4 32) v_subst_1) (= ~unnamed1~0~BLACK (select (select (store .cse1 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32))))))) .cse3) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478))) (.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (= (_ bv4 32) v_subst_1) (= ~unnamed1~0~BLACK (select (select (store (store .cse4 v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5)) (= ~unnamed1~0~BLACK (select (select (store (store (store (store .cse4 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse6 (select v_arrayElimArr_12 (_ bv12 32))) (.cse9 (store .cse7 v_ArrVal_477 v_ArrVal_506)) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse6)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse6))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse7 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse8)) (= ~unnamed1~0~BLACK (select (select (store .cse9 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse8)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse9 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse8)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse10)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse10))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (or (and (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse11)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse11))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse12)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse12))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477)))))) .cse13) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse14 (select v_arrayElimArr_12 (_ bv12 32))) (.cse17 (store .cse15 v_ArrVal_477 v_ArrVal_506)) (.cse16 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse14)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse14))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse15 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse16)) (= ~unnamed1~0~BLACK (select (select (store .cse17 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse16)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse17 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse16)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (= ~unnamed1~0~BLACK (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse18 (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse19)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse19))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (or (and (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse20)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse20))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse21)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse21))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) .cse18 (forall ((v_ArrVal_477 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse22)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse22))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse23 (select v_arrayElimArr_12 (_ bv12 32))) (.cse26 (store .cse24 v_ArrVal_477 v_ArrVal_506)) (.cse25 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse23)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse23))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse24 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse25)) (= ~unnamed1~0~BLACK (select (select (store .cse26 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse25)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse26 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse25)))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse27 (select v_arrayElimArr_12 (_ bv12 32))) (.cse30 (store .cse28 v_ArrVal_477 v_ArrVal_506)) (.cse29 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse27)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse27))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse28 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse29)) (= ~unnamed1~0~BLACK (select (select (store .cse30 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse29)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse30 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse29)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))))) .cse31) .cse13) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506)) (.cse33 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store (store .cse32 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse33)) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (= (_ bv4 32) v_subst_1) (= ~unnamed1~0~BLACK (select (select (store .cse32 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse33)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1)) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478))) (.cse35 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (= (_ bv4 32) v_subst_1) (= ~unnamed1~0~BLACK (select (select (store (store .cse34 v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse35)) (= ~unnamed1~0~BLACK (select (select (store (store (store (store .cse34 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse35)) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) .cse13) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_subst_1 (_ BitVec 32))) (or (= (_ bv4 32) v_subst_1) (forall ((v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506)) (.cse37 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store .cse36 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse37)) (= ~unnamed1~0~BLACK (select (select (store (store .cse36 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse37))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse38)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse38))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) (or (and .cse18 .cse31) .cse13) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506)) (.cse40 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store (store .cse39 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse40)) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_23) (bvadd (_ bv8 32) v_subst_1) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_23)) (= (_ bv4 32) v_subst_1) (= ~unnamed1~0~BLACK (select (select (store .cse39 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse40)) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) .cse13) (or (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) .cse13) (= |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (or .cse0 (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)))) .cse3) (or .cse0 (and (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select v_arrayElimArr_12 (_ bv12 32))) (.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506)) (.cse43 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse41)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse41))) (= ~unnamed1~0~BLACK (select (select (store .cse42 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse43)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse42 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse43))))) (not (= (_ bv0 1) (bvneg (select (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1)) v_arrayElimCell_51)))))) (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse44)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse44))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= (_ bv0 1) (bvneg (select (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1)) v_arrayElimCell_51))))))) .cse3) (or (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478))) (.cse46 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store .cse45 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse46)) (= ~unnamed1~0~BLACK (select (select (store (store .cse45 v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse46)) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) .cse13) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478))) (.cse48 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store .cse47 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse48)) (= ~unnamed1~0~BLACK (select (select (store (store .cse47 v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse48)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse49 (select v_arrayElimArr_12 (_ bv12 32))) (.cse52 (store .cse50 v_ArrVal_477 v_ArrVal_506)) (.cse51 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse49)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse49))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse50 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse51)) (= ~unnamed1~0~BLACK (select (select (store .cse52 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse51)) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse52 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse51)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) .cse13) (= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (or (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)))) (let ((.cse53 (select v_arrayElimArr_12 (_ bv12 32))) (.cse56 (store .cse54 v_ArrVal_477 v_ArrVal_506)) (.cse55 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse53)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse53))) (= ~unnamed1~0~BLACK (select (select (store (store (store .cse54 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse55)) (= ~unnamed1~0~BLACK (select (select (store .cse56 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse55)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse56 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse55)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))))) .cse13) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (forall ((v_arrayElimCell_51 (_ BitVec 32))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (forall ((v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select v_arrayElimArr_12 (_ bv12 32)))) (or (not (= ~unnamed1~0~BLACK .cse57)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse57))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478)) v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_51) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) (or .cse0 (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_12 (_ bv12 32))) (.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506)) (.cse60 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= ~unnamed1~0~BLACK .cse58)) (not (= v_arrayElimArr_12 (store (store v_arrayElimArr_13 (_ bv8 32) (select v_arrayElimArr_12 (_ bv8 32))) (_ bv12 32) .cse58))) (= ~unnamed1~0~BLACK (select (select (store .cse59 v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse60)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (= ~unnamed1~0~BLACK (select (select (store (store .cse59 v_arrayElimCell_51 v_ArrVal_510) v_arrayElimCell_52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~list~0#1.base|) .cse60))))) .cse3) (forall ((v_ArrVal_477 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_477) (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_478 (_ BitVec 32)) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_480 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_51 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_478))) (.cse62 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store .cse61 v_ArrVal_477 v_ArrVal_480) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse62)) (= ~unnamed1~0~BLACK (select (select (store (store .cse61 v_ArrVal_477 v_ArrVal_506) v_arrayElimCell_51 v_arrayElimArr_13) |c_ULTIMATE.start_main_~list~0#1.base|) .cse62)) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_13 (_ bv8 32)))) (not (= (select (store (store v_arrayElimArr_13 (_ bv8 32) v_DerPreprocessor_19) (bvadd (_ bv8 32) v_subst_2) ~unnamed1~0~BLACK) (_ bv8 32)) v_DerPreprocessor_19)) (not (= (select (store |c_#valid| v_ArrVal_477 (_ bv1 1)) v_arrayElimCell_51) (_ bv0 1)))))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_477))))) .cse31))) is different from true [2022-07-12 03:21:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:41,128 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-12 03:21:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:21:41,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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 19 [2022-07-12 03:21:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:41,130 INFO L225 Difference]: With dead ends: 63 [2022-07-12 03:21:41,130 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 03:21:41,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=41, Invalid=95, Unknown=4, NotChecked=42, Total=182 [2022-07-12 03:21:41,130 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:41,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 95 Unchecked, 2.1s Time] [2022-07-12 03:21:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 03:21:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-07-12 03:21:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 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 03:21:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-07-12 03:21:41,150 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 19 [2022-07-12 03:21:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:41,150 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-07-12 03:21:41,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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 03:21:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-07-12 03:21:41,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:21:41,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:41,151 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 03:21:41,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-12 03:21:41,355 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 03:21:41,356 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:21:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1809978692, now seen corresponding path program 1 times [2022-07-12 03:21:41,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:21:41,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102534744] [2022-07-12 03:21:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:41,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:21:41,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:21:41,358 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 03:21:41,359 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 03:21:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:41,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 03:21:41,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:41,674 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 19 treesize of output 7 [2022-07-12 03:21:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:21:41,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:21:41,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:21:41,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102534744] [2022-07-12 03:21:41,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102534744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:21:41,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:21:41,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:21:41,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048081566] [2022-07-12 03:21:41,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:21:41,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:21:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:21:41,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:21:41,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:21:41,804 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:42,790 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-07-12 03:21:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:21:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 03:21:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:42,795 INFO L225 Difference]: With dead ends: 63 [2022-07-12 03:21:42,795 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 03:21:42,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:21:42,795 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:42,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 74 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 03:21:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 03:21:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-07-12 03:21:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-12 03:21:42,803 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 23 [2022-07-12 03:21:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:42,803 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-12 03:21:42,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:42,803 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-12 03:21:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:21:42,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:42,804 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] [2022-07-12 03:21:42,816 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 03:21:43,012 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 03:21:43,012 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 03:21:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1120058020, now seen corresponding path program 1 times [2022-07-12 03:21:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:21:43,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231076989] [2022-07-12 03:21:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:43,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:21:43,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:21:43,014 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 03:21:43,015 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 03:21:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:43,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-12 03:21:43,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:43,265 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 03:21:43,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:43,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:43,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2022-07-12 03:21:43,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:43,536 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 0 case distinctions, treesize of input 18 treesize of output 17 [2022-07-12 03:21:43,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:43,568 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 03:21:43,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:43,600 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 03:21:43,621 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 03:21:43,865 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 03:21:43,866 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 03:21:44,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:44,825 INFO L356 Elim1Store]: treesize reduction 190, result has 12.4 percent of original size [2022-07-12 03:21:44,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:21:44,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231076989] [2022-07-12 03:21:44,827 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 03:21:44,837 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 03:21:45,027 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 03:21:45,028 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_37| input size 81 context size 81 output size 81 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.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 03:21:45,031 INFO L158 Benchmark]: Toolchain (without parser) took 79627.16ms. Allocated memory was 60.8MB in the beginning and 121.6MB in the end (delta: 60.8MB). Free memory was 38.0MB in the beginning and 73.1MB in the end (delta: -35.1MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2022-07-12 03:21:45,031 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:21:45,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.17ms. Allocated memory is still 60.8MB. Free memory was 37.8MB in the beginning and 35.1MB in the end (delta: 2.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:21:45,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.88ms. Allocated memory is still 60.8MB. Free memory was 35.1MB in the beginning and 32.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:21:45,031 INFO L158 Benchmark]: Boogie Preprocessor took 30.79ms. Allocated memory is still 60.8MB. Free memory was 32.8MB in the beginning and 30.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:21:45,031 INFO L158 Benchmark]: RCFGBuilder took 763.13ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 30.8MB in the beginning and 41.8MB in the end (delta: -10.9MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-07-12 03:21:45,032 INFO L158 Benchmark]: TraceAbstraction took 78403.88ms. Allocated memory was 73.4MB in the beginning and 121.6MB in the end (delta: 48.2MB). Free memory was 41.5MB in the beginning and 73.1MB in the end (delta: -31.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-07-12 03:21:45,032 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.14ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.17ms. Allocated memory is still 60.8MB. Free memory was 37.8MB in the beginning and 35.1MB in the end (delta: 2.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.88ms. Allocated memory is still 60.8MB. Free memory was 35.1MB in the beginning and 32.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.79ms. Allocated memory is still 60.8MB. Free memory was 32.8MB in the beginning and 30.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 763.13ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 30.8MB in the beginning and 41.8MB in the end (delta: -10.9MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 78403.88ms. Allocated memory was 73.4MB in the beginning and 121.6MB in the end (delta: 48.2MB). Free memory was 41.5MB in the beginning and 73.1MB in the end (delta: -31.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_37| input size 81 context size 81 output size 81 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_37| input size 81 context size 81 output size 81: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 03:21:45,225 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 Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_37| input size 81 context size 81 output size 81