./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ba07ae5f9ba9742e473cf2ed151649cad165d7c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ba07ae5f9ba9742e473cf2ed151649cad165d7c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:43:35,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:43:35,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:43:35,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:43:35,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:43:35,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:43:35,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:43:35,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:43:35,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:43:35,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:43:35,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:43:35,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:43:35,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:43:35,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:43:35,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:43:35,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:43:35,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:43:35,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:43:35,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:43:35,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:43:35,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:43:35,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:43:35,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:43:35,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:43:35,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:43:35,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:43:35,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:43:35,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:43:35,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:43:35,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:43:35,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:43:35,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:43:35,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:43:35,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:43:35,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:43:35,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:43:35,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:43:35,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:43:35,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:43:35,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:43:35,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:43:35,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:43:35,668 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:43:35,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:43:35,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:43:35,670 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:43:35,671 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:43:35,671 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:43:35,671 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:43:35,672 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:43:35,672 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:43:35,672 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:43:35,673 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:43:35,673 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:43:35,674 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:43:35,674 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:43:35,674 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:43:35,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:43:35,676 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:43:35,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:43:35,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:43:35,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:43:35,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:43:35,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:43:35,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:43:35,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:43:35,679 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:43:35,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:43:35,680 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:43:35,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:43:35,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:43:35,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:43:35,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:43:35,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:43:35,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:43:35,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:43:35,683 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:43:35,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:43:35,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:43:35,685 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:43:35,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:43:35,685 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8 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 -> Taipan 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 -> 1ba07ae5f9ba9742e473cf2ed151649cad165d7c [2021-10-13 07:43:35,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:43:35,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:43:35,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:43:35,977 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:43:35,978 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:43:35,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/toy.cil.c [2021-10-13 07:43:36,044 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/data/17428f719/0d8ee660e6fa4b04ae283fa10e777d2a/FLAGcbf24f6b5 [2021-10-13 07:43:36,542 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:43:36,543 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/sv-benchmarks/c/systemc/toy.cil.c [2021-10-13 07:43:36,567 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/data/17428f719/0d8ee660e6fa4b04ae283fa10e777d2a/FLAGcbf24f6b5 [2021-10-13 07:43:36,903 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/data/17428f719/0d8ee660e6fa4b04ae283fa10e777d2a [2021-10-13 07:43:36,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:43:36,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:43:36,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:43:36,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:43:36,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:43:36,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:43:36" (1/1) ... [2021-10-13 07:43:36,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdf20f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:36, skipping insertion in model container [2021-10-13 07:43:36,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:43:36" (1/1) ... [2021-10-13 07:43:36,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:43:36,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:43:37,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-13 07:43:37,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:43:37,231 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:43:37,251 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-13 07:43:37,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:43:37,356 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:43:37,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37 WrapperNode [2021-10-13 07:43:37,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:43:37,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:43:37,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:43:37,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:43:37,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (1/1) ... [2021-10-13 07:43:37,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (1/1) ... [2021-10-13 07:43:37,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:43:37,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:43:37,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:43:37,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:43:37,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (1/1) ... [2021-10-13 07:43:37,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (1/1) ... [2021-10-13 07:43:37,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (1/1) ... [2021-10-13 07:43:37,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (1/1) ... [2021-10-13 07:43:37,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (1/1) ... [2021-10-13 07:43:37,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (1/1) ... [2021-10-13 07:43:37,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (1/1) ... [2021-10-13 07:43:37,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:43:37,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:43:37,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:43:37,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:43:37,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (1/1) ... [2021-10-13 07:43:37,514 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:43:37,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:43:37,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:43:37,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:43:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:43:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:43:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:43:37,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:43:39,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:43:39,103 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-10-13 07:43:39,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:43:39 BoogieIcfgContainer [2021-10-13 07:43:39,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:43:39,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:43:39,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:43:39,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:43:39,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:43:36" (1/3) ... [2021-10-13 07:43:39,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120166c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:43:39, skipping insertion in model container [2021-10-13 07:43:39,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:37" (2/3) ... [2021-10-13 07:43:39,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120166c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:43:39, skipping insertion in model container [2021-10-13 07:43:39,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:43:39" (3/3) ... [2021-10-13 07:43:39,116 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2021-10-13 07:43:39,126 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:43:39,126 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 07:43:39,186 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:43:39,196 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:43:39,196 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 07:43:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 07:43:39,217 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:39,217 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:39,218 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash -45786040, now seen corresponding path program 1 times [2021-10-13 07:43:39,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:43:39,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774256685] [2021-10-13 07:43:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:39,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:43:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:39,477 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:43:39,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774256685] [2021-10-13 07:43:39,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774256685] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:39,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:39,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:43:39,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450778903] [2021-10-13 07:43:39,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:43:39,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:43:39,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:43:39,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:43:39,516 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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) [2021-10-13 07:43:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:39,617 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2021-10-13 07:43:39,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:43:39,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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 [2021-10-13 07:43:39,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:39,637 INFO L225 Difference]: With dead ends: 109 [2021-10-13 07:43:39,637 INFO L226 Difference]: Without dead ends: 65 [2021-10-13 07:43:39,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:43:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-13 07:43:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-10-13 07:43:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 63 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2021-10-13 07:43:39,718 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 14 [2021-10-13 07:43:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:39,718 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2021-10-13 07:43:39,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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) [2021-10-13 07:43:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2021-10-13 07:43:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:43:39,721 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:39,721 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:39,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:43:39,722 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:39,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:39,725 INFO L82 PathProgramCache]: Analyzing trace with hash -978452540, now seen corresponding path program 1 times [2021-10-13 07:43:39,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:43:39,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283394450] [2021-10-13 07:43:39,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:39,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:43:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:39,834 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:43:39,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283394450] [2021-10-13 07:43:39,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283394450] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:39,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:39,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:43:39,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997381782] [2021-10-13 07:43:39,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:43:39,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:43:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:43:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:43:39,839 INFO L87 Difference]: Start difference. First operand 64 states and 98 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:39,901 INFO L93 Difference]: Finished difference Result 116 states and 183 transitions. [2021-10-13 07:43:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:43:39,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 07:43:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:39,905 INFO L225 Difference]: With dead ends: 116 [2021-10-13 07:43:39,907 INFO L226 Difference]: Without dead ends: 81 [2021-10-13 07:43:39,908 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:43:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-13 07:43:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2021-10-13 07:43:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2021-10-13 07:43:39,920 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 22 [2021-10-13 07:43:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:39,920 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2021-10-13 07:43:39,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2021-10-13 07:43:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:43:39,922 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:39,922 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:39,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:43:39,922 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:39,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:39,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2142577232, now seen corresponding path program 1 times [2021-10-13 07:43:39,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:43:39,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655343801] [2021-10-13 07:43:39,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:39,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:43:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:40,002 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:43:40,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655343801] [2021-10-13 07:43:40,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655343801] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:40,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:40,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:43:40,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952923751] [2021-10-13 07:43:40,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:43:40,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:43:40,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:43:40,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:40,006 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:40,095 INFO L93 Difference]: Finished difference Result 122 states and 189 transitions. [2021-10-13 07:43:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:43:40,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:43:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:40,101 INFO L225 Difference]: With dead ends: 122 [2021-10-13 07:43:40,101 INFO L226 Difference]: Without dead ends: 77 [2021-10-13 07:43:40,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:43:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-10-13 07:43:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-10-13 07:43:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.547945205479452) internal successors, (113), 73 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2021-10-13 07:43:40,128 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 26 [2021-10-13 07:43:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:40,128 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2021-10-13 07:43:40,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2021-10-13 07:43:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:43:40,130 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:40,130 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:40,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:43:40,131 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:40,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2097132956, now seen corresponding path program 1 times [2021-10-13 07:43:40,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:43:40,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332792787] [2021-10-13 07:43:40,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:40,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:43:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:40,219 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:43:40,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332792787] [2021-10-13 07:43:40,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332792787] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:40,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:40,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:43:40,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668969169] [2021-10-13 07:43:40,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:43:40,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:43:40,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:43:40,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:43:40,222 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:40,260 INFO L93 Difference]: Finished difference Result 157 states and 246 transitions. [2021-10-13 07:43:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:43:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:43:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:40,262 INFO L225 Difference]: With dead ends: 157 [2021-10-13 07:43:40,269 INFO L226 Difference]: Without dead ends: 112 [2021-10-13 07:43:40,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:43:40,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-13 07:43:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2021-10-13 07:43:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 110 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 169 transitions. [2021-10-13 07:43:40,280 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 169 transitions. Word has length 26 [2021-10-13 07:43:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:40,281 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 169 transitions. [2021-10-13 07:43:40,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 169 transitions. [2021-10-13 07:43:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-13 07:43:40,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:40,291 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:40,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:43:40,292 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:40,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1514857393, now seen corresponding path program 1 times [2021-10-13 07:43:40,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:43:40,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422780044] [2021-10-13 07:43:40,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:40,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:43:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:40,410 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:43:40,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422780044] [2021-10-13 07:43:40,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422780044] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:40,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:40,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:43:40,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864835423] [2021-10-13 07:43:40,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:43:40,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:43:40,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:43:40,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:43:40,413 INFO L87 Difference]: Start difference. First operand 111 states and 169 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:40,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:40,442 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2021-10-13 07:43:40,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:43:40,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-10-13 07:43:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:40,444 INFO L225 Difference]: With dead ends: 292 [2021-10-13 07:43:40,444 INFO L226 Difference]: Without dead ends: 185 [2021-10-13 07:43:40,445 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:43:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-13 07:43:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-10-13 07:43:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.526946107784431) internal successors, (255), 167 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2021-10-13 07:43:40,461 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 41 [2021-10-13 07:43:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:40,461 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2021-10-13 07:43:40,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2021-10-13 07:43:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-13 07:43:40,463 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:40,464 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:40,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:43:40,464 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:40,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1502525099, now seen corresponding path program 1 times [2021-10-13 07:43:40,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:43:40,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614867337] [2021-10-13 07:43:40,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:40,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:43:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:40,839 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:43:40,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614867337] [2021-10-13 07:43:40,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614867337] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:43:40,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057202283] [2021-10-13 07:43:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:40,841 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:43:40,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:43:40,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:43:40,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:43:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:40,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 41 conjunts are in the unsatisfiable core [2021-10-13 07:43:40,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:43:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:43,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:43:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:47,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057202283] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:43:47,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1467573561] [2021-10-13 07:43:47,650 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2021-10-13 07:43:47,650 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 07:43:47,655 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 07:43:47,664 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 07:43:47,665 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 07:43:47,800 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,802 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:43:47,803 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,804 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 07:43:47,805 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:43:47,806 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,807 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-13 07:43:47,819 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 274 [2021-10-13 07:43:47,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,933 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,934 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:47,934 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,935 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:47,935 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:47,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,951 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,952 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:47,952 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,953 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:47,954 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:47,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,969 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,970 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:47,971 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,971 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:47,971 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:47,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,983 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,984 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:47,984 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,985 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:47,985 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:47,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:47,998 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:47,998 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:47,999 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,000 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,000 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,012 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,012 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,013 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,013 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,014 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,025 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,025 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,026 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,026 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,026 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,037 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,038 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,038 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,039 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,040 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,055 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,056 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,056 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,057 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,057 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,068 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,069 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,069 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,070 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,070 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,080 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,080 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,081 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,081 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,082 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,105 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,106 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,106 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,106 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,107 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,117 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,118 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,118 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,118 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,119 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:43:48,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:43:48,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:43:48,219 INFO L354 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2021-10-13 07:43:48,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 42 [2021-10-13 07:43:48,221 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,224 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-10-13 07:43:48,227 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,228 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-10-13 07:43:48,229 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,238 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,239 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,239 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,240 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,240 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:43:48,249 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,250 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,251 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,251 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-10-13 07:43:48,251 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:43:48,308 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:43:48,319 INFO L180 QuantifierPusher]: treesize reduction 4, result has 98.0 percent of original size [2021-10-13 07:43:48,329 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 199 [2021-10-13 07:43:48,331 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 07:43:48,331 INFO L247 ElimStorePlain]: Needed 17 recursive calls to eliminate 1 variables, input treesize:3521, output treesize:199 [2021-10-13 07:43:48,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:43:48,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:43:48,546 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#length_29| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2021-10-13 07:43:48,552 INFO L168 Benchmark]: Toolchain (without parser) took 11644.23 ms. Allocated memory was 127.9 MB in the beginning and 234.9 MB in the end (delta: 107.0 MB). Free memory was 89.3 MB in the beginning and 88.3 MB in the end (delta: 1.0 MB). Peak memory consumption was 107.9 MB. Max. memory is 16.1 GB. [2021-10-13 07:43:48,553 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 127.9 MB. Free memory was 105.9 MB in the beginning and 105.8 MB in the end (delta: 40.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:43:48,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 447.86 ms. Allocated memory is still 127.9 MB. Free memory was 89.1 MB in the beginning and 98.5 MB in the end (delta: -9.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:43:48,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.22 ms. Allocated memory is still 127.9 MB. Free memory was 98.5 MB in the beginning and 96.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:43:48,554 INFO L168 Benchmark]: Boogie Preprocessor took 62.35 ms. Allocated memory is still 127.9 MB. Free memory was 96.4 MB in the beginning and 94.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:43:48,555 INFO L168 Benchmark]: RCFGBuilder took 1609.65 ms. Allocated memory is still 127.9 MB. Free memory was 94.3 MB in the beginning and 68.8 MB in the end (delta: 25.5 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:43:48,555 INFO L168 Benchmark]: TraceAbstraction took 9440.49 ms. Allocated memory was 127.9 MB in the beginning and 234.9 MB in the end (delta: 107.0 MB). Free memory was 67.9 MB in the beginning and 88.3 MB in the end (delta: -20.3 MB). Peak memory consumption was 85.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:43:48,566 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.26 ms. Allocated memory is still 127.9 MB. Free memory was 105.9 MB in the beginning and 105.8 MB in the end (delta: 40.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 447.86 ms. Allocated memory is still 127.9 MB. Free memory was 89.1 MB in the beginning and 98.5 MB in the end (delta: -9.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.22 ms. Allocated memory is still 127.9 MB. Free memory was 98.5 MB in the beginning and 96.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.35 ms. Allocated memory is still 127.9 MB. Free memory was 96.4 MB in the beginning and 94.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1609.65 ms. Allocated memory is still 127.9 MB. Free memory was 94.3 MB in the beginning and 68.8 MB in the end (delta: 25.5 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9440.49 ms. Allocated memory was 127.9 MB in the beginning and 234.9 MB in the end (delta: 107.0 MB). Free memory was 67.9 MB in the beginning and 88.3 MB in the end (delta: -20.3 MB). Peak memory consumption was 85.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#length_29| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#length_29|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 07:43:48,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:43:51,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:43:51,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:43:51,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:43:51,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:43:51,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:43:51,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:43:51,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:43:51,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:43:51,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:43:51,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:43:51,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:43:51,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:43:51,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:43:51,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:43:51,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:43:51,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:43:51,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:43:51,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:43:51,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:43:51,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:43:51,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:43:51,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:43:51,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:43:51,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:43:51,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:43:51,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:43:51,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:43:51,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:43:51,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:43:51,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:43:51,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:43:51,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:43:51,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:43:51,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:43:51,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:43:51,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:43:51,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:43:51,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:43:51,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:43:51,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:43:51,226 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-13 07:43:51,287 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:43:51,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:43:51,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:43:51,290 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:43:51,290 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:43:51,290 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:43:51,291 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:43:51,291 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:43:51,291 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:43:51,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:43:51,294 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:43:51,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:43:51,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:43:51,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:43:51,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:43:51,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:43:51,296 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:43:51,296 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 07:43:51,297 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 07:43:51,297 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:43:51,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:43:51,297 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:43:51,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:43:51,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:43:51,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 07:43:51,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:43:51,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:43:51,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:43:51,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:43:51,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:43:51,300 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 07:43:51,300 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 07:43:51,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:43:51,301 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:43:51,301 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:43:51,302 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8 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 -> Taipan 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 -> 1ba07ae5f9ba9742e473cf2ed151649cad165d7c [2021-10-13 07:43:51,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:43:51,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:43:51,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:43:51,772 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:43:51,773 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:43:51,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/toy.cil.c [2021-10-13 07:43:51,837 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/data/4486aa1d3/b02b32fe7803418f836eacbd30875d2e/FLAGae9dab3d0 [2021-10-13 07:43:52,372 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:43:52,372 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/sv-benchmarks/c/systemc/toy.cil.c [2021-10-13 07:43:52,388 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/data/4486aa1d3/b02b32fe7803418f836eacbd30875d2e/FLAGae9dab3d0 [2021-10-13 07:43:52,717 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/data/4486aa1d3/b02b32fe7803418f836eacbd30875d2e [2021-10-13 07:43:52,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:43:52,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:43:52,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:43:52,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:43:52,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:43:52,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:43:52" (1/1) ... [2021-10-13 07:43:52,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f5b37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:52, skipping insertion in model container [2021-10-13 07:43:52,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:43:52" (1/1) ... [2021-10-13 07:43:52,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:43:52,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:43:52,931 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-13 07:43:53,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:43:53,075 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:43:53,088 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-13 07:43:53,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:43:53,162 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:43:53,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53 WrapperNode [2021-10-13 07:43:53,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:43:53,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:43:53,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:43:53,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:43:53,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (1/1) ... [2021-10-13 07:43:53,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (1/1) ... [2021-10-13 07:43:53,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:43:53,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:43:53,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:43:53,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:43:53,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (1/1) ... [2021-10-13 07:43:53,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (1/1) ... [2021-10-13 07:43:53,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (1/1) ... [2021-10-13 07:43:53,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (1/1) ... [2021-10-13 07:43:53,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (1/1) ... [2021-10-13 07:43:53,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (1/1) ... [2021-10-13 07:43:53,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (1/1) ... [2021-10-13 07:43:53,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:43:53,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:43:53,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:43:53,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:43:53,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (1/1) ... [2021-10-13 07:43:53,291 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:43:53,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:43:53,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:43:53,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:43:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 07:43:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:43:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:43:53,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:43:54,070 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:43:54,071 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-10-13 07:43:54,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:43:54 BoogieIcfgContainer [2021-10-13 07:43:54,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:43:54,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:43:54,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:43:54,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:43:54,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:43:52" (1/3) ... [2021-10-13 07:43:54,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a49dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:43:54, skipping insertion in model container [2021-10-13 07:43:54,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:53" (2/3) ... [2021-10-13 07:43:54,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a49dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:43:54, skipping insertion in model container [2021-10-13 07:43:54,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:43:54" (3/3) ... [2021-10-13 07:43:54,083 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2021-10-13 07:43:54,089 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:43:54,093 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 07:43:54,167 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:43:54,176 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:43:54,177 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 07:43:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:43:54,223 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:54,224 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:54,224 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:54,244 INFO L82 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2021-10-13 07:43:54,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:43:54,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146715944] [2021-10-13 07:43:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:54,266 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:43:54,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:43:54,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:43:54,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 07:43:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:54,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:43:54,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:43:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:54,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:43:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:54,851 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:43:54,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146715944] [2021-10-13 07:43:54,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146715944] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:54,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:54,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:43:54,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685869163] [2021-10-13 07:43:54,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:43:54,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:43:54,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:43:54,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:43:54,888 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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) [2021-10-13 07:43:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:54,973 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2021-10-13 07:43:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:43:54,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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) Word has length 36 [2021-10-13 07:43:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:54,991 INFO L225 Difference]: With dead ends: 244 [2021-10-13 07:43:54,991 INFO L226 Difference]: Without dead ends: 122 [2021-10-13 07:43:54,995 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:43:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-13 07:43:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-13 07:43:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.7768595041322315) internal successors, (215), 121 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2021-10-13 07:43:55,049 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36 [2021-10-13 07:43:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:55,050 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2021-10-13 07:43:55,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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) [2021-10-13 07:43:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2021-10-13 07:43:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:43:55,058 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:55,058 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:55,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:43:55,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:43:55,270 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2021-10-13 07:43:55,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:43:55,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018886635] [2021-10-13 07:43:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:55,275 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:43:55,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:43:55,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:43:55,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 07:43:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:55,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:43:55,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:43:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:55,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:43:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:55,686 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:43:55,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018886635] [2021-10-13 07:43:55,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018886635] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:55,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:55,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:43:55,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27780210] [2021-10-13 07:43:55,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:43:55,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:43:55,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:43:55,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:55,693 INFO L87 Difference]: Start difference. First operand 122 states and 215 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:55,746 INFO L93 Difference]: Finished difference Result 234 states and 414 transitions. [2021-10-13 07:43:55,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:43:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 07:43:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:55,754 INFO L225 Difference]: With dead ends: 234 [2021-10-13 07:43:55,757 INFO L226 Difference]: Without dead ends: 122 [2021-10-13 07:43:55,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-13 07:43:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-13 07:43:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.7685950413223142) internal successors, (214), 121 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 214 transitions. [2021-10-13 07:43:55,775 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 214 transitions. Word has length 36 [2021-10-13 07:43:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:55,775 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 214 transitions. [2021-10-13 07:43:55,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 214 transitions. [2021-10-13 07:43:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:43:55,778 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:55,778 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:55,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:43:55,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:43:55,990 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2021-10-13 07:43:55,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:43:55,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301783726] [2021-10-13 07:43:55,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:55,992 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:43:55,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:43:56,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:43:56,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 07:43:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:56,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 07:43:56,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:43:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:56,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:43:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:56,368 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:43:56,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301783726] [2021-10-13 07:43:56,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301783726] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:56,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:56,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:43:56,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016620676] [2021-10-13 07:43:56,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:43:56,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:43:56,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:43:56,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:56,373 INFO L87 Difference]: Start difference. First operand 122 states and 214 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:56,464 INFO L93 Difference]: Finished difference Result 233 states and 411 transitions. [2021-10-13 07:43:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:43:56,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 07:43:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:56,468 INFO L225 Difference]: With dead ends: 233 [2021-10-13 07:43:56,471 INFO L226 Difference]: Without dead ends: 122 [2021-10-13 07:43:56,472 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-13 07:43:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-13 07:43:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.7024793388429753) internal successors, (206), 121 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 206 transitions. [2021-10-13 07:43:56,505 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 206 transitions. Word has length 36 [2021-10-13 07:43:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:56,505 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 206 transitions. [2021-10-13 07:43:56,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 206 transitions. [2021-10-13 07:43:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:43:56,509 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:56,509 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:56,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 07:43:56,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:43:56,714 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:56,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:56,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2021-10-13 07:43:56,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:43:56,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641027897] [2021-10-13 07:43:56,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:56,715 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:43:56,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:43:56,719 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:43:56,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 07:43:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:56,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:43:56,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:43:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:56,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:43:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:57,057 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:43:57,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641027897] [2021-10-13 07:43:57,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641027897] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:57,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:57,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:43:57,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653972067] [2021-10-13 07:43:57,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:43:57,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:43:57,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:43:57,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:57,060 INFO L87 Difference]: Start difference. First operand 122 states and 206 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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) [2021-10-13 07:43:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:57,125 INFO L93 Difference]: Finished difference Result 232 states and 394 transitions. [2021-10-13 07:43:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:43:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 07:43:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:57,128 INFO L225 Difference]: With dead ends: 232 [2021-10-13 07:43:57,128 INFO L226 Difference]: Without dead ends: 122 [2021-10-13 07:43:57,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-13 07:43:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-13 07:43:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.6528925619834711) internal successors, (200), 121 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 200 transitions. [2021-10-13 07:43:57,150 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 200 transitions. Word has length 36 [2021-10-13 07:43:57,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:57,151 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 200 transitions. [2021-10-13 07:43:57,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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) [2021-10-13 07:43:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 200 transitions. [2021-10-13 07:43:57,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:43:57,153 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:57,153 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:57,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 07:43:57,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:43:57,354 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1098350132, now seen corresponding path program 1 times [2021-10-13 07:43:57,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:43:57,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410268494] [2021-10-13 07:43:57,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:57,356 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:43:57,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:43:57,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:43:57,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 07:43:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:57,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 07:43:57,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:43:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:57,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:43:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:57,759 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:43:57,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410268494] [2021-10-13 07:43:57,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410268494] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:57,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:57,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:43:57,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888150299] [2021-10-13 07:43:57,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:43:57,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:43:57,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:43:57,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:57,763 INFO L87 Difference]: Start difference. First operand 122 states and 200 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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) [2021-10-13 07:43:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:57,804 INFO L93 Difference]: Finished difference Result 231 states and 381 transitions. [2021-10-13 07:43:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:43:57,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 07:43:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:57,807 INFO L225 Difference]: With dead ends: 231 [2021-10-13 07:43:57,807 INFO L226 Difference]: Without dead ends: 122 [2021-10-13 07:43:57,808 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-13 07:43:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-13 07:43:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.603305785123967) internal successors, (194), 121 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2021-10-13 07:43:57,822 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 36 [2021-10-13 07:43:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:57,823 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2021-10-13 07:43:57,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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) [2021-10-13 07:43:57,823 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2021-10-13 07:43:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:43:57,825 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:57,825 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:57,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:43:58,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:43:58,038 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1670308876, now seen corresponding path program 1 times [2021-10-13 07:43:58,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:43:58,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402159793] [2021-10-13 07:43:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:58,039 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:43:58,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:43:58,042 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:43:58,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 07:43:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:58,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:43:58,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:43:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:58,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:43:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:58,470 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:43:58,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402159793] [2021-10-13 07:43:58,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402159793] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:58,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:58,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:43:58,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705051654] [2021-10-13 07:43:58,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:43:58,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:43:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:43:58,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:58,473 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:58,561 INFO L93 Difference]: Finished difference Result 354 states and 563 transitions. [2021-10-13 07:43:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:43:58,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 36 [2021-10-13 07:43:58,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:58,565 INFO L225 Difference]: With dead ends: 354 [2021-10-13 07:43:58,565 INFO L226 Difference]: Without dead ends: 246 [2021-10-13 07:43:58,569 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-13 07:43:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2021-10-13 07:43:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.5679012345679013) internal successors, (381), 243 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 381 transitions. [2021-10-13 07:43:58,613 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 381 transitions. Word has length 36 [2021-10-13 07:43:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:58,616 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 381 transitions. [2021-10-13 07:43:58,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 381 transitions. [2021-10-13 07:43:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:43:58,623 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:58,623 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:58,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-13 07:43:58,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:43:58,842 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:58,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1194404470, now seen corresponding path program 1 times [2021-10-13 07:43:58,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:43:58,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301240880] [2021-10-13 07:43:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:58,844 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:43:58,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:43:58,845 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:43:58,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 07:43:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:59,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:43:59,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:43:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:59,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:43:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:59,241 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:43:59,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301240880] [2021-10-13 07:43:59,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301240880] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:43:59,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:43:59,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:43:59,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117191573] [2021-10-13 07:43:59,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:43:59,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:43:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:43:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:59,244 INFO L87 Difference]: Start difference. First operand 244 states and 381 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:43:59,331 INFO L93 Difference]: Finished difference Result 788 states and 1247 transitions. [2021-10-13 07:43:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:43:59,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 07:43:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:43:59,337 INFO L225 Difference]: With dead ends: 788 [2021-10-13 07:43:59,337 INFO L226 Difference]: Without dead ends: 570 [2021-10-13 07:43:59,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:43:59,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-10-13 07:43:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2021-10-13 07:43:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.570409982174688) internal successors, (881), 561 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 881 transitions. [2021-10-13 07:43:59,412 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 881 transitions. Word has length 36 [2021-10-13 07:43:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:43:59,412 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 881 transitions. [2021-10-13 07:43:59,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:43:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 881 transitions. [2021-10-13 07:43:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:43:59,415 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:43:59,415 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:43:59,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 07:43:59,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:43:59,629 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:43:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:43:59,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2021-10-13 07:43:59,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:43:59,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893824086] [2021-10-13 07:43:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:43:59,630 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:43:59,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:43:59,631 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:43:59,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 07:43:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:43:59,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:43:59,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:43:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:43:59,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:00,047 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:00,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893824086] [2021-10-13 07:44:00,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893824086] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:00,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:00,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:00,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391098638] [2021-10-13 07:44:00,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:00,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:00,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:00,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:00,049 INFO L87 Difference]: Start difference. First operand 562 states and 881 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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) [2021-10-13 07:44:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:00,152 INFO L93 Difference]: Finished difference Result 1244 states and 1956 transitions. [2021-10-13 07:44:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:00,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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) Word has length 36 [2021-10-13 07:44:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:00,158 INFO L225 Difference]: With dead ends: 1244 [2021-10-13 07:44:00,158 INFO L226 Difference]: Without dead ends: 710 [2021-10-13 07:44:00,159 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-10-13 07:44:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 708. [2021-10-13 07:44:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.5530410183875532) internal successors, (1098), 707 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1098 transitions. [2021-10-13 07:44:00,210 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1098 transitions. Word has length 36 [2021-10-13 07:44:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:00,211 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 1098 transitions. [2021-10-13 07:44:00,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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) [2021-10-13 07:44:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1098 transitions. [2021-10-13 07:44:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 07:44:00,213 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:00,213 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:00,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:00,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:00,426 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:00,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:00,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1648654786, now seen corresponding path program 1 times [2021-10-13 07:44:00,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:00,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095164790] [2021-10-13 07:44:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:00,428 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:00,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:00,429 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:00,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 07:44:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:00,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:00,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:00,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:00,946 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:00,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095164790] [2021-10-13 07:44:00,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095164790] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:00,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:00,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:00,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603339244] [2021-10-13 07:44:00,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:00,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:00,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:00,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:00,949 INFO L87 Difference]: Start difference. First operand 708 states and 1098 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 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) [2021-10-13 07:44:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:01,039 INFO L93 Difference]: Finished difference Result 1738 states and 2731 transitions. [2021-10-13 07:44:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:01,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-13 07:44:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:01,049 INFO L225 Difference]: With dead ends: 1738 [2021-10-13 07:44:01,050 INFO L226 Difference]: Without dead ends: 1084 [2021-10-13 07:44:01,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-10-13 07:44:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1082. [2021-10-13 07:44:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1081 states have (on average 1.5605920444033303) internal successors, (1687), 1081 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1687 transitions. [2021-10-13 07:44:01,142 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1687 transitions. Word has length 46 [2021-10-13 07:44:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:01,142 INFO L470 AbstractCegarLoop]: Abstraction has 1082 states and 1687 transitions. [2021-10-13 07:44:01,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 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) [2021-10-13 07:44:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2021-10-13 07:44:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 07:44:01,145 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:01,145 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:01,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:01,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:01,358 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1400508292, now seen corresponding path program 1 times [2021-10-13 07:44:01,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:01,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240999018] [2021-10-13 07:44:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:01,359 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:01,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:01,360 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:01,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-13 07:44:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:01,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:44:01,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:44:01,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:44:01,789 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:01,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240999018] [2021-10-13 07:44:01,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240999018] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:01,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:01,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:01,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144879641] [2021-10-13 07:44:01,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:01,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:01,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:01,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:01,792 INFO L87 Difference]: Start difference. First operand 1082 states and 1687 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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) [2021-10-13 07:44:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:01,887 INFO L93 Difference]: Finished difference Result 2066 states and 3248 transitions. [2021-10-13 07:44:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:01,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-13 07:44:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:01,895 INFO L225 Difference]: With dead ends: 2066 [2021-10-13 07:44:01,895 INFO L226 Difference]: Without dead ends: 1038 [2021-10-13 07:44:01,897 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-10-13 07:44:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2021-10-13 07:44:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.5718418514946961) internal successors, (1630), 1037 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1630 transitions. [2021-10-13 07:44:01,996 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1630 transitions. Word has length 46 [2021-10-13 07:44:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:01,996 INFO L470 AbstractCegarLoop]: Abstraction has 1038 states and 1630 transitions. [2021-10-13 07:44:01,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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) [2021-10-13 07:44:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1630 transitions. [2021-10-13 07:44:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 07:44:01,999 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:01,999 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:02,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:02,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:02,212 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:02,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:02,213 INFO L82 PathProgramCache]: Analyzing trace with hash 666181047, now seen corresponding path program 1 times [2021-10-13 07:44:02,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:02,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608773708] [2021-10-13 07:44:02,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:02,214 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:02,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:02,215 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:02,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-13 07:44:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:02,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:02,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:02,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:02,698 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:02,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608773708] [2021-10-13 07:44:02,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608773708] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:02,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:02,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:02,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675813732] [2021-10-13 07:44:02,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:02,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:02,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:02,700 INFO L87 Difference]: Start difference. First operand 1038 states and 1630 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:02,821 INFO L93 Difference]: Finished difference Result 2612 states and 4164 transitions. [2021-10-13 07:44:02,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:02,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-10-13 07:44:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:02,833 INFO L225 Difference]: With dead ends: 2612 [2021-10-13 07:44:02,833 INFO L226 Difference]: Without dead ends: 1628 [2021-10-13 07:44:02,835 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:02,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2021-10-13 07:44:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1626. [2021-10-13 07:44:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 1.5864615384615384) internal successors, (2578), 1625 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2578 transitions. [2021-10-13 07:44:02,980 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2578 transitions. Word has length 47 [2021-10-13 07:44:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:02,981 INFO L470 AbstractCegarLoop]: Abstraction has 1626 states and 2578 transitions. [2021-10-13 07:44:02,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2578 transitions. [2021-10-13 07:44:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-13 07:44:02,983 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:02,983 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:02,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-10-13 07:44:03,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:03,195 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:03,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:03,195 INFO L82 PathProgramCache]: Analyzing trace with hash -656218967, now seen corresponding path program 1 times [2021-10-13 07:44:03,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:03,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028005171] [2021-10-13 07:44:03,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:03,195 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:03,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:03,196 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:03,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-13 07:44:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:03,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:03,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:03,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:03,711 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:03,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028005171] [2021-10-13 07:44:03,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028005171] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:03,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:03,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:03,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318706465] [2021-10-13 07:44:03,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:03,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:03,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:03,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:03,714 INFO L87 Difference]: Start difference. First operand 1626 states and 2578 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:03,930 INFO L93 Difference]: Finished difference Result 4356 states and 7005 transitions. [2021-10-13 07:44:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:03,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-10-13 07:44:03,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:03,950 INFO L225 Difference]: With dead ends: 4356 [2021-10-13 07:44:03,950 INFO L226 Difference]: Without dead ends: 2788 [2021-10-13 07:44:03,953 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:03,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2021-10-13 07:44:04,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2786. [2021-10-13 07:44:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2785 states have (on average 1.601077199281867) internal successors, (4459), 2785 states have internal predecessors, (4459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 4459 transitions. [2021-10-13 07:44:04,153 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 4459 transitions. Word has length 48 [2021-10-13 07:44:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:04,153 INFO L470 AbstractCegarLoop]: Abstraction has 2786 states and 4459 transitions. [2021-10-13 07:44:04,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 4459 transitions. [2021-10-13 07:44:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-13 07:44:04,156 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:04,157 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:04,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:04,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:04,368 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:04,369 INFO L82 PathProgramCache]: Analyzing trace with hash -408072473, now seen corresponding path program 1 times [2021-10-13 07:44:04,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:04,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819392153] [2021-10-13 07:44:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:04,370 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:04,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:04,371 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:04,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-13 07:44:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:04,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:04,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:44:04,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:44:04,861 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:04,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819392153] [2021-10-13 07:44:04,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819392153] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:04,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:04,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:04,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265868752] [2021-10-13 07:44:04,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:04,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:04,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:04,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:04,863 INFO L87 Difference]: Start difference. First operand 2786 states and 4459 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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) [2021-10-13 07:44:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:05,066 INFO L93 Difference]: Finished difference Result 5470 states and 8792 transitions. [2021-10-13 07:44:05,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:05,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-10-13 07:44:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:05,083 INFO L225 Difference]: With dead ends: 5470 [2021-10-13 07:44:05,084 INFO L226 Difference]: Without dead ends: 2742 [2021-10-13 07:44:05,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2021-10-13 07:44:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2742. [2021-10-13 07:44:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2742 states, 2741 states have (on average 1.6067128785114921) internal successors, (4404), 2741 states have internal predecessors, (4404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2742 states and 4404 transitions. [2021-10-13 07:44:05,314 INFO L78 Accepts]: Start accepts. Automaton has 2742 states and 4404 transitions. Word has length 48 [2021-10-13 07:44:05,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:05,314 INFO L470 AbstractCegarLoop]: Abstraction has 2742 states and 4404 transitions. [2021-10-13 07:44:05,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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) [2021-10-13 07:44:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 4404 transitions. [2021-10-13 07:44:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-13 07:44:05,317 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:05,317 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:05,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:05,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:05,530 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:05,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:05,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2128148300, now seen corresponding path program 1 times [2021-10-13 07:44:05,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:05,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104166781] [2021-10-13 07:44:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:05,532 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:05,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:05,533 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:05,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-13 07:44:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:05,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:05,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:06,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:06,179 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:06,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104166781] [2021-10-13 07:44:06,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104166781] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:06,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:06,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:44:06,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634904568] [2021-10-13 07:44:06,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:44:06,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:06,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:44:06,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:06,181 INFO L87 Difference]: Start difference. First operand 2742 states and 4404 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:06,663 INFO L93 Difference]: Finished difference Result 9042 states and 14538 transitions. [2021-10-13 07:44:06,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:44:06,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-10-13 07:44:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:06,698 INFO L225 Difference]: With dead ends: 9042 [2021-10-13 07:44:06,698 INFO L226 Difference]: Without dead ends: 5352 [2021-10-13 07:44:06,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5352 states. [2021-10-13 07:44:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5352 to 3868. [2021-10-13 07:44:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3868 states, 3867 states have (on average 1.5963279027670028) internal successors, (6173), 3867 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 6173 transitions. [2021-10-13 07:44:07,088 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 6173 transitions. Word has length 49 [2021-10-13 07:44:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:07,089 INFO L470 AbstractCegarLoop]: Abstraction has 3868 states and 6173 transitions. [2021-10-13 07:44:07,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 6173 transitions. [2021-10-13 07:44:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-13 07:44:07,093 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:07,093 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:07,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:07,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:07,305 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:07,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1878430016, now seen corresponding path program 1 times [2021-10-13 07:44:07,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:07,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931552576] [2021-10-13 07:44:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:07,306 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:07,307 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:07,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-10-13 07:44:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:07,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:07,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:07,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:07,889 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:07,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931552576] [2021-10-13 07:44:07,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931552576] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:07,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:07,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:44:07,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691185201] [2021-10-13 07:44:07,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:44:07,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:44:07,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:07,891 INFO L87 Difference]: Start difference. First operand 3868 states and 6173 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:08,658 INFO L93 Difference]: Finished difference Result 12716 states and 20144 transitions. [2021-10-13 07:44:08,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:44:08,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 53 [2021-10-13 07:44:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:08,743 INFO L225 Difference]: With dead ends: 12716 [2021-10-13 07:44:08,743 INFO L226 Difference]: Without dead ends: 8898 [2021-10-13 07:44:08,753 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8898 states. [2021-10-13 07:44:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8898 to 6272. [2021-10-13 07:44:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 6271 states have (on average 1.5638654122149578) internal successors, (9807), 6271 states have internal predecessors, (9807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 9807 transitions. [2021-10-13 07:44:09,438 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 9807 transitions. Word has length 53 [2021-10-13 07:44:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:09,439 INFO L470 AbstractCegarLoop]: Abstraction has 6272 states and 9807 transitions. [2021-10-13 07:44:09,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 9807 transitions. [2021-10-13 07:44:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-13 07:44:09,446 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:09,446 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:09,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-10-13 07:44:09,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:09,663 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:09,664 INFO L82 PathProgramCache]: Analyzing trace with hash -753024327, now seen corresponding path program 1 times [2021-10-13 07:44:09,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:09,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983298788] [2021-10-13 07:44:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:09,664 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:09,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:09,665 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:09,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-10-13 07:44:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:10,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:10,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:44:10,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:44:10,292 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:10,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983298788] [2021-10-13 07:44:10,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983298788] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:10,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:10,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:44:10,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150890965] [2021-10-13 07:44:10,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:44:10,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:10,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:44:10,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:10,294 INFO L87 Difference]: Start difference. First operand 6272 states and 9807 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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) [2021-10-13 07:44:11,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:11,653 INFO L93 Difference]: Finished difference Result 22720 states and 35838 transitions. [2021-10-13 07:44:11,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:44:11,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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) Word has length 55 [2021-10-13 07:44:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:11,706 INFO L225 Difference]: With dead ends: 22720 [2021-10-13 07:44:11,706 INFO L226 Difference]: Without dead ends: 16451 [2021-10-13 07:44:11,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16451 states. [2021-10-13 07:44:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16451 to 10919. [2021-10-13 07:44:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10919 states, 10918 states have (on average 1.587745008243268) internal successors, (17335), 10918 states have internal predecessors, (17335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 17335 transitions. [2021-10-13 07:44:12,825 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 17335 transitions. Word has length 55 [2021-10-13 07:44:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:12,825 INFO L470 AbstractCegarLoop]: Abstraction has 10919 states and 17335 transitions. [2021-10-13 07:44:12,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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) [2021-10-13 07:44:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 17335 transitions. [2021-10-13 07:44:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-13 07:44:12,830 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:12,830 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:12,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:13,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:13,042 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:13,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash -605096400, now seen corresponding path program 1 times [2021-10-13 07:44:13,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:13,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284540209] [2021-10-13 07:44:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:13,044 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:13,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:13,047 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:13,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-10-13 07:44:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:13,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:13,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:13,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:13,843 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:13,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284540209] [2021-10-13 07:44:13,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284540209] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:13,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:13,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:13,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030134152] [2021-10-13 07:44:13,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:13,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:13,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:13,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:13,846 INFO L87 Difference]: Start difference. First operand 10919 states and 17335 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:14,689 INFO L93 Difference]: Finished difference Result 22161 states and 35136 transitions. [2021-10-13 07:44:14,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:14,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-10-13 07:44:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:14,722 INFO L225 Difference]: With dead ends: 22161 [2021-10-13 07:44:14,722 INFO L226 Difference]: Without dead ends: 11271 [2021-10-13 07:44:14,738 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2021-10-13 07:44:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 11239. [2021-10-13 07:44:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11239 states, 11238 states have (on average 1.5364833600284749) internal successors, (17267), 11238 states have internal predecessors, (17267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11239 states to 11239 states and 17267 transitions. [2021-10-13 07:44:15,688 INFO L78 Accepts]: Start accepts. Automaton has 11239 states and 17267 transitions. Word has length 86 [2021-10-13 07:44:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:15,688 INFO L470 AbstractCegarLoop]: Abstraction has 11239 states and 17267 transitions. [2021-10-13 07:44:15,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 11239 states and 17267 transitions. [2021-10-13 07:44:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-13 07:44:15,694 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:15,694 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:15,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:15,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:15,907 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash 129921275, now seen corresponding path program 1 times [2021-10-13 07:44:15,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:15,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806875720] [2021-10-13 07:44:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:15,908 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:15,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:15,909 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:15,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-10-13 07:44:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:16,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:16,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:16,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:16,849 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:16,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806875720] [2021-10-13 07:44:16,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806875720] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:16,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:16,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:16,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751039529] [2021-10-13 07:44:16,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:16,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:16,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:16,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:16,852 INFO L87 Difference]: Start difference. First operand 11239 states and 17267 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:17,618 INFO L93 Difference]: Finished difference Result 22959 states and 35212 transitions. [2021-10-13 07:44:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:17,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-10-13 07:44:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:17,648 INFO L225 Difference]: With dead ends: 22959 [2021-10-13 07:44:17,649 INFO L226 Difference]: Without dead ends: 11761 [2021-10-13 07:44:17,666 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11761 states. [2021-10-13 07:44:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11761 to 11713. [2021-10-13 07:44:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11713 states, 11712 states have (on average 1.4850580601092895) internal successors, (17393), 11712 states have internal predecessors, (17393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11713 states to 11713 states and 17393 transitions. [2021-10-13 07:44:18,601 INFO L78 Accepts]: Start accepts. Automaton has 11713 states and 17393 transitions. Word has length 87 [2021-10-13 07:44:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:18,602 INFO L470 AbstractCegarLoop]: Abstraction has 11713 states and 17393 transitions. [2021-10-13 07:44:18,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 11713 states and 17393 transitions. [2021-10-13 07:44:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-13 07:44:18,609 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:18,609 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:18,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:18,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:18,825 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:18,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:18,826 INFO L82 PathProgramCache]: Analyzing trace with hash 793269102, now seen corresponding path program 1 times [2021-10-13 07:44:18,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:18,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479282969] [2021-10-13 07:44:18,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:18,826 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:18,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:18,827 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:18,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-10-13 07:44:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:19,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:19,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:19,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:19,686 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:19,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479282969] [2021-10-13 07:44:19,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479282969] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:19,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:19,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:19,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50176684] [2021-10-13 07:44:19,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:19,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:19,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:19,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:19,688 INFO L87 Difference]: Start difference. First operand 11713 states and 17393 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:20,437 INFO L93 Difference]: Finished difference Result 23581 states and 35085 transitions. [2021-10-13 07:44:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:20,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-10-13 07:44:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:20,459 INFO L225 Difference]: With dead ends: 23581 [2021-10-13 07:44:20,459 INFO L226 Difference]: Without dead ends: 11929 [2021-10-13 07:44:20,477 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11929 states. [2021-10-13 07:44:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11929 to 9072. [2021-10-13 07:44:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9072 states, 9071 states have (on average 1.4235475691764965) internal successors, (12913), 9071 states have internal predecessors, (12913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9072 states to 9072 states and 12913 transitions. [2021-10-13 07:44:21,296 INFO L78 Accepts]: Start accepts. Automaton has 9072 states and 12913 transitions. Word has length 88 [2021-10-13 07:44:21,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:21,297 INFO L470 AbstractCegarLoop]: Abstraction has 9072 states and 12913 transitions. [2021-10-13 07:44:21,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 9072 states and 12913 transitions. [2021-10-13 07:44:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-13 07:44:21,305 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:21,305 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:21,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-10-13 07:44:21,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:21,519 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:21,520 INFO L82 PathProgramCache]: Analyzing trace with hash -831404099, now seen corresponding path program 1 times [2021-10-13 07:44:21,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:21,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132830669] [2021-10-13 07:44:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:21,520 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:21,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:21,521 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:21,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-10-13 07:44:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:22,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:22,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:44:22,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:44:22,379 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:22,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132830669] [2021-10-13 07:44:22,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132830669] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:22,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:22,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:44:22,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733987047] [2021-10-13 07:44:22,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:44:22,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:44:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:22,382 INFO L87 Difference]: Start difference. First operand 9072 states and 12913 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:23,220 INFO L93 Difference]: Finished difference Result 21308 states and 30010 transitions. [2021-10-13 07:44:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:44:23,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 89 [2021-10-13 07:44:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:23,235 INFO L225 Difference]: With dead ends: 21308 [2021-10-13 07:44:23,235 INFO L226 Difference]: Without dead ends: 11168 [2021-10-13 07:44:23,247 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11168 states. [2021-10-13 07:44:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11168 to 10832. [2021-10-13 07:44:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10832 states, 10831 states have (on average 1.348074969993537) internal successors, (14601), 10831 states have internal predecessors, (14601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10832 states to 10832 states and 14601 transitions. [2021-10-13 07:44:24,111 INFO L78 Accepts]: Start accepts. Automaton has 10832 states and 14601 transitions. Word has length 89 [2021-10-13 07:44:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:24,112 INFO L470 AbstractCegarLoop]: Abstraction has 10832 states and 14601 transitions. [2021-10-13 07:44:24,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 10832 states and 14601 transitions. [2021-10-13 07:44:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-13 07:44:24,142 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:24,142 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:24,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:24,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:24,363 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:24,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1827636855, now seen corresponding path program 1 times [2021-10-13 07:44:24,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:24,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289796132] [2021-10-13 07:44:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:24,364 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:24,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:24,365 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:24,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-10-13 07:44:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:24,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:24,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 07:44:25,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 07:44:25,406 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:25,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289796132] [2021-10-13 07:44:25,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289796132] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:25,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:25,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:25,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302482643] [2021-10-13 07:44:25,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:25,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:25,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:25,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:25,409 INFO L87 Difference]: Start difference. First operand 10832 states and 14601 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:26,036 INFO L93 Difference]: Finished difference Result 21219 states and 28599 transitions. [2021-10-13 07:44:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:26,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-10-13 07:44:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:26,047 INFO L225 Difference]: With dead ends: 21219 [2021-10-13 07:44:26,048 INFO L226 Difference]: Without dead ends: 10778 [2021-10-13 07:44:26,055 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10778 states. [2021-10-13 07:44:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10778 to 10778. [2021-10-13 07:44:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10778 states, 10777 states have (on average 1.344993968636912) internal successors, (14495), 10777 states have internal predecessors, (14495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10778 states to 10778 states and 14495 transitions. [2021-10-13 07:44:26,771 INFO L78 Accepts]: Start accepts. Automaton has 10778 states and 14495 transitions. Word has length 116 [2021-10-13 07:44:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:26,771 INFO L470 AbstractCegarLoop]: Abstraction has 10778 states and 14495 transitions. [2021-10-13 07:44:26,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 10778 states and 14495 transitions. [2021-10-13 07:44:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-13 07:44:26,791 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:26,791 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:26,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-10-13 07:44:26,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:26,993 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:26,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1827087367, now seen corresponding path program 1 times [2021-10-13 07:44:26,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:26,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491908546] [2021-10-13 07:44:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:26,994 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:26,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:26,995 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:26,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-10-13 07:44:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:27,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:27,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 07:44:27,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 07:44:28,060 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:28,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491908546] [2021-10-13 07:44:28,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491908546] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:28,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:28,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:44:28,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931718625] [2021-10-13 07:44:28,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:44:28,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:44:28,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:28,062 INFO L87 Difference]: Start difference. First operand 10778 states and 14495 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:28,714 INFO L93 Difference]: Finished difference Result 20792 states and 27997 transitions. [2021-10-13 07:44:28,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:44:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 128 [2021-10-13 07:44:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:28,730 INFO L225 Difference]: With dead ends: 20792 [2021-10-13 07:44:28,730 INFO L226 Difference]: Without dead ends: 10668 [2021-10-13 07:44:28,735 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:28,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2021-10-13 07:44:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 10666. [2021-10-13 07:44:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10666 states, 10665 states have (on average 1.3159868729488982) internal successors, (14035), 10665 states have internal predecessors, (14035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10666 states to 10666 states and 14035 transitions. [2021-10-13 07:44:29,374 INFO L78 Accepts]: Start accepts. Automaton has 10666 states and 14035 transitions. Word has length 128 [2021-10-13 07:44:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:29,375 INFO L470 AbstractCegarLoop]: Abstraction has 10666 states and 14035 transitions. [2021-10-13 07:44:29,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 10666 states and 14035 transitions. [2021-10-13 07:44:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-13 07:44:29,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:29,386 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:29,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-10-13 07:44:29,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:29,587 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:29,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:29,588 INFO L82 PathProgramCache]: Analyzing trace with hash 210660645, now seen corresponding path program 1 times [2021-10-13 07:44:29,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:29,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469527295] [2021-10-13 07:44:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:29,588 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:29,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:29,589 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:29,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-10-13 07:44:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:30,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:30,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-13 07:44:30,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-13 07:44:30,759 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:30,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469527295] [2021-10-13 07:44:30,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469527295] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:30,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:30,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:30,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593755593] [2021-10-13 07:44:30,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:30,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:30,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:30,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:30,761 INFO L87 Difference]: Start difference. First operand 10666 states and 14035 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:31,299 INFO L93 Difference]: Finished difference Result 20945 states and 27558 transitions. [2021-10-13 07:44:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:31,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 134 [2021-10-13 07:44:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:31,378 INFO L225 Difference]: With dead ends: 20945 [2021-10-13 07:44:31,378 INFO L226 Difference]: Without dead ends: 10665 [2021-10-13 07:44:31,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10665 states. [2021-10-13 07:44:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10665 to 10625. [2021-10-13 07:44:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10625 states, 10624 states have (on average 1.3132530120481927) internal successors, (13952), 10624 states have internal predecessors, (13952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 13952 transitions. [2021-10-13 07:44:32,250 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 13952 transitions. Word has length 134 [2021-10-13 07:44:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:32,251 INFO L470 AbstractCegarLoop]: Abstraction has 10625 states and 13952 transitions. [2021-10-13 07:44:32,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 13952 transitions. [2021-10-13 07:44:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-13 07:44:32,261 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:32,261 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:32,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:32,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:32,462 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:32,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:32,462 INFO L82 PathProgramCache]: Analyzing trace with hash 80634053, now seen corresponding path program 1 times [2021-10-13 07:44:32,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:32,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363099870] [2021-10-13 07:44:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:32,463 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:32,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:32,464 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:32,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-10-13 07:44:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:33,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:33,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-13 07:44:33,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-13 07:44:33,729 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:33,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363099870] [2021-10-13 07:44:33,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363099870] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:33,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:33,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:33,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082777319] [2021-10-13 07:44:33,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:33,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:33,730 INFO L87 Difference]: Start difference. First operand 10625 states and 13952 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:34,308 INFO L93 Difference]: Finished difference Result 20884 states and 27419 transitions. [2021-10-13 07:44:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 134 [2021-10-13 07:44:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:34,319 INFO L225 Difference]: With dead ends: 20884 [2021-10-13 07:44:34,319 INFO L226 Difference]: Without dead ends: 10635 [2021-10-13 07:44:34,327 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10635 states. [2021-10-13 07:44:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10635 to 10595. [2021-10-13 07:44:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10595 states, 10594 states have (on average 1.31026996413064) internal successors, (13881), 10594 states have internal predecessors, (13881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10595 states to 10595 states and 13881 transitions. [2021-10-13 07:44:34,957 INFO L78 Accepts]: Start accepts. Automaton has 10595 states and 13881 transitions. Word has length 134 [2021-10-13 07:44:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:34,957 INFO L470 AbstractCegarLoop]: Abstraction has 10595 states and 13881 transitions. [2021-10-13 07:44:34,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 10595 states and 13881 transitions. [2021-10-13 07:44:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-13 07:44:34,967 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:34,967 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:34,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:35,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:35,169 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1507420786, now seen corresponding path program 1 times [2021-10-13 07:44:35,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:35,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738698872] [2021-10-13 07:44:35,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:35,170 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:35,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:35,171 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:35,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-10-13 07:44:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:35,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:35,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-13 07:44:36,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-13 07:44:36,352 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:36,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738698872] [2021-10-13 07:44:36,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738698872] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:36,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:36,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:44:36,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482688098] [2021-10-13 07:44:36,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:44:36,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:36,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:44:36,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:36,354 INFO L87 Difference]: Start difference. First operand 10595 states and 13881 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:36,910 INFO L93 Difference]: Finished difference Result 18551 states and 24414 transitions. [2021-10-13 07:44:36,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:44:36,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2021-10-13 07:44:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:36,922 INFO L225 Difference]: With dead ends: 18551 [2021-10-13 07:44:36,922 INFO L226 Difference]: Without dead ends: 8328 [2021-10-13 07:44:36,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2021-10-13 07:44:37,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 8326. [2021-10-13 07:44:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8326 states, 8325 states have (on average 1.2804804804804806) internal successors, (10660), 8325 states have internal predecessors, (10660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 10660 transitions. [2021-10-13 07:44:37,474 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 10660 transitions. Word has length 137 [2021-10-13 07:44:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:37,474 INFO L470 AbstractCegarLoop]: Abstraction has 8326 states and 10660 transitions. [2021-10-13 07:44:37,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 10660 transitions. [2021-10-13 07:44:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-13 07:44:37,483 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:37,483 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:37,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:37,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:37,697 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1526376893, now seen corresponding path program 1 times [2021-10-13 07:44:37,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:37,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038438717] [2021-10-13 07:44:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:37,698 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:37,699 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:37,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-10-13 07:44:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:38,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:38,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-13 07:44:38,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-13 07:44:39,132 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:39,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038438717] [2021-10-13 07:44:39,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038438717] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:39,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:39,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:44:39,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15353022] [2021-10-13 07:44:39,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:44:39,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:39,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:44:39,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:39,134 INFO L87 Difference]: Start difference. First operand 8326 states and 10660 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:39,502 INFO L93 Difference]: Finished difference Result 13873 states and 17765 transitions. [2021-10-13 07:44:39,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:44:39,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 137 [2021-10-13 07:44:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:39,509 INFO L225 Difference]: With dead ends: 13873 [2021-10-13 07:44:39,509 INFO L226 Difference]: Without dead ends: 5569 [2021-10-13 07:44:39,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5569 states. [2021-10-13 07:44:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5569 to 5513. [2021-10-13 07:44:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5513 states, 5512 states have (on average 1.2467343976777938) internal successors, (6872), 5512 states have internal predecessors, (6872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5513 states to 5513 states and 6872 transitions. [2021-10-13 07:44:39,913 INFO L78 Accepts]: Start accepts. Automaton has 5513 states and 6872 transitions. Word has length 137 [2021-10-13 07:44:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:39,913 INFO L470 AbstractCegarLoop]: Abstraction has 5513 states and 6872 transitions. [2021-10-13 07:44:39,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5513 states and 6872 transitions. [2021-10-13 07:44:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-13 07:44:39,919 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:39,920 INFO L512 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:39,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-10-13 07:44:40,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:40,135 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1143751876, now seen corresponding path program 1 times [2021-10-13 07:44:40,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:40,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942303457] [2021-10-13 07:44:40,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:40,137 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:40,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:40,138 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:40,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-10-13 07:44:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:41,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:41,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-13 07:44:41,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-13 07:44:41,637 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:41,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942303457] [2021-10-13 07:44:41,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942303457] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:41,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:41,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:41,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669396676] [2021-10-13 07:44:41,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:41,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:41,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:41,638 INFO L87 Difference]: Start difference. First operand 5513 states and 6872 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:41,978 INFO L93 Difference]: Finished difference Result 10666 states and 13325 transitions. [2021-10-13 07:44:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:41,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-10-13 07:44:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:41,985 INFO L225 Difference]: With dead ends: 10666 [2021-10-13 07:44:41,985 INFO L226 Difference]: Without dead ends: 5410 [2021-10-13 07:44:41,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-10-13 07:44:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 5148. [2021-10-13 07:44:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5147 states have (on average 1.234116961336701) internal successors, (6352), 5147 states have internal predecessors, (6352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 6352 transitions. [2021-10-13 07:44:42,313 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 6352 transitions. Word has length 176 [2021-10-13 07:44:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:42,314 INFO L470 AbstractCegarLoop]: Abstraction has 5148 states and 6352 transitions. [2021-10-13 07:44:42,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 6352 transitions. [2021-10-13 07:44:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-10-13 07:44:42,317 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:42,318 INFO L512 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:42,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:42,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:42,522 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:42,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:42,522 INFO L82 PathProgramCache]: Analyzing trace with hash 709277431, now seen corresponding path program 1 times [2021-10-13 07:44:42,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:42,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958617822] [2021-10-13 07:44:42,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:42,523 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:42,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:42,525 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:42,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-10-13 07:44:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:43,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:43,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-13 07:44:43,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-13 07:44:44,108 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:44,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958617822] [2021-10-13 07:44:44,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958617822] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:44,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:44,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:44:44,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089788296] [2021-10-13 07:44:44,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:44,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:44,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:44,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:44,109 INFO L87 Difference]: Start difference. First operand 5148 states and 6352 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:44,518 INFO L93 Difference]: Finished difference Result 11237 states and 13837 transitions. [2021-10-13 07:44:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2021-10-13 07:44:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:44,526 INFO L225 Difference]: With dead ends: 11237 [2021-10-13 07:44:44,526 INFO L226 Difference]: Without dead ends: 6346 [2021-10-13 07:44:44,529 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6346 states. [2021-10-13 07:44:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6346 to 5328. [2021-10-13 07:44:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5328 states, 5327 states have (on average 1.205556598460672) internal successors, (6422), 5327 states have internal predecessors, (6422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5328 states to 5328 states and 6422 transitions. [2021-10-13 07:44:44,937 INFO L78 Accepts]: Start accepts. Automaton has 5328 states and 6422 transitions. Word has length 182 [2021-10-13 07:44:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:44,938 INFO L470 AbstractCegarLoop]: Abstraction has 5328 states and 6422 transitions. [2021-10-13 07:44:44,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5328 states and 6422 transitions. [2021-10-13 07:44:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-13 07:44:44,940 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:44,940 INFO L512 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:44,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-10-13 07:44:45,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:44:45,141 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:44:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:45,141 INFO L82 PathProgramCache]: Analyzing trace with hash 391755360, now seen corresponding path program 1 times [2021-10-13 07:44:45,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:44:45,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121433864] [2021-10-13 07:44:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:45,142 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:44:45,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:44:45,143 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:44:45,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-10-13 07:44:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:46,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:44:46,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 07:44:47,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 07:44:48,339 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:44:48,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121433864] [2021-10-13 07:44:48,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121433864] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:44:48,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [941075770] [2021-10-13 07:44:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:48,339 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:44:48,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:44:48,341 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:44:48,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2021-10-13 07:44:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:49,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-13 07:44:49,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 07:44:51,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 07:44:51,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [941075770] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:44:51,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871832875] [2021-10-13 07:44:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:51,790 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:44:51,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:44:51,792 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:44:51,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-10-13 07:44:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:53,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:44:53,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:44:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 07:44:54,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:44:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 07:44:54,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871832875] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:44:54,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:44:54,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11, 10, 11, 10] total 19 [2021-10-13 07:44:54,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740384531] [2021-10-13 07:44:54,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 07:44:54,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:44:54,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 07:44:54,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-10-13 07:44:54,783 INFO L87 Difference]: Start difference. First operand 5328 states and 6422 transitions. Second operand has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:01,644 INFO L93 Difference]: Finished difference Result 48788 states and 58012 transitions. [2021-10-13 07:45:01,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-10-13 07:45:01,645 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 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 185 [2021-10-13 07:45:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:01,699 INFO L225 Difference]: With dead ends: 48788 [2021-10-13 07:45:01,699 INFO L226 Difference]: Without dead ends: 43290 [2021-10-13 07:45:01,710 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 1134 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 2379.1ms TimeCoverageRelationStatistics Valid=693, Invalid=5469, Unknown=0, NotChecked=0, Total=6162 [2021-10-13 07:45:01,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43290 states. [2021-10-13 07:45:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43290 to 11576. [2021-10-13 07:45:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11576 states, 11575 states have (on average 1.2044060475161986) internal successors, (13941), 11575 states have internal predecessors, (13941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11576 states to 11576 states and 13941 transitions. [2021-10-13 07:45:02,891 INFO L78 Accepts]: Start accepts. Automaton has 11576 states and 13941 transitions. Word has length 185 [2021-10-13 07:45:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:02,891 INFO L470 AbstractCegarLoop]: Abstraction has 11576 states and 13941 transitions. [2021-10-13 07:45:02,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 11576 states and 13941 transitions. [2021-10-13 07:45:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-10-13 07:45:02,896 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:02,896 INFO L512 BasicCegarLoop]: trace histogram [7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:02,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:03,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:03,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-10-13 07:45:03,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:03,497 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:03,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:03,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1085364486, now seen corresponding path program 1 times [2021-10-13 07:45:03,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:03,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455403767] [2021-10-13 07:45:03,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:03,499 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:03,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:03,500 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:03,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-10-13 07:45:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:04,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:45:04,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-13 07:45:05,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-13 07:45:06,558 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:06,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455403767] [2021-10-13 07:45:06,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455403767] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:06,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1163888939] [2021-10-13 07:45:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:06,559 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:45:06,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:45:06,560 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:45:06,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2021-10-13 07:45:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:08,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:45:08,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-13 07:45:09,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-13 07:45:10,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1163888939] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:10,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098586674] [2021-10-13 07:45:10,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:10,212 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:10,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:10,213 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:45:10,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-10-13 07:45:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:12,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:45:12,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-13 07:45:13,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-13 07:45:13,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098586674] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:13,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:45:13,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10, 9] total 17 [2021-10-13 07:45:13,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592129550] [2021-10-13 07:45:13,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-13 07:45:13,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:13,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-13 07:45:13,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-10-13 07:45:13,830 INFO L87 Difference]: Start difference. First operand 11576 states and 13941 transitions. Second operand has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:21,488 INFO L93 Difference]: Finished difference Result 68253 states and 81202 transitions. [2021-10-13 07:45:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-10-13 07:45:21,489 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 0 states have call successors, (0), 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 191 [2021-10-13 07:45:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:21,570 INFO L225 Difference]: With dead ends: 68253 [2021-10-13 07:45:21,570 INFO L226 Difference]: Without dead ends: 55831 [2021-10-13 07:45:21,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1236 GetRequests, 1166 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 1361.0ms TimeCoverageRelationStatistics Valid=638, Invalid=4192, Unknown=0, NotChecked=0, Total=4830 [2021-10-13 07:45:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55831 states. [2021-10-13 07:45:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55831 to 18344. [2021-10-13 07:45:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18344 states, 18343 states have (on average 1.2105980483018044) internal successors, (22206), 18343 states have internal predecessors, (22206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18344 states to 18344 states and 22206 transitions. [2021-10-13 07:45:23,740 INFO L78 Accepts]: Start accepts. Automaton has 18344 states and 22206 transitions. Word has length 191 [2021-10-13 07:45:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:23,741 INFO L470 AbstractCegarLoop]: Abstraction has 18344 states and 22206 transitions. [2021-10-13 07:45:23,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 18344 states and 22206 transitions. [2021-10-13 07:45:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-13 07:45:23,757 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:23,758 INFO L512 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:23,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-10-13 07:45:23,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:24,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:24,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:24,359 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:24,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:24,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1502612859, now seen corresponding path program 1 times [2021-10-13 07:45:24,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:24,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495419757] [2021-10-13 07:45:24,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:24,360 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:24,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:24,361 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:24,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-10-13 07:45:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:25,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:25,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-13 07:45:26,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-13 07:45:26,737 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:26,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495419757] [2021-10-13 07:45:26,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495419757] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:26,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:26,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:26,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245615820] [2021-10-13 07:45:26,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:26,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:26,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:26,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:26,738 INFO L87 Difference]: Start difference. First operand 18344 states and 22206 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:27,328 INFO L93 Difference]: Finished difference Result 24641 states and 29721 transitions. [2021-10-13 07:45:27,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:27,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2021-10-13 07:45:27,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:27,334 INFO L225 Difference]: With dead ends: 24641 [2021-10-13 07:45:27,334 INFO L226 Difference]: Without dead ends: 5284 [2021-10-13 07:45:27,344 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5284 states. [2021-10-13 07:45:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5284 to 2805. [2021-10-13 07:45:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2804 states have (on average 1.1815263908701854) internal successors, (3313), 2804 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 3313 transitions. [2021-10-13 07:45:27,639 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 3313 transitions. Word has length 231 [2021-10-13 07:45:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:27,639 INFO L470 AbstractCegarLoop]: Abstraction has 2805 states and 3313 transitions. [2021-10-13 07:45:27,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 3313 transitions. [2021-10-13 07:45:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-10-13 07:45:27,641 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:27,641 INFO L512 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:27,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2021-10-13 07:45:27,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:27,845 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:27,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1258410680, now seen corresponding path program 1 times [2021-10-13 07:45:27,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:27,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044032468] [2021-10-13 07:45:27,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:27,846 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:27,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:27,847 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:27,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-10-13 07:45:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:29,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:29,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-10-13 07:45:29,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-10-13 07:45:30,403 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:30,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044032468] [2021-10-13 07:45:30,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044032468] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:30,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:30,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:30,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499069266] [2021-10-13 07:45:30,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:30,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:30,405 INFO L87 Difference]: Start difference. First operand 2805 states and 3313 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:30,498 INFO L93 Difference]: Finished difference Result 3182 states and 3724 transitions. [2021-10-13 07:45:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:30,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 251 [2021-10-13 07:45:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:30,499 INFO L225 Difference]: With dead ends: 3182 [2021-10-13 07:45:30,499 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 07:45:30,501 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 07:45:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 07:45:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 07:45:30,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 251 [2021-10-13 07:45:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:30,502 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 07:45:30,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 07:45:30,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 07:45:30,504 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:45:30,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-10-13 07:45:30,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:30,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 07:45:30,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:34,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:34,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:34,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:35,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:36,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:36,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:47,673 WARN L207 SmtUtils]: Spent 11.44 s on a formula simplification. DAG size of input: 2030 DAG size of output: 1980 [2021-10-13 07:45:47,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:00,272 WARN L207 SmtUtils]: Spent 12.57 s on a formula simplification. DAG size of input: 2176 DAG size of output: 2130 [2021-10-13 07:46:00,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:01,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:02,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:02,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:04,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:17,367 WARN L207 SmtUtils]: Spent 13.06 s on a formula simplification. DAG size of input: 2204 DAG size of output: 2158 [2021-10-13 07:46:17,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:17,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:18,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:20,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:34,256 WARN L207 SmtUtils]: Spent 13.62 s on a formula simplification. DAG size of input: 2176 DAG size of output: 2130 [2021-10-13 07:46:34,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:36,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:51,213 WARN L207 SmtUtils]: Spent 14.84 s on a formula simplification. DAG size of input: 2285 DAG size of output: 2233 [2021-10-13 07:46:51,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:46:57,946 WARN L207 SmtUtils]: Spent 5.78 s on a formula simplification. DAG size of input: 368 DAG size of output: 76 [2021-10-13 07:47:09,245 WARN L207 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 390 DAG size of output: 122 [2021-10-13 07:48:08,596 WARN L207 SmtUtils]: Spent 57.56 s on a formula simplification. DAG size of input: 1980 DAG size of output: 293 [2021-10-13 07:49:10,453 WARN L207 SmtUtils]: Spent 1.03 m on a formula simplification. DAG size of input: 2130 DAG size of output: 307 [2021-10-13 07:49:15,888 WARN L207 SmtUtils]: Spent 5.43 s on a formula simplification. DAG size of input: 524 DAG size of output: 96 [2021-10-13 07:49:21,489 WARN L207 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 480 DAG size of output: 88 [2021-10-13 07:49:26,714 WARN L207 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 594 DAG size of output: 104 [2021-10-13 07:49:38,702 WARN L207 SmtUtils]: Spent 11.98 s on a formula simplification. DAG size of input: 683 DAG size of output: 148 [2021-10-13 07:50:45,314 WARN L207 SmtUtils]: Spent 1.11 m on a formula simplification. DAG size of input: 2158 DAG size of output: 301 [2021-10-13 07:50:55,846 WARN L207 SmtUtils]: Spent 10.53 s on a formula simplification. DAG size of input: 556 DAG size of output: 115 [2021-10-13 07:51:09,146 WARN L207 SmtUtils]: Spent 13.29 s on a formula simplification. DAG size of input: 871 DAG size of output: 177 [2021-10-13 07:52:12,867 WARN L207 SmtUtils]: Spent 1.06 m on a formula simplification. DAG size of input: 2130 DAG size of output: 307 [2021-10-13 07:52:26,441 WARN L207 SmtUtils]: Spent 13.57 s on a formula simplification. DAG size of input: 868 DAG size of output: 175 [2021-10-13 07:53:34,121 WARN L207 SmtUtils]: Spent 1.13 m on a formula simplification. DAG size of input: 2233 DAG size of output: 301 [2021-10-13 07:53:39,776 WARN L207 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 593 DAG size of output: 104 [2021-10-13 07:53:39,779 INFO L857 garLoopResultBuilder]: For program point L498(lines 498 502) no Hoare annotation was computed. [2021-10-13 07:53:39,780 INFO L853 garLoopResultBuilder]: At program point L234-1(lines 222 249) the Hoare annotation is: (let ((.cse38 (bvadd (_ bv1 32) ~t_b~0)) (.cse39 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse8 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse31 (= .cse39 ~data~0)) (.cse33 (= .cse39 ~c_t~0)) (.cse5 (not (= (_ bv0 32) ~e_c~0))) (.cse14 (= ~data~0 .cse38)) (.cse20 (not (= ~e_wl~0 (_ bv0 32)))) (.cse12 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= .cse38 ~c_t~0)) (.cse15 (not (= ~e_wl~0 (_ bv1 32)))) (.cse36 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse18 (= ~c2_st~0 (_ bv0 32))) (.cse9 (not (= ~wl_st~0 (_ bv0 32)))) (.cse34 (= ~c1_st~0 (_ bv0 32))) (.cse35 (= ~c1_pc~0 (_ bv0 32))) (.cse37 (= ~wl_pc~0 (_ bv1 32))) (.cse30 (= ~c2_pc~0 (_ bv0 32))) (.cse22 (= ~c_req_up~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse16 (not (= (_ bv0 32) ~r_st~0))) (.cse2 (= (_ bv2 32) ~e_wl~0)) (.cse3 (= (_ bv1 32) ~wb_i~0)) (.cse4 (= ~c2_i~0 (_ bv1 32))) (.cse23 (= ~data~0 ~t_b~0)) (.cse17 (not (= ~wb_st~0 (_ bv0 32)))) (.cse6 (= (_ bv1 32) ~c2_pc~0)) (.cse7 (= (_ bv2 32) ~e_e~0)) (.cse24 (= ~d~0 (_ bv0 32))) (.cse25 (= (_ bv0 32) ~processed~0)) (.cse19 (= (_ bv2 32) ~c1_st~0)) (.cse26 (= ~wb_pc~0 (_ bv0 32))) (.cse27 (= ~data~0 (_ bv0 32))) (.cse32 (= (_ bv2 32) ~c2_st~0)) (.cse28 (= (_ bv2 32) ~e_c~0)) (.cse10 (= (_ bv2 32) ~e_g~0)) (.cse11 (= ~c1_i~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ~r_i~0)) (.cse29 (= ~wl_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13) (and .cse22 .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse23 .cse17 .cse7 .cse24 .cse18 .cse25 .cse19 .cse26 .cse27 .cse28 .cse10 .cse11 .cse13 .cse29 .cse30) (and .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse9 .cse19 .cse31 .cse32 .cse20 .cse28 .cse33 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse32 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13) (and .cse22 .cse0 .cse16 .cse2 .cse3 .cse4 .cse23 .cse17 .cse7 .cse24 .cse18 .cse25 .cse26 .cse27 .cse34 .cse35 .cse28 .cse10 .cse11 .cse13 .cse29 .cse30) (and .cse22 .cse0 .cse16 .cse2 .cse3 .cse4 .cse23 .cse17 .cse6 .cse7 .cse24 .cse25 .cse26 .cse27 .cse34 .cse32 .cse35 .cse28 .cse10 .cse11 .cse13 .cse29) (and .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse31 .cse32 .cse20 .cse33 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse36 .cse16 .cse3 .cse4 .cse23 .cse17 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse34 .cse32 .cse35 .cse28 .cse37 .cse10 .cse11 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 .cse29) (and .cse0 .cse1 .cse15 .cse36 .cse16 .cse3 .cse4 .cse23 .cse17 .cse7 .cse24 .cse18 .cse25 .cse9 .cse19 .cse26 .cse27 .cse28 .cse37 .cse10 .cse11 .cse13 .cse30) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse9 .cse19 .cse20 .cse28 .cse10 .cse11 .cse12 .cse21 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse9 .cse34 .cse32 .cse20 .cse28 .cse10 .cse11 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse15 .cse36 .cse16 .cse3 .cse4 .cse23 .cse17 .cse6 .cse7 .cse24 .cse25 .cse9 .cse19 .cse26 .cse27 .cse32 .cse28 .cse37 .cse10 .cse11 .cse13) (and .cse0 .cse15 .cse36 .cse16 .cse3 .cse4 .cse23 .cse17 .cse7 .cse24 .cse18 .cse25 .cse9 .cse26 .cse27 .cse34 .cse35 .cse28 .cse37 .cse10 .cse11 .cse13 .cse30) (and .cse22 .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse23 .cse17 .cse6 .cse7 .cse24 .cse25 .cse19 .cse26 .cse27 .cse32 .cse28 .cse10 .cse11 .cse13 .cse29)))) [2021-10-13 07:53:39,780 INFO L857 garLoopResultBuilder]: For program point L631-1(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,781 INFO L857 garLoopResultBuilder]: For program point L400(lines 400 410) no Hoare annotation was computed. [2021-10-13 07:53:39,781 INFO L857 garLoopResultBuilder]: For program point L400-2(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,781 INFO L857 garLoopResultBuilder]: For program point L301(lines 301 309) no Hoare annotation was computed. [2021-10-13 07:53:39,781 INFO L857 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2021-10-13 07:53:39,781 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 140) no Hoare annotation was computed. [2021-10-13 07:53:39,781 INFO L857 garLoopResultBuilder]: For program point L665(lines 665 673) no Hoare annotation was computed. [2021-10-13 07:53:39,782 INFO L857 garLoopResultBuilder]: For program point L599(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,782 INFO L857 garLoopResultBuilder]: For program point L566-1(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,782 INFO L857 garLoopResultBuilder]: For program point L401(lines 401 406) no Hoare annotation was computed. [2021-10-13 07:53:39,782 INFO L857 garLoopResultBuilder]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2021-10-13 07:53:39,783 INFO L853 garLoopResultBuilder]: At program point L137(lines 132 172) the Hoare annotation is: (let ((.cse29 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse26 (= ~data~0 ~t_b~0)) (.cse27 (= ~c2_st~0 (_ bv0 32))) (.cse28 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse23 (= ~wb_st~0 (_ bv0 32))) (.cse25 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse24 (= (_ bv0 32) ~processed~0)) (.cse21 (= (_ bv2 32) ~e_c~0)) (.cse2 (= (_ bv2 32) ~e_wl~0)) (.cse14 (= ~data~0 .cse29)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse15 (not (= ~e_wl~0 (_ bv1 32)))) (.cse16 (not (= (_ bv0 32) ~r_st~0))) (.cse3 (= (_ bv1 32) ~wb_i~0)) (.cse17 (not (= ~c1_st~0 (_ bv0 32)))) (.cse4 (= ~c2_i~0 (_ bv1 32))) (.cse5 (not (= (_ bv0 32) ~e_c~0))) (.cse6 (= (_ bv1 32) ~c2_pc~0)) (.cse7 (= (_ bv2 32) ~e_e~0)) (.cse18 (= (_ bv2 32) ~wb_st~0)) (.cse8 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse9 (not (= ~wl_st~0 (_ bv0 32)))) (.cse19 (= (_ bv2 32) ~c2_st~0)) (.cse20 (not (= ~e_wl~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~e_g~0)) (.cse11 (= ~c1_i~0 (_ bv1 32))) (.cse12 (= ~wb_pc~0 (_ bv1 32))) (.cse22 (= .cse29 ~c_t~0)) (.cse13 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse17 .cse4 .cse6 .cse7 .cse18 .cse9 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse22 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse17 .cse4 .cse23 .cse6 .cse7 .cse24 .cse9 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse25 .cse16 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse24 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse15 .cse25 .cse16 .cse3 .cse17 .cse4 .cse26 .cse6 .cse7 .cse18 .cse27 .cse24 .cse9 .cse20 .cse28 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse15 .cse25 .cse16 .cse3 .cse17 .cse4 .cse26 .cse5 .cse6 .cse7 .cse18 .cse8 .cse27 .cse24 .cse9 .cse20 .cse28 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse17 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse25 .cse16 .cse3 .cse17 .cse4 .cse6 .cse7 .cse18 .cse24 .cse9 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 (= ~wl_pc~0 (_ bv0 32))) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12 .cse22 .cse13)))) [2021-10-13 07:53:39,783 INFO L853 garLoopResultBuilder]: At program point L71(lines 57 127) the Hoare annotation is: (let ((.cse24 (= ~c1_st~0 (_ bv0 32))) (.cse25 (= ~c1_pc~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~wb_st~0)) (.cse21 (= ~c2_st~0 (_ bv0 32))) (.cse17 (= ~wb_pc~0 (_ bv1 32))) (.cse26 (= ~c2_pc~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse0 (not (= ~e_wl~0 (_ bv1 32)))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse19 (= ~data~0 ~t_b~0)) (.cse27 (= ~wb_st~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~c2_pc~0)) (.cse8 (= (_ bv2 32) ~e_e~0)) (.cse20 (= ~d~0 (_ bv0 32))) (.cse10 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse22 (= (_ bv0 32) ~processed~0)) (.cse11 (not (= ~wl_st~0 (_ bv0 32)))) (.cse12 (= (_ bv2 32) ~c1_st~0)) (.cse28 (= ~wb_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~c2_st~0)) (.cse14 (= (_ bv2 32) ~e_c~0)) (.cse15 (= (_ bv2 32) ~e_g~0)) (.cse16 (= ~c1_i~0 (_ bv1 32))) (.cse18 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 (or (and (= ~data~0 (bvadd (_ bv1 32) ~t_b~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) (and .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse9 .cse20 .cse10 .cse21 .cse22 .cse11 .cse23 .cse24 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse26) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse27 .cse8 .cse20 .cse10 .cse21 .cse22 .cse11 .cse12 .cse28 .cse23 .cse14 .cse15 .cse16 .cse18 .cse26) (and .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse27 .cse8 .cse20 .cse10 .cse21 .cse22 .cse11 .cse28 .cse23 .cse24 .cse25 .cse14 .cse15 .cse16 .cse18 .cse26) (and .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse27 .cse7 .cse8 .cse20 .cse10 .cse22 .cse11 .cse28 .cse23 .cse24 .cse13 .cse25 .cse14 .cse15 .cse16 .cse18) (and .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse20 .cse10 .cse22 .cse11 .cse23 .cse24 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse9 .cse20 .cse10 .cse21 .cse22 .cse11 .cse12 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse26) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse19 .cse27 .cse7 .cse8 .cse20 .cse10 .cse22 .cse11 .cse12 .cse28 .cse23 .cse13 .cse14 .cse15 .cse16 .cse18))) [2021-10-13 07:53:39,783 INFO L857 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2021-10-13 07:53:39,784 INFO L853 garLoopResultBuilder]: At program point L468(lines 461 478) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv2 32) ~e_wl~0)) (.cse2 (= (_ bv1 32) ~wb_i~0)) (.cse3 (= ~c2_i~0 (_ bv1 32))) (.cse4 (= ~wb_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~e_e~0)) (.cse6 (= ~c2_st~0 (_ bv0 32))) (.cse7 (= ~c1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~e_g~0)) (.cse9 (= ~c1_i~0 (_ bv1 32))) (.cse10 (= (_ bv0 32) ~r_i~0)) (.cse11 (= ~wl_pc~0 (_ bv0 32)))) (or (and (= ~c_req_up~0 (_ bv0 32)) (= (_ bv2 32) ~r_st~0) .cse0 .cse1 .cse2 .cse3 (= ~data~0 ~t_b~0) .cse4 .cse5 (= ~d~0 (_ bv0 32)) .cse6 (= (_ bv0 32) ~processed~0) (= ~wb_pc~0 (_ bv0 32)) (= ~data~0 (_ bv0 32)) .cse7 (= ~c1_pc~0 (_ bv0 32)) (= (_ bv2 32) ~e_c~0) .cse8 .cse9 .cse10 .cse11 (= ~c2_pc~0 (_ bv0 32))) (and .cse0 .cse1 .cse2 (= ~wl_st~0 (_ bv2 32)) .cse3 .cse4 (not (= (_ bv0 32) ~e_c~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-10-13 07:53:39,784 INFO L857 garLoopResultBuilder]: For program point L469(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,784 INFO L857 garLoopResultBuilder]: For program point L436-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,785 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-10-13 07:53:39,785 INFO L857 garLoopResultBuilder]: For program point L304-1(lines 290 388) no Hoare annotation was computed. [2021-10-13 07:53:39,785 INFO L857 garLoopResultBuilder]: For program point L668(lines 668 672) no Hoare annotation was computed. [2021-10-13 07:53:39,785 INFO L857 garLoopResultBuilder]: For program point L668-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,785 INFO L857 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2021-10-13 07:53:39,785 INFO L857 garLoopResultBuilder]: For program point L636-1(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,786 INFO L857 garLoopResultBuilder]: For program point L538(line 538) no Hoare annotation was computed. [2021-10-13 07:53:39,786 INFO L857 garLoopResultBuilder]: For program point L571-1(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,787 INFO L853 garLoopResultBuilder]: At program point L373(lines 290 388) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv1 32) ~t_b~0)) (.cse50 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse45 (= .cse50 ~c_t~0)) (.cse48 (= .cse50 ~d~0)) (.cse15 (= ~wb_pc~0 (_ bv0 32))) (.cse33 (= ~d~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse36 (= ~c~0 .cse37)) (.cse39 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse42 (= ~c1_st~0 (_ bv0 32))) (.cse43 (= ~c1_pc~0 (_ bv0 32))) (.cse40 (= ~c_req_up~0 (_ bv0 32))) (.cse44 (= ~wl_pc~0 (_ bv0 32))) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse27 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse38 (= .cse37 ~c_t~0)) (.cse47 (= ~data~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse46 (= .cse50 ~c~0)) (.cse7 (= ~data~0 ~t_b~0)) (.cse10 (= ~d~0 (_ bv0 32))) (.cse16 (= ~data~0 (_ bv0 32))) (.cse18 (= ~wl_pc~0 (_ bv1 32))) (.cse22 (= ~c2_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 .cse37)) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse41 (= (_ bv2 32) ~e_wl~0)) (.cse26 (= (_ bv2 32) ~wb_st~0)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse2 (not (= ~e_wl~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse13 (not (= ~wl_st~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= .cse50 ~data~0)) (.cse31 (= (_ bv2 32) ~c2_st~0)) (.cse28 (not (= ~e_wl~0 (_ bv0 32)))) (.cse17 (= (_ bv2 32) ~e_c~0)) (.cse19 (= (_ bv2 32) ~e_g~0)) (.cse20 (= ~c1_i~0 (_ bv1 32))) (.cse29 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse2 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse34 .cse35) (and .cse36 (= ~d~0 .cse37) .cse34 .cse38)))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse41 .cse5 .cse6 .cse24 .cse25 .cse9 .cse27 .cse13 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse0 .cse1 .cse3 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse32 .cse26 .cse10 .cse13 .cse14 .cse35 .cse31 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 .cse10 .cse35 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse2 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse41 .cse5 .cse6 .cse24 .cse9 .cse13 .cse19 .cse20 .cse21 .cse44) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21))) (and .cse2 (let ((.cse49 (or (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse35 .cse49) (and .cse36 .cse49 .cse38)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse13 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse16 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 .cse10 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)))) [2021-10-13 07:53:39,787 INFO L857 garLoopResultBuilder]: For program point L506-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,787 INFO L857 garLoopResultBuilder]: For program point L441-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,787 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 121) no Hoare annotation was computed. [2021-10-13 07:53:39,788 INFO L853 garLoopResultBuilder]: At program point L343(lines 290 388) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv1 32) ~t_b~0)) (.cse50 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse15 (= ~wb_pc~0 (_ bv0 32))) (.cse46 (= .cse50 ~c_t~0)) (.cse48 (= .cse50 ~d~0)) (.cse33 (= ~d~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse36 (= ~c~0 .cse37)) (.cse39 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse42 (= ~c1_st~0 (_ bv0 32))) (.cse43 (= ~c1_pc~0 (_ bv0 32))) (.cse40 (= ~c_req_up~0 (_ bv0 32))) (.cse44 (= ~wl_pc~0 (_ bv0 32))) (.cse47 (= ~data~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse45 (= .cse50 ~c~0)) (.cse7 (= ~data~0 ~t_b~0)) (.cse10 (= ~d~0 (_ bv0 32))) (.cse16 (= ~data~0 (_ bv0 32))) (.cse18 (= ~wl_pc~0 (_ bv1 32))) (.cse22 (= ~c2_pc~0 (_ bv0 32))) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse41 (= (_ bv2 32) ~e_wl~0)) (.cse23 (= ~data~0 .cse37)) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse26 (= (_ bv2 32) ~wb_st~0)) (.cse27 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse38 (= .cse37 ~c_t~0)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse2 (not (= ~e_wl~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse13 (not (= ~wl_st~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= .cse50 ~data~0)) (.cse31 (= (_ bv2 32) ~c2_st~0)) (.cse28 (not (= ~e_wl~0 (_ bv0 32)))) (.cse17 (= (_ bv2 32) ~e_c~0)) (.cse19 (= (_ bv2 32) ~e_g~0)) (.cse20 (= ~c1_i~0 (_ bv1 32))) (.cse29 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse2 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse34 .cse35) (and .cse36 (= ~d~0 .cse37) .cse34 .cse38)))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse41 .cse5 .cse6 .cse24 .cse25 .cse9 .cse27 .cse13 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse0 .cse1 .cse3 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse32 .cse26 .cse10 .cse13 .cse14 .cse35 .cse31 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 .cse10 .cse35 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse2 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse41 .cse5 .cse6 .cse24 .cse9 .cse13 .cse19 .cse20 .cse21 .cse44) (and .cse2 (let ((.cse49 (or (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse35 .cse49) (and .cse36 .cse49 .cse38)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse13 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse16 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 .cse10 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)))) [2021-10-13 07:53:39,788 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 186) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L608(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L641-1(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 384) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L609(lines 609 613) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L576-1(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L411-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 120) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2021-10-13 07:53:39,789 INFO L853 garLoopResultBuilder]: At program point L709(lines 684 711) the Hoare annotation is: (= ~c2_i~0 (_ bv1 32)) [2021-10-13 07:53:39,789 INFO L857 garLoopResultBuilder]: For program point L544(lines 544 554) no Hoare annotation was computed. [2021-10-13 07:53:39,790 INFO L857 garLoopResultBuilder]: For program point L511-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,790 INFO L857 garLoopResultBuilder]: For program point L544-2(lines 544 554) no Hoare annotation was computed. [2021-10-13 07:53:39,799 INFO L853 garLoopResultBuilder]: At program point L313(lines 290 388) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv1 32) ~t_b~0)) (.cse50 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse15 (= ~wb_pc~0 (_ bv0 32))) (.cse46 (= .cse50 ~c_t~0)) (.cse48 (= .cse50 ~d~0)) (.cse33 (= ~d~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse36 (= ~c~0 .cse37)) (.cse39 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse42 (= ~c1_st~0 (_ bv0 32))) (.cse43 (= ~c1_pc~0 (_ bv0 32))) (.cse40 (= ~c_req_up~0 (_ bv0 32))) (.cse44 (= ~wl_pc~0 (_ bv0 32))) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse27 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse38 (= .cse37 ~c_t~0)) (.cse47 (= ~data~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse45 (= .cse50 ~c~0)) (.cse7 (= ~data~0 ~t_b~0)) (.cse10 (= ~d~0 (_ bv0 32))) (.cse16 (= ~data~0 (_ bv0 32))) (.cse18 (= ~wl_pc~0 (_ bv1 32))) (.cse22 (= ~c2_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 .cse37)) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse41 (= (_ bv2 32) ~e_wl~0)) (.cse26 (= (_ bv2 32) ~wb_st~0)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse2 (not (= ~e_wl~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse13 (not (= ~wl_st~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= .cse50 ~data~0)) (.cse31 (= (_ bv2 32) ~c2_st~0)) (.cse28 (not (= ~e_wl~0 (_ bv0 32)))) (.cse17 (= (_ bv2 32) ~e_c~0)) (.cse19 (= (_ bv2 32) ~e_g~0)) (.cse20 (= ~c1_i~0 (_ bv1 32))) (.cse29 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse2 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse34 .cse35) (and .cse36 (= ~d~0 .cse37) .cse34 .cse38)))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse41 .cse5 .cse6 .cse24 .cse25 .cse9 .cse27 .cse13 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse0 .cse1 .cse3 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse32 .cse26 .cse10 .cse13 .cse14 .cse35 .cse31 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 .cse10 .cse35 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (and (= (_ bv1 32) ~c_t~0) (or (and .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21)) .cse32 .cse33 .cse35) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse41 .cse5 .cse6 .cse24 .cse9 .cse13 .cse19 .cse20 .cse21 .cse44) (and .cse2 (let ((.cse49 (or (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse35 .cse49) (and .cse36 .cse49 .cse38)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse13 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse16 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 .cse10 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)))) [2021-10-13 07:53:39,799 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 185) no Hoare annotation was computed. [2021-10-13 07:53:39,800 INFO L853 garLoopResultBuilder]: At program point L16(lines 57 127) the Hoare annotation is: (and (not (= ~e_wl~0 (_ bv1 32))) (let ((.cse0 (let ((.cse10 (= ~c2_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~c1_st~0)) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse7 (= (_ bv1 32) ~c2_pc~0)) (.cse8 (= (_ bv2 32) ~e_e~0)) (.cse9 (= (_ bv2 32) ~wb_st~0)) (.cse11 (not (= ~wl_st~0 (_ bv0 32)))) (.cse19 (= ~c1_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~c2_st~0)) (.cse13 (not (= ~e_wl~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~e_c~0)) (.cse15 (= (_ bv2 32) ~e_g~0)) (.cse16 (= ~c1_i~0 (_ bv1 32))) (.cse17 (= ~wb_pc~0 (_ bv1 32))) (.cse18 (= (_ bv0 32) ~r_i~0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))))) (or (and .cse0 (= ~data~0 ~t_b~0)) (and .cse0 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (and (= ~data~0 (bvadd (_ bv1 32) ~t_b~0)) .cse0)))) [2021-10-13 07:53:39,800 INFO L857 garLoopResultBuilder]: For program point L545(lines 545 550) no Hoare annotation was computed. [2021-10-13 07:53:39,800 INFO L857 garLoopResultBuilder]: For program point L479(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,800 INFO L857 garLoopResultBuilder]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2021-10-13 07:53:39,800 INFO L857 garLoopResultBuilder]: For program point L446-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,800 INFO L857 garLoopResultBuilder]: For program point L347(lines 347 354) no Hoare annotation was computed. [2021-10-13 07:53:39,801 INFO L853 garLoopResultBuilder]: At program point L182(lines 177 217) the Hoare annotation is: (let ((.cse29 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse24 (= ~data~0 ~t_b~0)) (.cse25 (= ~c1_st~0 (_ bv0 32))) (.cse26 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse16 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse22 (= (_ bv2 32) ~e_c~0)) (.cse2 (= (_ bv2 32) ~e_wl~0)) (.cse18 (= (_ bv2 32) ~wb_st~0)) (.cse28 (= .cse29 ~c_t~0)) (.cse14 (= ~data~0 .cse29)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse15 (not (= ~e_wl~0 (_ bv1 32)))) (.cse17 (not (= (_ bv0 32) ~r_st~0))) (.cse3 (= (_ bv1 32) ~wb_i~0)) (.cse4 (= ~c2_i~0 (_ bv1 32))) (.cse27 (= ~wb_st~0 (_ bv0 32))) (.cse5 (not (= (_ bv0 32) ~e_c~0))) (.cse6 (= (_ bv1 32) ~c2_pc~0)) (.cse7 (= (_ bv2 32) ~e_e~0)) (.cse8 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse19 (= (_ bv0 32) ~processed~0)) (.cse9 (not (= ~wl_st~0 (_ bv0 32)))) (.cse20 (= (_ bv2 32) ~c1_st~0)) (.cse21 (not (= ~e_wl~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~e_g~0)) (.cse23 (not (= ~c2_st~0 (_ bv0 32)))) (.cse11 (= ~c1_i~0 (_ bv1 32))) (.cse12 (= ~wb_pc~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse17 .cse3 .cse4 .cse6 .cse7 .cse18 .cse19 .cse9 .cse20 .cse21 .cse22 .cse10 .cse23 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse15 .cse16 .cse17 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19 .cse9 .cse25 .cse21 .cse26 .cse10 .cse23 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse15 .cse16 .cse17 .cse3 .cse4 .cse24 .cse6 .cse7 .cse18 .cse19 .cse9 .cse25 .cse21 .cse26 .cse22 .cse10 .cse23 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse27 .cse6 .cse7 .cse19 .cse9 .cse20 .cse21 .cse22 .cse10 .cse23 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19 .cse9 .cse20 .cse21 .cse10 .cse23 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse6 .cse7 .cse18 .cse9 .cse20 .cse21 .cse22 .cse10 .cse23 .cse11 .cse12 .cse28 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 (= ~wl_pc~0 (_ bv0 32))) (and .cse14 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse20 .cse21 .cse10 .cse23 .cse11 .cse12 .cse28 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse20 .cse21 .cse10 .cse23 .cse11 .cse12 .cse13)))) [2021-10-13 07:53:39,801 INFO L853 garLoopResultBuilder]: At program point L678(lines 395 683) the Hoare annotation is: (= ~c2_i~0 (_ bv1 32)) [2021-10-13 07:53:39,801 INFO L857 garLoopResultBuilder]: For program point L480(lines 480 484) no Hoare annotation was computed. [2021-10-13 07:53:39,801 INFO L857 garLoopResultBuilder]: For program point L646-1(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,801 INFO L853 garLoopResultBuilder]: At program point L151-1(lines 132 172) the Hoare annotation is: (let ((.cse36 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse20 (= ~c2_pc~0 (_ bv0 32))) (.cse0 (= ~c_req_up~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~e_wl~0)) (.cse19 (= ~wl_pc~0 (_ bv0 32))) (.cse35 (= .cse36 ~c_t~0)) (.cse34 (= ~data~0 .cse36)) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse7 (= ~data~0 ~t_b~0)) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse10 (= ~d~0 (_ bv0 32))) (.cse13 (= ~wb_pc~0 (_ bv0 32))) (.cse14 (= ~data~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~e_c~0)) (.cse33 (= ~wl_pc~0 (_ bv1 32))) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse23 (= (_ bv1 32) ~c1_pc~0)) (.cse24 (not (= ~e_wl~0 (_ bv1 32)))) (.cse32 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse2 (not (= (_ bv0 32) ~r_st~0))) (.cse4 (= (_ bv1 32) ~wb_i~0)) (.cse5 (not (= ~c1_st~0 (_ bv0 32)))) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse30 (not (= (_ bv0 32) ~e_c~0))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse21 (= (_ bv2 32) ~wb_st~0)) (.cse31 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse26 (not (= ~wl_st~0 (_ bv0 32)))) (.cse27 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (.cse28 (= (_ bv2 32) ~c2_st~0)) (.cse29 (not (= ~e_wl~0 (_ bv0 32)))) (.cse16 (= (_ bv2 32) ~e_g~0)) (.cse17 (= ~c1_i~0 (_ bv1 32))) (.cse22 (= ~wb_pc~0 (_ bv1 32))) (.cse18 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19 .cse20) (and .cse1 .cse23 .cse24 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse26 .cse27 .cse28 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse3 .cse4 .cse6 .cse30 .cse25 .cse9 .cse31 .cse26 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse32 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse26 .cse28 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse33 .cse16 .cse17 .cse18 .cse20) (and .cse24 (or (and .cse34 .cse1 .cse23 .cse2 .cse4 .cse5 .cse6 .cse30 .cse25 .cse9 .cse21 .cse31 .cse26 .cse28 .cse29 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse2 .cse4 .cse5 .cse6 .cse30 .cse25 .cse9 .cse21 .cse31 .cse26 .cse27 .cse28 .cse29 .cse16 .cse17 .cse22 .cse18)) .cse35) (and .cse1 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse11 .cse12 .cse26 .cse14 .cse15 .cse33 .cse16 .cse17 .cse22 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse21 .cse10 .cse12 .cse14 .cse28 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19) (and .cse34 .cse1 .cse23 .cse24 .cse2 .cse4 .cse5 .cse6 .cse8 .cse30 .cse25 .cse9 .cse31 .cse11 .cse12 .cse26 .cse29 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse12 .cse26 .cse27 .cse28 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse21 .cse10 .cse12 .cse26 .cse14 .cse28 .cse15 .cse33 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse12 .cse26 .cse27 .cse28 .cse15 .cse33 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse24 .cse2 .cse4 .cse5 .cse6 .cse8 .cse30 .cse25 .cse9 .cse31 .cse12 .cse26 .cse27 .cse28 .cse29 .cse16 .cse17 .cse22 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse34 .cse1 .cse23 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse30 .cse25 .cse9 .cse21 .cse31 .cse11 .cse12 .cse26 .cse29 .cse16 .cse17 .cse22 .cse18) (and .cse34 .cse1 .cse23 .cse24 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse26 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse3 .cse4 .cse6 .cse30 .cse9 .cse26 .cse16 .cse17 .cse18 .cse19) (and .cse24 .cse35 (or (and .cse1 .cse23 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse26 .cse27 .cse28 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse23 .cse2 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse21 .cse26 .cse28 .cse29 (= ~data~0 ULTIMATE.start_write_loop_~t~0) .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse34 .cse1 .cse23 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse26 .cse28 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18))) (and .cse34 .cse1 .cse23 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse21 .cse11 .cse12 .cse26 .cse29 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse1 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse26 .cse13 .cse14 .cse28 .cse15 .cse33 .cse16 .cse17 .cse18) (and .cse1 .cse23 .cse24 .cse32 .cse2 .cse4 .cse5 .cse6 .cse30 .cse25 .cse9 .cse21 .cse31 .cse12 .cse26 .cse27 .cse28 .cse29 .cse16 .cse17 .cse22 .cse18)))) [2021-10-13 07:53:39,801 INFO L857 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-10-13 07:53:39,801 INFO L857 garLoopResultBuilder]: For program point L85-1(lines 79 122) no Hoare annotation was computed. [2021-10-13 07:53:39,801 INFO L857 garLoopResultBuilder]: For program point L416-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,802 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 07:53:39,802 INFO L857 garLoopResultBuilder]: For program point L317(lines 317 324) no Hoare annotation was computed. [2021-10-13 07:53:39,802 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-10-13 07:53:39,802 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 586) no Hoare annotation was computed. [2021-10-13 07:53:39,802 INFO L857 garLoopResultBuilder]: For program point L516-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,802 INFO L857 garLoopResultBuilder]: For program point L451-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,802 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 162) no Hoare annotation was computed. [2021-10-13 07:53:39,802 INFO L857 garLoopResultBuilder]: For program point L154-1(lines 154 162) no Hoare annotation was computed. [2021-10-13 07:53:39,802 INFO L857 garLoopResultBuilder]: For program point L617(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,805 INFO L857 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2021-10-13 07:53:39,805 INFO L857 garLoopResultBuilder]: For program point L618(lines 618 622) no Hoare annotation was computed. [2021-10-13 07:53:39,805 INFO L857 garLoopResultBuilder]: For program point L651-1(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,805 INFO L857 garLoopResultBuilder]: For program point L421-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,805 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 07:53:39,806 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 231) no Hoare annotation was computed. [2021-10-13 07:53:39,806 INFO L857 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2021-10-13 07:53:39,806 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2021-10-13 07:53:39,806 INFO L857 garLoopResultBuilder]: For program point L488(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,806 INFO L857 garLoopResultBuilder]: For program point L521-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,807 INFO L853 garLoopResultBuilder]: At program point L389(lines 281 394) the Hoare annotation is: (let ((.cse22 (bvadd (_ bv2 32) ~t_b~0)) (.cse28 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse26 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse21 (= ~data~0 .cse28)) (.cse25 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse12 (= .cse22 ~data~0)) (.cse0 (not (= ~e_wl~0 (_ bv1 32)))) (.cse20 (= ~data~0 ~t_b~0)) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse14 (not (= ~e_wl~0 (_ bv0 32)))) (.cse27 (= ~wl_pc~0 (_ bv1 32))) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse23 (= (_ bv2 32) ~e_wl~0)) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse7 (= (_ bv1 32) ~c2_pc~0)) (.cse8 (= (_ bv2 32) ~e_e~0)) (.cse9 (= (_ bv2 32) ~wb_st~0)) (.cse10 (not (= ~wl_st~0 (_ bv0 32)))) (.cse11 (= (_ bv2 32) ~c1_st~0)) (.cse13 (= (_ bv2 32) ~c2_st~0)) (.cse15 (= (_ bv2 32) ~e_c~0)) (.cse16 (= (_ bv2 32) ~e_g~0)) (.cse17 (= ~c1_i~0 (_ bv1 32))) (.cse18 (= ~wb_pc~0 (_ bv1 32))) (.cse19 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (and .cse1 .cse2 .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= .cse22 ~c_t~0) .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse4 .cse23 .cse5 .cse6 .cse24 .cse7 .cse8 .cse25 .cse10 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse20 .cse24 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse13 .cse14 .cse26 .cse16 .cse17 .cse18 .cse19) (and .cse0 (or (and .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19))) (and .cse0 (or (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (= .cse28 ~c_t~0)) (and .cse1 .cse23 .cse5 .cse6 .cse24 .cse8 .cse10 .cse16 .cse17 .cse19 (= ~wl_pc~0 (_ bv0 32))) (and .cse0 (or (and .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19))) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse20 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse27 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2021-10-13 07:53:39,807 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 274) no Hoare annotation was computed. [2021-10-13 07:53:39,807 INFO L853 garLoopResultBuilder]: At program point L588(lines 581 598) the Hoare annotation is: (let ((.cse24 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse7 (not (= (_ bv0 32) ~e_c~0))) (.cse8 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse11 (= (_ bv2 32) ~wb_st~0)) (.cse12 (not (= ~wl_st~0 (_ bv0 32)))) (.cse13 (= (_ bv2 32) ~c1_st~0)) (.cse14 (= .cse24 ~data~0)) (.cse15 (= (_ bv2 32) ~c2_st~0)) (.cse17 (not (= ~e_wl~0 (_ bv0 32)))) (.cse18 (= (_ bv2 32) ~e_g~0)) (.cse19 (= ~c1_i~0 (_ bv1 32))) (.cse20 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0)) (.cse32 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse16 (= .cse24 ~c~0)) (.cse29 (= (_ bv2 32) ~e_wl~0)) (.cse26 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse25 (= ~data~0 .cse32)) (.cse27 (= ~data~0 ~t_b~0)) (.cse28 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse0 (not (= ~e_wl~0 (_ bv1 32)))) (.cse10 (= (_ bv0 32) ~t_b~0)) (.cse30 (= ~d~0 (_ bv0 32))) (.cse31 (= ~c~0 (_ bv1 32))) (.cse23 (= ~data~0 (_ bv1 32))) (.cse34 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21))) (or (and .cse0 (let ((.cse22 (= .cse24 ~d~0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= .cse24 ~c_t~0) .cse18 .cse19 .cse20 .cse21)))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 (= (_ bv2 32) ~e_c~0) .cse18 .cse19 .cse20 .cse21) (and .cse0 (or (and .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse13 .cse15 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21))) (and .cse1 .cse29 .cse5 .cse6 .cse7 .cse9 .cse12 .cse18 .cse19 .cse21 (= ~wl_pc~0 (_ bv0 32))) (and .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse31 .cse15 .cse28 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 (= ~wl_pc~0 (_ bv1 32)) .cse18 .cse19 .cse20 .cse21) (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) (and .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse12 .cse18 .cse19 .cse20 .cse21) (and .cse0 (let ((.cse33 (or (and .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) .cse34 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21)))) (or (and (= ~c~0 .cse32) .cse33 (= .cse32 ~c_t~0)) (and .cse10 (= ~d~0 (_ bv1 32)) .cse31 .cse33)))) (and .cse0 .cse10 .cse30 .cse31 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) .cse34)))))) [2021-10-13 07:53:39,808 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-10-13 07:53:39,808 INFO L857 garLoopResultBuilder]: For program point L456-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,808 INFO L857 garLoopResultBuilder]: For program point L291(lines 290 388) no Hoare annotation was computed. [2021-10-13 07:53:39,808 INFO L857 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2021-10-13 07:53:39,808 INFO L857 garLoopResultBuilder]: For program point L589(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,808 INFO L857 garLoopResultBuilder]: For program point L556(lines 556 560) no Hoare annotation was computed. [2021-10-13 07:53:39,809 INFO L857 garLoopResultBuilder]: For program point L556-2(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,810 INFO L853 garLoopResultBuilder]: At program point L358(lines 290 388) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv1 32) ~t_b~0)) (.cse50 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse45 (= .cse50 ~c_t~0)) (.cse48 (= .cse50 ~d~0)) (.cse15 (= ~wb_pc~0 (_ bv0 32))) (.cse33 (= ~d~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse36 (= ~c~0 .cse37)) (.cse39 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse42 (= ~c1_st~0 (_ bv0 32))) (.cse43 (= ~c1_pc~0 (_ bv0 32))) (.cse40 (= ~c_req_up~0 (_ bv0 32))) (.cse44 (= ~wl_pc~0 (_ bv0 32))) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse27 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse38 (= .cse37 ~c_t~0)) (.cse47 (= ~data~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse46 (= .cse50 ~c~0)) (.cse7 (= ~data~0 ~t_b~0)) (.cse10 (= ~d~0 (_ bv0 32))) (.cse16 (= ~data~0 (_ bv0 32))) (.cse18 (= ~wl_pc~0 (_ bv1 32))) (.cse22 (= ~c2_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 .cse37)) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse41 (= (_ bv2 32) ~e_wl~0)) (.cse26 (= (_ bv2 32) ~wb_st~0)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse2 (not (= ~e_wl~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse13 (not (= ~wl_st~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= .cse50 ~data~0)) (.cse31 (= (_ bv2 32) ~c2_st~0)) (.cse28 (not (= ~e_wl~0 (_ bv0 32)))) (.cse17 (= (_ bv2 32) ~e_c~0)) (.cse19 (= (_ bv2 32) ~e_g~0)) (.cse20 (= ~c1_i~0 (_ bv1 32))) (.cse29 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse2 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse34 .cse35) (and .cse36 (= ~d~0 .cse37) .cse34 .cse38)))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse41 .cse5 .cse6 .cse24 .cse25 .cse9 .cse27 .cse13 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse0 .cse1 .cse3 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse32 .cse26 .cse10 .cse13 .cse14 .cse35 .cse31 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse45 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 .cse10 .cse35 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse2 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse41 .cse5 .cse6 .cse24 .cse9 .cse13 .cse19 .cse20 .cse21 .cse44) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21))) (and .cse2 (let ((.cse49 (or (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse35 .cse49) (and .cse36 .cse49 .cse38)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse13 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse16 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 .cse10 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse46 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)))) [2021-10-13 07:53:39,810 INFO L857 garLoopResultBuilder]: For program point L226(lines 226 230) no Hoare annotation was computed. [2021-10-13 07:53:39,810 INFO L857 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2021-10-13 07:53:39,810 INFO L857 garLoopResultBuilder]: For program point L61(lines 61 69) no Hoare annotation was computed. [2021-10-13 07:53:39,810 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 07:53:39,811 INFO L857 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-10-13 07:53:39,811 INFO L853 garLoopResultBuilder]: At program point L227(lines 222 249) the Hoare annotation is: (let ((.cse25 (= ~c2_st~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~e_wl~0)) (.cse22 (= ~data~0 (bvadd (_ bv1 32) ~t_b~0))) (.cse5 (not (= (_ bv0 32) ~e_c~0))) (.cse8 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse23 (= ~c1_st~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse14 (not (= ~e_wl~0 (_ bv1 32)))) (.cse15 (not (= (_ bv0 32) ~r_st~0))) (.cse3 (= (_ bv1 32) ~wb_i~0)) (.cse4 (= ~c2_i~0 (_ bv1 32))) (.cse16 (not (= ~wb_st~0 (_ bv0 32)))) (.cse6 (= (_ bv1 32) ~c2_pc~0)) (.cse7 (= (_ bv2 32) ~e_e~0)) (.cse17 (= (_ bv0 32) ~processed~0)) (.cse9 (not (= ~wl_st~0 (_ bv0 32)))) (.cse18 (= (_ bv2 32) ~c1_st~0)) (.cse19 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (.cse20 (= (_ bv2 32) ~c2_st~0)) (.cse21 (not (= ~e_wl~0 (_ bv0 32)))) (.cse24 (= (_ bv2 32) ~e_c~0)) (.cse10 (= (_ bv2 32) ~e_g~0)) (.cse11 (= ~c1_i~0 (_ bv1 32))) (.cse12 (= ~wb_pc~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse22 .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse7 .cse17 .cse9 .cse23 .cse20 .cse21 .cse24 .cse10 .cse11 .cse12 .cse13) (and .cse22 .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse25 .cse17 .cse9 .cse18 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse22 .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse7 .cse25 .cse17 .cse9 .cse18 .cse21 .cse24 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 (= ~wl_pc~0 (_ bv0 32))) (and .cse22 .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse23 .cse20 .cse21 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse7 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse24 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 07:53:39,811 INFO L857 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2021-10-13 07:53:39,811 INFO L853 garLoopResultBuilder]: At program point L62(lines 57 127) the Hoare annotation is: (let ((.cse8 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse0 (not (= ~e_wl~0 (_ bv1 32)))) (.cse5 (= .cse8 ~data~0)) (.cse4 (let ((.cse18 (= ~c2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~c1_st~0)) (.cse9 (= (_ bv2 32) ~e_f~0)) (.cse10 (= (_ bv1 32) ~c1_pc~0)) (.cse11 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse12 (not (= (_ bv0 32) ~r_st~0))) (.cse13 (= (_ bv1 32) ~wb_i~0)) (.cse14 (= ~c2_i~0 (_ bv1 32))) (.cse15 (= (_ bv1 32) ~c2_pc~0)) (.cse16 (= (_ bv2 32) ~e_e~0)) (.cse17 (= (_ bv2 32) ~wb_st~0)) (.cse19 (not (= ~wl_st~0 (_ bv0 32)))) (.cse27 (= ~c1_st~0 (_ bv0 32))) (.cse28 (= (_ bv2 32) ~c2_st~0)) (.cse21 (not (= ~e_wl~0 (_ bv0 32)))) (.cse22 (= (_ bv2 32) ~e_c~0)) (.cse23 (= (_ bv2 32) ~e_g~0)) (.cse24 (= ~c1_i~0 (_ bv1 32))) (.cse25 (= ~wb_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~r_i~0))) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse27 .cse28 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) (.cse3 (= (_ bv0 32) ~t_b~0))) (or (and .cse0 (let ((.cse1 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse2 (or (and .cse4 (= ~data~0 ~t_b~0)) (and .cse4 .cse5) (and (= ~data~0 .cse1) .cse4)))) (or (and (= ~c~0 .cse1) (= ~d~0 .cse1) .cse2 (= .cse1 ~c_t~0)) (and .cse3 (= ~d~0 (_ bv1 32)) (= ~c~0 (_ bv1 32)) .cse2))))) (and .cse0 (let ((.cse6 (= .cse8 ~c~0)) (.cse7 (= .cse8 ~d~0))) (or (and .cse4 .cse3 .cse5 .cse6 .cse7) (and .cse4 .cse5 .cse6 (= .cse8 ~c_t~0) .cse7) (and .cse4 .cse3 (= ~data~0 (_ bv0 32)) .cse6 .cse7) (and .cse4 (= ~data~0 (_ bv1 32)) .cse3 .cse6 .cse7))))))) [2021-10-13 07:53:39,812 INFO L857 garLoopResultBuilder]: For program point L426-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,812 INFO L857 garLoopResultBuilder]: For program point L526-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,813 INFO L853 garLoopResultBuilder]: At program point L328(lines 290 388) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv1 32) ~t_b~0)) (.cse50 (bvadd (_ bv2 32) ~t_b~0))) (let ((.cse15 (= ~wb_pc~0 (_ bv0 32))) (.cse46 (= .cse50 ~c_t~0)) (.cse48 (= .cse50 ~d~0)) (.cse33 (= ~d~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse36 (= ~c~0 .cse37)) (.cse39 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse42 (= ~c1_st~0 (_ bv0 32))) (.cse43 (= ~c1_pc~0 (_ bv0 32))) (.cse40 (= ~c_req_up~0 (_ bv0 32))) (.cse44 (= ~wl_pc~0 (_ bv0 32))) (.cse47 (= ~data~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse45 (= .cse50 ~c~0)) (.cse7 (= ~data~0 ~t_b~0)) (.cse10 (= ~d~0 (_ bv0 32))) (.cse16 (= ~data~0 (_ bv0 32))) (.cse18 (= ~wl_pc~0 (_ bv1 32))) (.cse22 (= ~c2_pc~0 (_ bv0 32))) (.cse11 (= ~c2_st~0 (_ bv0 32))) (.cse3 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse41 (= (_ bv2 32) ~e_wl~0)) (.cse23 (= ~data~0 .cse37)) (.cse24 (not (= (_ bv0 32) ~e_c~0))) (.cse26 (= (_ bv2 32) ~wb_st~0)) (.cse27 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse38 (= .cse37 ~c_t~0)) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse2 (not (= ~e_wl~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse25 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse12 (= (_ bv0 32) ~processed~0)) (.cse13 (not (= ~wl_st~0 (_ bv0 32)))) (.cse14 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= .cse50 ~data~0)) (.cse31 (= (_ bv2 32) ~c2_st~0)) (.cse28 (not (= ~e_wl~0 (_ bv0 32)))) (.cse17 (= (_ bv2 32) ~e_c~0)) (.cse19 (= (_ bv2 32) ~e_g~0)) (.cse20 (= ~c1_i~0 (_ bv1 32))) (.cse29 (= ~wb_pc~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse2 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse34 .cse35) (and .cse36 (= ~d~0 .cse37) .cse34 .cse38)))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse0 .cse1 .cse41 .cse5 .cse6 .cse24 .cse25 .cse9 .cse27 .cse13 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse0 .cse1 .cse3 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse32 .cse26 .cse10 .cse13 .cse14 .cse35 .cse31 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse42 .cse31 .cse43 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse42 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse31 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21 .cse48))) (and .cse2 .cse10 .cse35 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse12 .cse13 .cse42 .cse28 .cse39 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21))) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse44) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse44 .cse22) (and .cse2 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse24 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse27 .cse12 .cse13 .cse42 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse42 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse17 .cse46 .cse19 .cse20 .cse29 .cse21 .cse48) (and .cse0 .cse41 .cse5 .cse6 .cse24 .cse9 .cse13 .cse19 .cse20 .cse21 .cse44) (and .cse2 (let ((.cse49 (or (and .cse23 .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse28 .cse39 .cse17 .cse19 .cse20 .cse29 .cse21)))) (or (and .cse32 .cse33 .cse35 .cse49) (and .cse36 .cse49 .cse38)))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse13 .cse16 .cse42 .cse31 .cse43 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (and .cse40 .cse0 .cse4 .cse41 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse16 .cse42 .cse43 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44 .cse22) (and .cse40 .cse0 .cse1 .cse4 .cse41 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse16 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21 .cse44) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse11 .cse13 .cse14 .cse28 .cse19 .cse20 .cse29 .cse38 .cse21) (and .cse2 .cse10 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse30 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse47 .cse25 .cse9 .cse32 .cse26 .cse13 .cse14 .cse31 .cse45 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse41 .cse5 .cse6 .cse25 .cse9 .cse26 .cse13 .cse14 .cse31 .cse17 .cse19 .cse20 .cse29 .cse21) (and .cse2 (or (and .cse23 .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse24 .cse25 .cse9 .cse26 .cse27 .cse13 .cse14 .cse30 .cse31 .cse28 .cse19 .cse20 .cse29 .cse21)) .cse38) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse12 .cse13 .cse14 .cse30 .cse31 .cse28 .cse17 .cse19 .cse20 .cse29 .cse21)))) [2021-10-13 07:53:39,813 INFO L857 garLoopResultBuilder]: For program point L295(lines 295 311) no Hoare annotation was computed. [2021-10-13 07:53:39,814 INFO L853 garLoopResultBuilder]: At program point L196-1(lines 177 217) the Hoare annotation is: (let ((.cse36 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse29 (= ~data~0 .cse36)) (.cse35 (= .cse36 ~c_t~0)) (.cse33 (= ~c_req_up~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~e_wl~0)) (.cse34 (= ~wl_pc~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ~c1_pc~0)) (.cse5 (not (= (_ bv0 32) ~e_c~0))) (.cse6 (= (_ bv1 32) ~c2_pc~0)) (.cse27 (= (_ bv2 32) ~wb_st~0)) (.cse8 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse21 (= (_ bv2 32) ~c1_st~0)) (.cse28 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (.cse31 (not (= ~e_wl~0 (_ bv0 32)))) (.cse12 (= ~wb_pc~0 (_ bv1 32))) (.cse0 (= (_ bv2 32) ~e_f~0)) (.cse14 (not (= ~e_wl~0 (_ bv1 32)))) (.cse15 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse16 (not (= (_ bv0 32) ~r_st~0))) (.cse3 (= (_ bv1 32) ~wb_i~0)) (.cse4 (= ~c2_i~0 (_ bv1 32))) (.cse17 (= ~data~0 ~t_b~0)) (.cse18 (= ~wb_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~e_e~0)) (.cse19 (= ~d~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~processed~0)) (.cse9 (not (= ~wl_st~0 (_ bv0 32)))) (.cse22 (= ~wb_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 (_ bv0 32))) (.cse30 (= ~c1_st~0 (_ bv0 32))) (.cse32 (= ~c1_pc~0 (_ bv0 32))) (.cse24 (= (_ bv2 32) ~e_c~0)) (.cse25 (= ~wl_pc~0 (_ bv1 32))) (.cse10 (= (_ bv2 32) ~e_g~0)) (.cse26 (not (= ~c2_st~0 (_ bv0 32)))) (.cse11 (= ~c1_i~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse18 .cse7 .cse19 .cse20 .cse9 .cse21 .cse22 .cse23 .cse24 .cse25 .cse10 .cse26 .cse11 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse7 .cse27 .cse20 .cse9 .cse21 .cse28 .cse24 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse29 .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse6 .cse7 .cse27 .cse20 .cse9 .cse30 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse7 .cse27 .cse19 .cse20 .cse9 .cse23 .cse30 .cse32 .cse24 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse4 .cse6 .cse7 .cse27 .cse9 .cse21 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse29 .cse0 .cse1 .cse14 .cse16 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse30 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse7 .cse27 .cse19 .cse20 .cse9 .cse21 .cse23 .cse24 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse33 .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse17 .cse18 .cse7 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse10 .cse26 .cse11 .cse13 .cse34) (and .cse29 .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse20 .cse9 .cse30 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse33 .cse0 .cse16 .cse2 .cse3 .cse4 .cse17 .cse18 .cse7 .cse19 .cse20 .cse22 .cse23 .cse30 .cse32 .cse24 .cse10 .cse26 .cse11 .cse13 .cse34) (and .cse14 (or (and .cse0 .cse1 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse27 .cse9 .cse21 .cse31 (= ~data~0 ULTIMATE.start_write_loop_~t~0) .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse16 .cse3 .cse4 .cse6 .cse7 .cse27 .cse9 .cse21 .cse28 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse29 .cse0 .cse1 .cse16 .cse3 .cse4 .cse6 .cse7 .cse27 .cse9 .cse21 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13)) .cse35) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 .cse34) (and .cse0 .cse1 .cse14 .cse16 .cse3 .cse4 .cse18 .cse6 .cse7 .cse20 .cse9 .cse21 .cse28 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse6 .cse7 .cse27 .cse20 .cse9 .cse21 .cse28 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse29 .cse0 .cse1 .cse14 .cse16 .cse3 .cse4 .cse18 .cse6 .cse7 .cse20 .cse9 .cse30 .cse31 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse33 .cse0 .cse16 .cse2 .cse3 .cse4 .cse17 .cse7 .cse27 .cse19 .cse20 .cse23 .cse30 .cse32 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13 .cse34) (and .cse14 (or (and .cse0 .cse1 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse21 .cse28 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse29 .cse0 .cse1 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse21 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13)) .cse35) (and .cse33 .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse17 .cse7 .cse27 .cse19 .cse20 .cse21 .cse23 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13 .cse34) (and .cse0 .cse1 .cse14 .cse16 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse21 .cse28 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse20 .cse9 .cse21 .cse28 .cse31 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse18 .cse7 .cse19 .cse20 .cse9 .cse22 .cse23 .cse30 .cse32 .cse24 .cse25 .cse10 .cse26 .cse11 .cse13)))) [2021-10-13 07:53:39,814 INFO L857 garLoopResultBuilder]: For program point L64(lines 64 68) no Hoare annotation was computed. [2021-10-13 07:53:39,814 INFO L857 garLoopResultBuilder]: For program point L659(lines 659 675) no Hoare annotation was computed. [2021-10-13 07:53:39,814 INFO L857 garLoopResultBuilder]: For program point L626-1(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,815 INFO L857 garLoopResultBuilder]: For program point L362(lines 362 369) no Hoare annotation was computed. [2021-10-13 07:53:39,815 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 07:53:39,815 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2021-10-13 07:53:39,815 INFO L857 garLoopResultBuilder]: For program point L561-1(lines 537 677) no Hoare annotation was computed. [2021-10-13 07:53:39,815 INFO L857 garLoopResultBuilder]: For program point L462(lines 462 466) no Hoare annotation was computed. [2021-10-13 07:53:39,815 INFO L853 garLoopResultBuilder]: At program point L264(lines 257 274) the Hoare annotation is: (let ((.cse37 (bvadd (_ bv2 32) ~t_b~0)) (.cse34 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse13 (= ~c1_st~0 (_ bv0 32))) (.cse8 (= ~wb_st~0 (_ bv0 32))) (.cse24 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse11 (= (_ bv0 32) ~processed~0)) (.cse23 (= ~data~0 ~t_b~0)) (.cse26 (= ~data~0 ULTIMATE.start_write_loop_~t~0)) (.cse0 (= ~data~0 .cse34)) (.cse28 (= ~c2_st~0 (_ bv0 32))) (.cse16 (= ~wl_pc~0 (_ bv1 32))) (.cse29 (= .cse34 ~c_t~0)) (.cse31 (= (_ bv2 32) ~e_wl~0)) (.cse9 (not (= (_ bv0 32) ~e_c~0))) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse21 (not (= ~c_req_up~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~r_st~0))) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse7 (not (= (_ bv0 32) ~e_e~0))) (.cse10 (= (_ bv1 32) ~c2_pc~0)) (.cse32 (= (_ bv0 32) ~t_b~0)) (.cse22 (= (_ bv2 32) ~wb_st~0)) (.cse12 (not (= ~wl_st~0 (_ bv0 32)))) (.cse25 (= (_ bv2 32) ~c1_st~0)) (.cse27 (= .cse37 ~data~0)) (.cse14 (= (_ bv2 32) ~c2_st~0)) (.cse15 (not (= ~e_wl~0 (_ bv0 32)))) (.cse30 (= (_ bv2 32) ~e_c~0)) (.cse17 (= (_ bv2 32) ~e_g~0)) (.cse18 (= ~c1_i~0 (_ bv1 32))) (.cse19 (= ~wb_pc~0 (_ bv1 32))) (.cse20 (= (_ bv0 32) ~r_i~0)) (.cse3 (not (= ~e_wl~0 (_ bv1 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse3 (or (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse22 .cse24 .cse12 .cse25 .cse14 .cse15 .cse26 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse24 .cse12 .cse25 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse24 .cse12 .cse25 .cse27 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20))) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse22 .cse28 .cse11 .cse12 .cse13 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20) (and (or (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse12 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse12 .cse25 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) .cse3) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse23 .cse7 .cse10 .cse22 .cse24 .cse12 .cse25 .cse14 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse4 .cse31 .cse5 .cse6 .cse7 .cse9 .cse10 .cse24 .cse12 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse22 .cse12 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse28 .cse11 .cse12 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse3 (let ((.cse33 (or (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse12 .cse25 .cse27 .cse14 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse23 .cse7 .cse10 .cse22 .cse12 .cse25 .cse14 .cse15 .cse26 .cse30 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse12 .cse25 .cse14 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20)))) (or (and .cse32 (= ~d~0 (_ bv1 32)) (= ~c~0 (_ bv1 32)) .cse33) (and (= ~c~0 .cse34) (= ~d~0 .cse34) .cse29 .cse33)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse28 .cse12 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20) (and .cse1 .cse31 .cse5 .cse6 .cse7 .cse9 .cse12 .cse17 .cse18 .cse20 (= ~wl_pc~0 (_ bv0 32))) (and (let ((.cse35 (= .cse37 ~c~0)) (.cse36 (= .cse37 ~d~0))) (or (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 (= ~data~0 (_ bv1 32)) .cse7 .cse10 .cse32 .cse22 .cse12 .cse25 .cse14 .cse35 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20 .cse36) (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse12 .cse25 .cse27 .cse14 .cse35 .cse15 .cse30 (= .cse37 ~c_t~0) .cse17 .cse18 .cse19 .cse20 .cse36) (and .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse32 .cse22 .cse12 .cse25 .cse27 .cse14 .cse35 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20 .cse36))) .cse3)))) [2021-10-13 07:53:39,815 INFO L857 garLoopResultBuilder]: For program point L298(lines 298 310) no Hoare annotation was computed. [2021-10-13 07:53:39,816 INFO L857 garLoopResultBuilder]: For program point L265(lines 257 274) no Hoare annotation was computed. [2021-10-13 07:53:39,816 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2021-10-13 07:53:39,816 INFO L857 garLoopResultBuilder]: For program point L199-1(lines 199 207) no Hoare annotation was computed. [2021-10-13 07:53:39,816 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 141) no Hoare annotation was computed. [2021-10-13 07:53:39,816 INFO L857 garLoopResultBuilder]: For program point L662(lines 662 674) no Hoare annotation was computed. [2021-10-13 07:53:39,816 INFO L857 garLoopResultBuilder]: For program point L497(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,816 INFO L857 garLoopResultBuilder]: For program point L431-1(lines 398 682) no Hoare annotation was computed. [2021-10-13 07:53:39,816 INFO L857 garLoopResultBuilder]: For program point L332(lines 332 339) no Hoare annotation was computed. [2021-10-13 07:53:39,816 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-10-13 07:53:39,816 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 204) no Hoare annotation was computed. [2021-10-13 07:53:39,820 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:53:40,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:53:40 BoogieIcfgContainer [2021-10-13 07:53:40,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:53:40,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:53:40,111 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:53:40,111 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:53:40,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:43:54" (3/4) ... [2021-10-13 07:53:40,114 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 07:53:40,130 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-13 07:53:40,131 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 07:53:40,132 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 07:53:40,133 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 07:53:40,376 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:53:40,376 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:53:40,377 INFO L168 Benchmark]: Toolchain (without parser) took 587654.07 ms. Allocated memory was 67.1 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 49.7 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 676.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:40,378 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 67.1 MB. Free memory was 49.4 MB in the beginning and 49.4 MB in the end (delta: 53.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:53:40,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.94 ms. Allocated memory is still 67.1 MB. Free memory was 49.5 MB in the beginning and 48.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:40,378 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.86 ms. Allocated memory is still 67.1 MB. Free memory was 48.1 MB in the beginning and 45.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:40,379 INFO L168 Benchmark]: Boogie Preprocessor took 49.31 ms. Allocated memory is still 67.1 MB. Free memory was 45.7 MB in the beginning and 43.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:40,379 INFO L168 Benchmark]: RCFGBuilder took 792.64 ms. Allocated memory is still 67.1 MB. Free memory was 43.6 MB in the beginning and 42.7 MB in the end (delta: 940.7 kB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:40,380 INFO L168 Benchmark]: TraceAbstraction took 586034.41 ms. Allocated memory was 67.1 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 42.1 MB in the beginning and 2.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 16.1 GB. [2021-10-13 07:53:40,380 INFO L168 Benchmark]: Witness Printer took 265.77 ms. Allocated memory is still 3.5 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:40,383 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.23 ms. Allocated memory is still 67.1 MB. Free memory was 49.4 MB in the beginning and 49.4 MB in the end (delta: 53.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 436.94 ms. Allocated memory is still 67.1 MB. Free memory was 49.5 MB in the beginning and 48.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.86 ms. Allocated memory is still 67.1 MB. Free memory was 48.1 MB in the beginning and 45.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.31 ms. Allocated memory is still 67.1 MB. Free memory was 45.7 MB in the beginning and 43.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 792.64 ms. Allocated memory is still 67.1 MB. Free memory was 43.6 MB in the beginning and 42.7 MB in the end (delta: 940.7 kB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 586034.41 ms. Allocated memory was 67.1 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 42.1 MB in the beginning and 2.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 16.1 GB. * Witness Printer took 265.77 ms. Allocated memory is still 3.5 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 585655.1ms, OverallIterations: 32, TraceHistogramMax: 9, EmptinessCheckTime: 216.8ms, AutomataDifference: 27357.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 489073.7ms, InitialAbstractionConstructionTime: 19.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7962 SDtfs, 15086 SDslu, 26127 SDs, 0 SdLazy, 2333 SolverSat, 613 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2021.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7702 GetRequests, 7509 SyntacticMatches, 5 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3161 ImplicationChecksByTransitivity, 3863.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18344occurred in iteration=30, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 14941.9ms AutomataMinimizationTime, 32 MinimizatonAttempts, 86033 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 2326 NumberOfFragments, 40765 HoareAnnotationTreeSize, 20 FomulaSimplifications, 177391 FormulaSimplificationTreeSizeReduction, 81436.0ms HoareSimplificationTime, 20 FomulaSimplificationsInter, 32791420 FormulaSimplificationTreeSizeReductionInter, 407530.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 556.1ms SsaConstructionTime, 1828.3ms SatisfiabilityAnalysisTime, 22579.1ms InterpolantComputationTime, 3784 NumberOfCodeBlocks, 3784 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 7496 ConstructedInterpolants, 0 QuantifiedInterpolants, 17172 SizeOfPredicates, 64 NumberOfNonLiveVariables, 7428 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 72 InterpolantComputations, 60 PerfectInterpolantSequences, 2904/3702 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: c2_i == 1bv32 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: !(e_wl == 1bv32) && (((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && data == t_b) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && ~bvadd64(2bv32, t_b) == data)) || (data == ~bvadd64(1bv32, t_b) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == r_st) && 2bv32 == e_f) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32) || (((((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && wl_st == 2bv32) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && c2_st == 0bv32) && c1_st == 0bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((!(e_wl == 1bv32) && (((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((c == ~bvadd64(1bv32, t_b) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t) || (((0bv32 == t_b && d == 1bv32) && c == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))))) || ((((!(e_wl == 1bv32) && 0bv32 == t_b) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && c == 1bv32) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (((!(e_wl == 1bv32) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((1bv32 == c_t && ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && 0bv32 == t_b) && d == 1bv32) && c == 1bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((c == ~bvadd64(1bv32, t_b) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && d == 0bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && c == 1bv32) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (((!(e_wl == 1bv32) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((c == ~bvadd64(1bv32, t_b) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && d == 0bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (!(e_wl == 1bv32) && ((((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && data == t_b) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && ~bvadd64(2bv32, t_b) == data)) || (data == ~bvadd64(1bv32, t_b) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))))) && ~bvadd64(1bv32, t_b) == c_t) || (((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && data == t_b) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && ~bvadd64(2bv32, t_b) == data)) || (data == ~bvadd64(1bv32, t_b) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))))))) || (!(e_wl == 1bv32) && (((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && 0bv32 == t_b) && ~bvadd64(2bv32, t_b) == data) && ~bvadd64(2bv32, t_b) == c) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && ~bvadd64(2bv32, t_b) == data) && ~bvadd64(2bv32, t_b) == c) && ~bvadd64(2bv32, t_b) == c_t) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && 0bv32 == t_b) && data == 0bv32) && ~bvadd64(2bv32, t_b) == c) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && data == 1bv32) && 0bv32 == t_b) && ~bvadd64(2bv32, t_b) == c) && ~bvadd64(2bv32, t_b) == d))) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(wb_st == 0bv32)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) && !(e_wl == 1bv32))) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && ~bvadd64(1bv32, t_b) == c_t) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))))) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && !(0bv32 == e_c)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_e)) && 1bv32 == c2_pc) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) && !(e_wl == 1bv32)) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && c == 1bv32) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (((!(e_wl == 1bv32) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((c == ~bvadd64(1bv32, t_b) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && d == 0bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: c2_i == 1bv32 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((!(e_wl == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && c == 1bv32) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (((!(e_wl == 1bv32) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((c == ~bvadd64(1bv32, t_b) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && d == 0bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((!(e_wl == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && !(c1_st == 0bv32)) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && !(c2_st == 0bv32)) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && c == 1bv32) || (((c == ~bvadd64(1bv32, t_b) && d == ~bvadd64(1bv32, t_b)) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && d == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && c == 1bv32) && 2bv32 == c2_st) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && (((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && ~bvadd64(2bv32, t_b) == c_t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)) || ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && ~bvadd64(2bv32, t_b) == d)))) || (((!(e_wl == 1bv32) && d == 0bv32) && c == 1bv32) && (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (!(e_wl == 1bv32) && ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || ((!(e_wl == 1bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && wb_pc == 0bv32) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && !(wl_pc == 2bv32)) && 0bv32 == processed) && !(wl_st == 0bv32)) && c1_st == 0bv32) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && wb_st == 0bv32) && 2bv32 == e_e) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && wb_pc == 0bv32) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((2bv32 == e_f && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 2bv32 == e_e) && !(wl_st == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || (!(e_wl == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || (!(e_wl == 1bv32) && ((((0bv32 == t_b && d == 1bv32) && c == 1bv32) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) || ((c == ~bvadd64(1bv32, t_b) && (((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || ((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && data == t) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i))) && ~bvadd64(1bv32, t_b) == c_t)))) || ((((((((((((((((((((((2bv32 == e_f && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && data == 0bv32) && c1_st == 0bv32) && 2bv32 == c2_st) && c1_pc == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && data == 0bv32) && c1_st == 0bv32) && c1_pc == 0bv32) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32) && c2_pc == 0bv32)) || (((((((((((((((((((((c_req_up == 0bv32 && 2bv32 == e_f) && 1bv32 == c1_pc) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && 0bv32 == processed) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && wl_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && !(0bv32 == e_c)) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_pc == 2bv32)) && c2_st == 0bv32) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && ~bvadd64(1bv32, t_b) == c_t) && 0bv32 == r_i)) || ((!(e_wl == 1bv32) && d == 0bv32) && ((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == t_b) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && ~bvadd64(2bv32, t_b) == c) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)))) || ((((((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && data == t_b) && 2bv32 == e_e) && 2bv32 == wb_st) && d == 0bv32) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && data == 0bv32) && 2bv32 == e_c) && wl_pc == 1bv32) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) && c2_pc == 0bv32)) || ((((((((((((((((((((data == ~bvadd64(1bv32, t_b) && 2bv32 == e_f) && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && c2_st == 0bv32) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(c_req_up == 1bv32)) && !(0bv32 == r_st)) && 2bv32 == e_wl) && 1bv32 == wb_i) && c2_i == 1bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 2bv32 == wb_st) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && 2bv32 == c2_st) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i)) || (((((((((((((((((((2bv32 == e_f && 1bv32 == c1_pc) && !(e_wl == 1bv32)) && !(0bv32 == r_st)) && 1bv32 == wb_i) && c2_i == 1bv32) && wb_st == 0bv32) && 1bv32 == c2_pc) && 2bv32 == e_e) && 0bv32 == processed) && !(wl_st == 0bv32)) && 2bv32 == c1_st) && ~bvadd64(2bv32, t_b) == data) && 2bv32 == c2_st) && !(e_wl == 0bv32)) && 2bv32 == e_c) && 2bv32 == e_g) && c1_i == 1bv32) && wb_pc == 1bv32) && 0bv32 == r_i) RESULT: Ultimate proved your program to be correct! [2021-10-13 07:53:40,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d18f2ebe-5dfa-49c6-8d29-4fb0310ce639/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...