./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ba07ae5f9ba9742e473cf2ed151649cad165d7c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:15:23,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:15:23,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:15:23,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:15:23,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:15:23,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:15:23,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:15:23,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:15:23,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:15:23,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:15:23,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:15:23,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:15:23,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:15:23,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:15:23,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:15:24,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:15:24,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:15:24,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:15:24,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:15:24,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:15:24,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:15:24,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:15:24,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:15:24,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:15:24,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:15:24,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:15:24,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:15:24,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:15:24,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:15:24,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:15:24,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:15:24,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:15:24,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:15:24,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:15:24,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:15:24,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:15:24,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:15:24,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:15:24,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:15:24,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:15:24,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:15:24,075 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:15:24,128 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:15:24,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:15:24,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:15:24,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:15:24,132 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:15:24,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:15:24,133 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:15:24,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:15:24,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:15:24,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:15:24,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:15:24,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:15:24,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:15:24,137 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:15:24,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:15:24,137 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:15:24,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:15:24,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:15:24,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:15:24,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:15:24,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:15:24,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:15:24,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:15:24,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:15:24,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:15:24,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:15:24,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:15:24,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:15:24,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:15:24,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/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-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ba07ae5f9ba9742e473cf2ed151649cad165d7c [2020-11-30 00:15:24,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:15:24,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:15:24,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:15:24,570 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:15:24,573 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:15:24,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/../../sv-benchmarks/c/systemc/toy.cil.c [2020-11-30 00:15:24,691 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/data/ae47b411d/0ecb47abb09d414a85ffc6d39e34ed73/FLAG158f81a20 [2020-11-30 00:15:25,558 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:15:25,561 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/sv-benchmarks/c/systemc/toy.cil.c [2020-11-30 00:15:25,590 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/data/ae47b411d/0ecb47abb09d414a85ffc6d39e34ed73/FLAG158f81a20 [2020-11-30 00:15:25,808 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/data/ae47b411d/0ecb47abb09d414a85ffc6d39e34ed73 [2020-11-30 00:15:25,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:15:25,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:15:25,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:15:25,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:15:25,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:15:25,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:15:25" (1/1) ... [2020-11-30 00:15:25,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ac01a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:25, skipping insertion in model container [2020-11-30 00:15:25,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:15:25" (1/1) ... [2020-11-30 00:15:25,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:15:25,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:15:26,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:15:26,368 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:15:26,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:15:26,464 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:15:26,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26 WrapperNode [2020-11-30 00:15:26,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:15:26,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:15:26,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:15:26,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:15:26,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (1/1) ... [2020-11-30 00:15:26,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (1/1) ... [2020-11-30 00:15:26,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:15:26,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:15:26,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:15:26,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:15:26,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (1/1) ... [2020-11-30 00:15:26,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (1/1) ... [2020-11-30 00:15:26,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (1/1) ... [2020-11-30 00:15:26,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (1/1) ... [2020-11-30 00:15:26,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (1/1) ... [2020-11-30 00:15:26,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (1/1) ... [2020-11-30 00:15:26,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (1/1) ... [2020-11-30 00:15:26,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:15:26,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:15:26,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:15:26,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:15:26,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:15:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:15:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:15:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:15:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:15:28,271 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:15:28,271 INFO L298 CfgBuilder]: Removed 28 assume(true) statements. [2020-11-30 00:15:28,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:15:28 BoogieIcfgContainer [2020-11-30 00:15:28,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:15:28,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:15:28,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:15:28,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:15:28,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:15:25" (1/3) ... [2020-11-30 00:15:28,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b5535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:15:28, skipping insertion in model container [2020-11-30 00:15:28,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:26" (2/3) ... [2020-11-30 00:15:28,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b5535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:15:28, skipping insertion in model container [2020-11-30 00:15:28,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:15:28" (3/3) ... [2020-11-30 00:15:28,289 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2020-11-30 00:15:28,302 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:15:28,307 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 00:15:28,320 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 00:15:28,357 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:15:28,357 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:15:28,357 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:15:28,358 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:15:28,358 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:15:28,358 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:15:28,358 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:15:28,358 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:15:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2020-11-30 00:15:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:28,395 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:28,396 INFO L422 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] [2020-11-30 00:15:28,396 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:28,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:28,405 INFO L82 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2020-11-30 00:15:28,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:28,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896528281] [2020-11-30 00:15:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:28,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896528281] [2020-11-30 00:15:28,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:28,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:28,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372196311] [2020-11-30 00:15:28,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:28,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:28,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:28,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:28,836 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2020-11-30 00:15:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:28,951 INFO L93 Difference]: Finished difference Result 245 states and 454 transitions. [2020-11-30 00:15:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:28,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-30 00:15:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:28,990 INFO L225 Difference]: With dead ends: 245 [2020-11-30 00:15:28,991 INFO L226 Difference]: Without dead ends: 122 [2020-11-30 00:15:28,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-30 00:15:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-11-30 00:15:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-30 00:15:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2020-11-30 00:15:29,105 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36 [2020-11-30 00:15:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:29,106 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2020-11-30 00:15:29,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2020-11-30 00:15:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:29,115 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:29,115 INFO L422 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] [2020-11-30 00:15:29,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:15:29,116 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:29,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2020-11-30 00:15:29,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:29,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117050531] [2020-11-30 00:15:29,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:29,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117050531] [2020-11-30 00:15:29,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:29,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:29,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270437939] [2020-11-30 00:15:29,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:29,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:29,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:29,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:29,315 INFO L87 Difference]: Start difference. First operand 122 states and 215 transitions. Second operand 4 states. [2020-11-30 00:15:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:29,467 INFO L93 Difference]: Finished difference Result 328 states and 577 transitions. [2020-11-30 00:15:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:15:29,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-30 00:15:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:29,478 INFO L225 Difference]: With dead ends: 328 [2020-11-30 00:15:29,479 INFO L226 Difference]: Without dead ends: 209 [2020-11-30 00:15:29,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-11-30 00:15:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2020-11-30 00:15:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-11-30 00:15:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 361 transitions. [2020-11-30 00:15:29,556 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 361 transitions. Word has length 36 [2020-11-30 00:15:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:29,556 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 361 transitions. [2020-11-30 00:15:29,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 361 transitions. [2020-11-30 00:15:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:29,566 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:29,567 INFO L422 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] [2020-11-30 00:15:29,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:15:29,569 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:29,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:29,572 INFO L82 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2020-11-30 00:15:29,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:29,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278552478] [2020-11-30 00:15:29,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:29,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278552478] [2020-11-30 00:15:29,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:29,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:29,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325357825] [2020-11-30 00:15:29,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:29,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:29,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:29,698 INFO L87 Difference]: Start difference. First operand 206 states and 361 transitions. Second operand 3 states. [2020-11-30 00:15:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:29,834 INFO L93 Difference]: Finished difference Result 403 states and 709 transitions. [2020-11-30 00:15:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:29,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-30 00:15:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:29,838 INFO L225 Difference]: With dead ends: 403 [2020-11-30 00:15:29,838 INFO L226 Difference]: Without dead ends: 206 [2020-11-30 00:15:29,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-11-30 00:15:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2020-11-30 00:15:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-11-30 00:15:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 349 transitions. [2020-11-30 00:15:29,895 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 349 transitions. Word has length 36 [2020-11-30 00:15:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:29,896 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 349 transitions. [2020-11-30 00:15:29,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 349 transitions. [2020-11-30 00:15:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:29,900 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:29,901 INFO L422 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] [2020-11-30 00:15:29,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:15:29,903 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:29,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:29,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2020-11-30 00:15:29,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:29,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694946653] [2020-11-30 00:15:29,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:30,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694946653] [2020-11-30 00:15:30,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:30,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:30,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386926955] [2020-11-30 00:15:30,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:30,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:30,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:30,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:30,042 INFO L87 Difference]: Start difference. First operand 206 states and 349 transitions. Second operand 4 states. [2020-11-30 00:15:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:30,367 INFO L93 Difference]: Finished difference Result 559 states and 950 transitions. [2020-11-30 00:15:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:30,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-30 00:15:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:30,373 INFO L225 Difference]: With dead ends: 559 [2020-11-30 00:15:30,373 INFO L226 Difference]: Without dead ends: 363 [2020-11-30 00:15:30,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-11-30 00:15:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 206. [2020-11-30 00:15:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-11-30 00:15:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 346 transitions. [2020-11-30 00:15:30,426 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 346 transitions. Word has length 36 [2020-11-30 00:15:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:30,427 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 346 transitions. [2020-11-30 00:15:30,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 346 transitions. [2020-11-30 00:15:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:30,430 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:30,430 INFO L422 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] [2020-11-30 00:15:30,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:15:30,431 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:30,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:30,432 INFO L82 PathProgramCache]: Analyzing trace with hash 181513546, now seen corresponding path program 1 times [2020-11-30 00:15:30,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:30,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705886450] [2020-11-30 00:15:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:30,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705886450] [2020-11-30 00:15:30,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:30,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:30,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749633521] [2020-11-30 00:15:30,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:30,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:30,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:30,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:30,503 INFO L87 Difference]: Start difference. First operand 206 states and 346 transitions. Second operand 4 states. [2020-11-30 00:15:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:30,720 INFO L93 Difference]: Finished difference Result 562 states and 946 transitions. [2020-11-30 00:15:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:30,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-30 00:15:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:30,733 INFO L225 Difference]: With dead ends: 562 [2020-11-30 00:15:30,733 INFO L226 Difference]: Without dead ends: 367 [2020-11-30 00:15:30,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2020-11-30 00:15:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 206. [2020-11-30 00:15:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-11-30 00:15:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 343 transitions. [2020-11-30 00:15:30,771 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 343 transitions. Word has length 36 [2020-11-30 00:15:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:30,771 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 343 transitions. [2020-11-30 00:15:30,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 343 transitions. [2020-11-30 00:15:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:30,772 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:30,773 INFO L422 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] [2020-11-30 00:15:30,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:15:30,773 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash 243553160, now seen corresponding path program 1 times [2020-11-30 00:15:30,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:30,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913773394] [2020-11-30 00:15:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:30,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913773394] [2020-11-30 00:15:30,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:30,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:30,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182967146] [2020-11-30 00:15:30,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:30,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:30,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:30,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:30,866 INFO L87 Difference]: Start difference. First operand 206 states and 343 transitions. Second operand 4 states. [2020-11-30 00:15:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:31,067 INFO L93 Difference]: Finished difference Result 574 states and 957 transitions. [2020-11-30 00:15:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:31,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-30 00:15:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:31,072 INFO L225 Difference]: With dead ends: 574 [2020-11-30 00:15:31,073 INFO L226 Difference]: Without dead ends: 380 [2020-11-30 00:15:31,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2020-11-30 00:15:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2020-11-30 00:15:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-11-30 00:15:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 347 transitions. [2020-11-30 00:15:31,095 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 347 transitions. Word has length 36 [2020-11-30 00:15:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:31,096 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 347 transitions. [2020-11-30 00:15:31,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 347 transitions. [2020-11-30 00:15:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:31,097 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:31,097 INFO L422 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] [2020-11-30 00:15:31,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:15:31,098 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash 384101770, now seen corresponding path program 1 times [2020-11-30 00:15:31,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:31,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114099287] [2020-11-30 00:15:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:31,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114099287] [2020-11-30 00:15:31,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:31,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:31,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730657640] [2020-11-30 00:15:31,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:31,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:31,173 INFO L87 Difference]: Start difference. First operand 212 states and 347 transitions. Second operand 4 states. [2020-11-30 00:15:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:31,412 INFO L93 Difference]: Finished difference Result 721 states and 1181 transitions. [2020-11-30 00:15:31,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:31,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-30 00:15:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:31,420 INFO L225 Difference]: With dead ends: 721 [2020-11-30 00:15:31,421 INFO L226 Difference]: Without dead ends: 522 [2020-11-30 00:15:31,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-11-30 00:15:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 345. [2020-11-30 00:15:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-11-30 00:15:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 562 transitions. [2020-11-30 00:15:31,461 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 562 transitions. Word has length 36 [2020-11-30 00:15:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:31,462 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 562 transitions. [2020-11-30 00:15:31,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 562 transitions. [2020-11-30 00:15:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:31,464 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:31,465 INFO L422 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] [2020-11-30 00:15:31,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:15:31,466 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:31,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:31,466 INFO L82 PathProgramCache]: Analyzing trace with hash 250088264, now seen corresponding path program 1 times [2020-11-30 00:15:31,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:31,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404124653] [2020-11-30 00:15:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:31,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404124653] [2020-11-30 00:15:31,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:31,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:31,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723724445] [2020-11-30 00:15:31,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:31,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:31,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:31,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:31,564 INFO L87 Difference]: Start difference. First operand 345 states and 562 transitions. Second operand 3 states. [2020-11-30 00:15:31,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:31,665 INFO L93 Difference]: Finished difference Result 822 states and 1345 transitions. [2020-11-30 00:15:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:31,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-30 00:15:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:31,671 INFO L225 Difference]: With dead ends: 822 [2020-11-30 00:15:31,672 INFO L226 Difference]: Without dead ends: 501 [2020-11-30 00:15:31,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-11-30 00:15:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 499. [2020-11-30 00:15:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-11-30 00:15:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 812 transitions. [2020-11-30 00:15:31,719 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 812 transitions. Word has length 36 [2020-11-30 00:15:31,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:31,722 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 812 transitions. [2020-11-30 00:15:31,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 812 transitions. [2020-11-30 00:15:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:31,724 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:31,724 INFO L422 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] [2020-11-30 00:15:31,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:15:31,724 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1539793604, now seen corresponding path program 1 times [2020-11-30 00:15:31,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:31,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021111615] [2020-11-30 00:15:31,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:31,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021111615] [2020-11-30 00:15:31,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:31,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:31,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736008111] [2020-11-30 00:15:31,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:31,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:31,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:31,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:31,813 INFO L87 Difference]: Start difference. First operand 499 states and 812 transitions. Second operand 4 states. [2020-11-30 00:15:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:32,001 INFO L93 Difference]: Finished difference Result 1271 states and 2069 transitions. [2020-11-30 00:15:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:15:32,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-30 00:15:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:32,011 INFO L225 Difference]: With dead ends: 1271 [2020-11-30 00:15:32,012 INFO L226 Difference]: Without dead ends: 789 [2020-11-30 00:15:32,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2020-11-30 00:15:32,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 499. [2020-11-30 00:15:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-11-30 00:15:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 804 transitions. [2020-11-30 00:15:32,061 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 804 transitions. Word has length 36 [2020-11-30 00:15:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:32,062 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 804 transitions. [2020-11-30 00:15:32,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 804 transitions. [2020-11-30 00:15:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:32,063 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:32,063 INFO L422 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] [2020-11-30 00:15:32,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:15:32,064 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:32,066 INFO L82 PathProgramCache]: Analyzing trace with hash -48554298, now seen corresponding path program 1 times [2020-11-30 00:15:32,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:32,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726251083] [2020-11-30 00:15:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:32,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726251083] [2020-11-30 00:15:32,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:32,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:32,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067715411] [2020-11-30 00:15:32,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:32,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:32,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:32,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:32,150 INFO L87 Difference]: Start difference. First operand 499 states and 804 transitions. Second operand 4 states. [2020-11-30 00:15:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:32,354 INFO L93 Difference]: Finished difference Result 1267 states and 2042 transitions. [2020-11-30 00:15:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:15:32,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-30 00:15:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:32,365 INFO L225 Difference]: With dead ends: 1267 [2020-11-30 00:15:32,365 INFO L226 Difference]: Without dead ends: 791 [2020-11-30 00:15:32,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2020-11-30 00:15:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 499. [2020-11-30 00:15:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-11-30 00:15:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 796 transitions. [2020-11-30 00:15:32,433 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 796 transitions. Word has length 36 [2020-11-30 00:15:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:32,433 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 796 transitions. [2020-11-30 00:15:32,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 796 transitions. [2020-11-30 00:15:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:32,435 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:32,435 INFO L422 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] [2020-11-30 00:15:32,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:15:32,435 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1328417976, now seen corresponding path program 1 times [2020-11-30 00:15:32,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:32,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473060452] [2020-11-30 00:15:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:32,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473060452] [2020-11-30 00:15:32,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:32,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:32,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150683697] [2020-11-30 00:15:32,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:32,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:32,508 INFO L87 Difference]: Start difference. First operand 499 states and 796 transitions. Second operand 4 states. [2020-11-30 00:15:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:32,709 INFO L93 Difference]: Finished difference Result 1206 states and 1920 transitions. [2020-11-30 00:15:32,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:15:32,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-30 00:15:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:32,718 INFO L225 Difference]: With dead ends: 1206 [2020-11-30 00:15:32,718 INFO L226 Difference]: Without dead ends: 724 [2020-11-30 00:15:32,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2020-11-30 00:15:32,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 547. [2020-11-30 00:15:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-11-30 00:15:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 853 transitions. [2020-11-30 00:15:32,770 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 853 transitions. Word has length 36 [2020-11-30 00:15:32,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:32,771 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 853 transitions. [2020-11-30 00:15:32,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 853 transitions. [2020-11-30 00:15:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:15:32,772 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:32,772 INFO L422 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] [2020-11-30 00:15:32,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:15:32,773 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:32,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2020-11-30 00:15:32,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:32,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013718779] [2020-11-30 00:15:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:32,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013718779] [2020-11-30 00:15:32,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:32,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:32,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823945339] [2020-11-30 00:15:32,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:32,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:32,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:32,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:32,833 INFO L87 Difference]: Start difference. First operand 547 states and 853 transitions. Second operand 3 states. [2020-11-30 00:15:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:32,988 INFO L93 Difference]: Finished difference Result 1300 states and 2032 transitions. [2020-11-30 00:15:32,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:32,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-30 00:15:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:32,998 INFO L225 Difference]: With dead ends: 1300 [2020-11-30 00:15:32,998 INFO L226 Difference]: Without dead ends: 767 [2020-11-30 00:15:33,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-11-30 00:15:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2020-11-30 00:15:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2020-11-30 00:15:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1177 transitions. [2020-11-30 00:15:33,082 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1177 transitions. Word has length 36 [2020-11-30 00:15:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:33,083 INFO L481 AbstractCegarLoop]: Abstraction has 764 states and 1177 transitions. [2020-11-30 00:15:33,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1177 transitions. [2020-11-30 00:15:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 00:15:33,084 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:33,085 INFO L422 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] [2020-11-30 00:15:33,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:15:33,086 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:33,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:33,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2007619262, now seen corresponding path program 1 times [2020-11-30 00:15:33,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:33,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060545438] [2020-11-30 00:15:33,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:33,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060545438] [2020-11-30 00:15:33,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:33,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:33,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342267389] [2020-11-30 00:15:33,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:33,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:33,127 INFO L87 Difference]: Start difference. First operand 764 states and 1177 transitions. Second operand 3 states. [2020-11-30 00:15:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:33,264 INFO L93 Difference]: Finished difference Result 1882 states and 2939 transitions. [2020-11-30 00:15:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:33,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-11-30 00:15:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:33,275 INFO L225 Difference]: With dead ends: 1882 [2020-11-30 00:15:33,275 INFO L226 Difference]: Without dead ends: 1145 [2020-11-30 00:15:33,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2020-11-30 00:15:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1143. [2020-11-30 00:15:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2020-11-30 00:15:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1776 transitions. [2020-11-30 00:15:33,401 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1776 transitions. Word has length 46 [2020-11-30 00:15:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:33,402 INFO L481 AbstractCegarLoop]: Abstraction has 1143 states and 1776 transitions. [2020-11-30 00:15:33,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:33,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1776 transitions. [2020-11-30 00:15:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 00:15:33,406 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:33,406 INFO L422 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] [2020-11-30 00:15:33,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 00:15:33,408 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:33,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2039201540, now seen corresponding path program 1 times [2020-11-30 00:15:33,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:33,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174612632] [2020-11-30 00:15:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 00:15:33,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174612632] [2020-11-30 00:15:33,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:33,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:33,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487069681] [2020-11-30 00:15:33,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:33,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:33,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:33,471 INFO L87 Difference]: Start difference. First operand 1143 states and 1776 transitions. Second operand 3 states. [2020-11-30 00:15:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:33,587 INFO L93 Difference]: Finished difference Result 2237 states and 3493 transitions. [2020-11-30 00:15:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:33,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-11-30 00:15:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:33,597 INFO L225 Difference]: With dead ends: 2237 [2020-11-30 00:15:33,598 INFO L226 Difference]: Without dead ends: 1121 [2020-11-30 00:15:33,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2020-11-30 00:15:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2020-11-30 00:15:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2020-11-30 00:15:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1749 transitions. [2020-11-30 00:15:33,699 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1749 transitions. Word has length 46 [2020-11-30 00:15:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:33,699 INFO L481 AbstractCegarLoop]: Abstraction has 1121 states and 1749 transitions. [2020-11-30 00:15:33,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1749 transitions. [2020-11-30 00:15:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-30 00:15:33,701 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:33,701 INFO L422 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] [2020-11-30 00:15:33,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 00:15:33,702 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:33,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:33,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1252375879, now seen corresponding path program 1 times [2020-11-30 00:15:33,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:33,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322568638] [2020-11-30 00:15:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:33,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322568638] [2020-11-30 00:15:33,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:33,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:33,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506407097] [2020-11-30 00:15:33,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:33,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:33,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:33,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:33,751 INFO L87 Difference]: Start difference. First operand 1121 states and 1749 transitions. Second operand 3 states. [2020-11-30 00:15:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:33,957 INFO L93 Difference]: Finished difference Result 2849 states and 4504 transitions. [2020-11-30 00:15:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:33,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-11-30 00:15:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:33,974 INFO L225 Difference]: With dead ends: 2849 [2020-11-30 00:15:33,975 INFO L226 Difference]: Without dead ends: 1755 [2020-11-30 00:15:33,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2020-11-30 00:15:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2020-11-30 00:15:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2020-11-30 00:15:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2759 transitions. [2020-11-30 00:15:34,136 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2759 transitions. Word has length 47 [2020-11-30 00:15:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:34,138 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2759 transitions. [2020-11-30 00:15:34,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2759 transitions. [2020-11-30 00:15:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 00:15:34,141 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:34,158 INFO L422 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] [2020-11-30 00:15:34,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 00:15:34,159 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:34,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:34,160 INFO L82 PathProgramCache]: Analyzing trace with hash 699123049, now seen corresponding path program 1 times [2020-11-30 00:15:34,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:34,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501024509] [2020-11-30 00:15:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:34,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501024509] [2020-11-30 00:15:34,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:34,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:34,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436658162] [2020-11-30 00:15:34,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:34,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:34,203 INFO L87 Difference]: Start difference. First operand 1753 states and 2759 transitions. Second operand 3 states. [2020-11-30 00:15:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:34,499 INFO L93 Difference]: Finished difference Result 4716 states and 7517 transitions. [2020-11-30 00:15:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:34,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-11-30 00:15:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:34,543 INFO L225 Difference]: With dead ends: 4716 [2020-11-30 00:15:34,543 INFO L226 Difference]: Without dead ends: 2992 [2020-11-30 00:15:34,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-11-30 00:15:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2990. [2020-11-30 00:15:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2020-11-30 00:15:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4746 transitions. [2020-11-30 00:15:34,835 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4746 transitions. Word has length 48 [2020-11-30 00:15:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:34,836 INFO L481 AbstractCegarLoop]: Abstraction has 2990 states and 4746 transitions. [2020-11-30 00:15:34,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4746 transitions. [2020-11-30 00:15:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 00:15:34,839 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:34,839 INFO L422 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] [2020-11-30 00:15:34,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 00:15:34,842 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash 947269543, now seen corresponding path program 1 times [2020-11-30 00:15:34,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:34,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493326213] [2020-11-30 00:15:34,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 00:15:34,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493326213] [2020-11-30 00:15:34,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:34,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:34,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534227449] [2020-11-30 00:15:34,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:34,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:34,876 INFO L87 Difference]: Start difference. First operand 2990 states and 4746 transitions. Second operand 3 states. [2020-11-30 00:15:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:35,166 INFO L93 Difference]: Finished difference Result 5929 states and 9433 transitions. [2020-11-30 00:15:35,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:35,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-11-30 00:15:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:35,192 INFO L225 Difference]: With dead ends: 5929 [2020-11-30 00:15:35,192 INFO L226 Difference]: Without dead ends: 2968 [2020-11-30 00:15:35,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:35,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-11-30 00:15:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2020-11-30 00:15:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2020-11-30 00:15:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 4720 transitions. [2020-11-30 00:15:35,517 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 4720 transitions. Word has length 48 [2020-11-30 00:15:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:35,518 INFO L481 AbstractCegarLoop]: Abstraction has 2968 states and 4720 transitions. [2020-11-30 00:15:35,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 4720 transitions. [2020-11-30 00:15:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-30 00:15:35,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:35,521 INFO L422 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] [2020-11-30 00:15:35,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 00:15:35,521 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1895142414, now seen corresponding path program 1 times [2020-11-30 00:15:35,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:35,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759724740] [2020-11-30 00:15:35,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:35,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759724740] [2020-11-30 00:15:35,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:35,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:35,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590621243] [2020-11-30 00:15:35,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:35,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:35,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:35,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:35,601 INFO L87 Difference]: Start difference. First operand 2968 states and 4720 transitions. Second operand 4 states. [2020-11-30 00:15:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:36,130 INFO L93 Difference]: Finished difference Result 7517 states and 12005 transitions. [2020-11-30 00:15:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:36,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-11-30 00:15:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:36,164 INFO L225 Difference]: With dead ends: 7517 [2020-11-30 00:15:36,164 INFO L226 Difference]: Without dead ends: 3845 [2020-11-30 00:15:36,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2020-11-30 00:15:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2020-11-30 00:15:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3845 states. [2020-11-30 00:15:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6086 transitions. [2020-11-30 00:15:36,551 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6086 transitions. Word has length 49 [2020-11-30 00:15:36,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:36,552 INFO L481 AbstractCegarLoop]: Abstraction has 3845 states and 6086 transitions. [2020-11-30 00:15:36,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6086 transitions. [2020-11-30 00:15:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-30 00:15:36,555 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:36,556 INFO L422 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] [2020-11-30 00:15:36,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 00:15:36,556 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:36,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:36,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1811955793, now seen corresponding path program 1 times [2020-11-30 00:15:36,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:36,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439189321] [2020-11-30 00:15:36,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:36,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439189321] [2020-11-30 00:15:36,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:36,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:15:36,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909438900] [2020-11-30 00:15:36,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:15:36,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:36,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:15:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:36,642 INFO L87 Difference]: Start difference. First operand 3845 states and 6086 transitions. Second operand 5 states. [2020-11-30 00:15:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:37,437 INFO L93 Difference]: Finished difference Result 9812 states and 15418 transitions. [2020-11-30 00:15:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:15:37,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-11-30 00:15:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:37,485 INFO L225 Difference]: With dead ends: 9812 [2020-11-30 00:15:37,486 INFO L226 Difference]: Without dead ends: 5990 [2020-11-30 00:15:37,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:15:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2020-11-30 00:15:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 4496. [2020-11-30 00:15:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4496 states. [2020-11-30 00:15:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 6959 transitions. [2020-11-30 00:15:38,024 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 6959 transitions. Word has length 54 [2020-11-30 00:15:38,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:38,025 INFO L481 AbstractCegarLoop]: Abstraction has 4496 states and 6959 transitions. [2020-11-30 00:15:38,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:15:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 6959 transitions. [2020-11-30 00:15:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-30 00:15:38,031 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:38,031 INFO L422 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] [2020-11-30 00:15:38,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 00:15:38,032 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:38,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1061831186, now seen corresponding path program 1 times [2020-11-30 00:15:38,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:38,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101204855] [2020-11-30 00:15:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:38,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101204855] [2020-11-30 00:15:38,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:38,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:38,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075952176] [2020-11-30 00:15:38,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:38,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:38,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:38,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:38,103 INFO L87 Difference]: Start difference. First operand 4496 states and 6959 transitions. Second operand 3 states. [2020-11-30 00:15:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:38,544 INFO L93 Difference]: Finished difference Result 9315 states and 14384 transitions. [2020-11-30 00:15:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:38,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-11-30 00:15:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:38,568 INFO L225 Difference]: With dead ends: 9315 [2020-11-30 00:15:38,578 INFO L226 Difference]: Without dead ends: 4848 [2020-11-30 00:15:38,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4848 states. [2020-11-30 00:15:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4848 to 4816. [2020-11-30 00:15:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4816 states. [2020-11-30 00:15:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4816 states to 4816 states and 7208 transitions. [2020-11-30 00:15:39,170 INFO L78 Accepts]: Start accepts. Automaton has 4816 states and 7208 transitions. Word has length 86 [2020-11-30 00:15:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:39,171 INFO L481 AbstractCegarLoop]: Abstraction has 4816 states and 7208 transitions. [2020-11-30 00:15:39,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4816 states and 7208 transitions. [2020-11-30 00:15:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 00:15:39,178 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:39,178 INFO L422 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] [2020-11-30 00:15:39,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 00:15:39,179 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:39,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1462014789, now seen corresponding path program 1 times [2020-11-30 00:15:39,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:39,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307500608] [2020-11-30 00:15:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:39,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307500608] [2020-11-30 00:15:39,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:39,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:39,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928346782] [2020-11-30 00:15:39,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:39,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:39,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:39,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:39,260 INFO L87 Difference]: Start difference. First operand 4816 states and 7208 transitions. Second operand 3 states. [2020-11-30 00:15:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:39,849 INFO L93 Difference]: Finished difference Result 10113 states and 15094 transitions. [2020-11-30 00:15:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:39,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-11-30 00:15:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:39,862 INFO L225 Difference]: With dead ends: 10113 [2020-11-30 00:15:39,862 INFO L226 Difference]: Without dead ends: 5338 [2020-11-30 00:15:39,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5338 states. [2020-11-30 00:15:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5338 to 5290. [2020-11-30 00:15:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5290 states. [2020-11-30 00:15:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7651 transitions. [2020-11-30 00:15:40,390 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7651 transitions. Word has length 87 [2020-11-30 00:15:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:40,391 INFO L481 AbstractCegarLoop]: Abstraction has 5290 states and 7651 transitions. [2020-11-30 00:15:40,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7651 transitions. [2020-11-30 00:15:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-30 00:15:40,399 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:40,399 INFO L422 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] [2020-11-30 00:15:40,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 00:15:40,401 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1630168212, now seen corresponding path program 1 times [2020-11-30 00:15:40,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:40,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455882134] [2020-11-30 00:15:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:15:40,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455882134] [2020-11-30 00:15:40,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:40,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:40,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183454444] [2020-11-30 00:15:40,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:40,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:40,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:40,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:40,488 INFO L87 Difference]: Start difference. First operand 5290 states and 7651 transitions. Second operand 3 states. [2020-11-30 00:15:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:41,018 INFO L93 Difference]: Finished difference Result 10887 states and 15753 transitions. [2020-11-30 00:15:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:41,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-11-30 00:15:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:41,033 INFO L225 Difference]: With dead ends: 10887 [2020-11-30 00:15:41,034 INFO L226 Difference]: Without dead ends: 5658 [2020-11-30 00:15:41,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2020-11-30 00:15:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5076. [2020-11-30 00:15:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2020-11-30 00:15:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7021 transitions. [2020-11-30 00:15:41,513 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7021 transitions. Word has length 88 [2020-11-30 00:15:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:41,514 INFO L481 AbstractCegarLoop]: Abstraction has 5076 states and 7021 transitions. [2020-11-30 00:15:41,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7021 transitions. [2020-11-30 00:15:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-30 00:15:41,521 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:41,521 INFO L422 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] [2020-11-30 00:15:41,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 00:15:41,522 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:41,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1033390909, now seen corresponding path program 1 times [2020-11-30 00:15:41,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:41,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299603542] [2020-11-30 00:15:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 00:15:41,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299603542] [2020-11-30 00:15:41,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:41,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:41,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371165830] [2020-11-30 00:15:41,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:41,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:41,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:41,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:41,572 INFO L87 Difference]: Start difference. First operand 5076 states and 7021 transitions. Second operand 3 states. [2020-11-30 00:15:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:42,069 INFO L93 Difference]: Finished difference Result 8882 states and 12338 transitions. [2020-11-30 00:15:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:42,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-11-30 00:15:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:42,085 INFO L225 Difference]: With dead ends: 8882 [2020-11-30 00:15:42,085 INFO L226 Difference]: Without dead ends: 5076 [2020-11-30 00:15:42,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2020-11-30 00:15:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 5076. [2020-11-30 00:15:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2020-11-30 00:15:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7008 transitions. [2020-11-30 00:15:42,655 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7008 transitions. Word has length 89 [2020-11-30 00:15:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:42,655 INFO L481 AbstractCegarLoop]: Abstraction has 5076 states and 7008 transitions. [2020-11-30 00:15:42,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7008 transitions. [2020-11-30 00:15:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-30 00:15:42,665 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:42,666 INFO L422 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] [2020-11-30 00:15:42,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 00:15:42,666 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:42,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:42,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2044508159, now seen corresponding path program 1 times [2020-11-30 00:15:42,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:42,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994040239] [2020-11-30 00:15:42,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 00:15:42,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994040239] [2020-11-30 00:15:42,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:42,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:42,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543399025] [2020-11-30 00:15:42,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:42,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:42,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:42,772 INFO L87 Difference]: Start difference. First operand 5076 states and 7008 transitions. Second operand 4 states. [2020-11-30 00:15:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:43,653 INFO L93 Difference]: Finished difference Result 9480 states and 13021 transitions. [2020-11-30 00:15:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:43,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-11-30 00:15:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:43,671 INFO L225 Difference]: With dead ends: 9480 [2020-11-30 00:15:43,672 INFO L226 Difference]: Without dead ends: 4855 [2020-11-30 00:15:43,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2020-11-30 00:15:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4741. [2020-11-30 00:15:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4741 states. [2020-11-30 00:15:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 6326 transitions. [2020-11-30 00:15:44,176 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 6326 transitions. Word has length 89 [2020-11-30 00:15:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:44,176 INFO L481 AbstractCegarLoop]: Abstraction has 4741 states and 6326 transitions. [2020-11-30 00:15:44,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 6326 transitions. [2020-11-30 00:15:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-30 00:15:44,191 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:44,191 INFO L422 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] [2020-11-30 00:15:44,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 00:15:44,192 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash -264985591, now seen corresponding path program 1 times [2020-11-30 00:15:44,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:44,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729563375] [2020-11-30 00:15:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 00:15:44,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729563375] [2020-11-30 00:15:44,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:44,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:44,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719142114] [2020-11-30 00:15:44,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:44,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:44,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:44,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:44,247 INFO L87 Difference]: Start difference. First operand 4741 states and 6326 transitions. Second operand 3 states. [2020-11-30 00:15:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:44,706 INFO L93 Difference]: Finished difference Result 9037 states and 12049 transitions. [2020-11-30 00:15:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:44,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-11-30 00:15:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:44,718 INFO L225 Difference]: With dead ends: 9037 [2020-11-30 00:15:44,718 INFO L226 Difference]: Without dead ends: 4687 [2020-11-30 00:15:44,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-11-30 00:15:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4687. [2020-11-30 00:15:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4687 states. [2020-11-30 00:15:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 6220 transitions. [2020-11-30 00:15:45,209 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 6220 transitions. Word has length 116 [2020-11-30 00:15:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:45,209 INFO L481 AbstractCegarLoop]: Abstraction has 4687 states and 6220 transitions. [2020-11-30 00:15:45,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 6220 transitions. [2020-11-30 00:15:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-11-30 00:15:45,222 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:45,222 INFO L422 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] [2020-11-30 00:15:45,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-30 00:15:45,223 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:45,224 INFO L82 PathProgramCache]: Analyzing trace with hash -450160901, now seen corresponding path program 1 times [2020-11-30 00:15:45,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:45,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539778534] [2020-11-30 00:15:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 00:15:45,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539778534] [2020-11-30 00:15:45,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:45,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:45,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597392922] [2020-11-30 00:15:45,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:45,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:45,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:45,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:45,295 INFO L87 Difference]: Start difference. First operand 4687 states and 6220 transitions. Second operand 4 states. [2020-11-30 00:15:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:45,831 INFO L93 Difference]: Finished difference Result 8325 states and 11072 transitions. [2020-11-30 00:15:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:45,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2020-11-30 00:15:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:45,843 INFO L225 Difference]: With dead ends: 8325 [2020-11-30 00:15:45,844 INFO L226 Difference]: Without dead ends: 4607 [2020-11-30 00:15:45,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4607 states. [2020-11-30 00:15:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4607 to 4605. [2020-11-30 00:15:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2020-11-30 00:15:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 5999 transitions. [2020-11-30 00:15:46,313 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 5999 transitions. Word has length 128 [2020-11-30 00:15:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:46,314 INFO L481 AbstractCegarLoop]: Abstraction has 4605 states and 5999 transitions. [2020-11-30 00:15:46,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 5999 transitions. [2020-11-30 00:15:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-30 00:15:46,325 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:46,326 INFO L422 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] [2020-11-30 00:15:46,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-30 00:15:46,326 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:46,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash 337160423, now seen corresponding path program 1 times [2020-11-30 00:15:46,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:46,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830306057] [2020-11-30 00:15:46,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-30 00:15:46,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830306057] [2020-11-30 00:15:46,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:46,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:46,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197370257] [2020-11-30 00:15:46,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:46,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:46,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:46,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:46,397 INFO L87 Difference]: Start difference. First operand 4605 states and 5999 transitions. Second operand 3 states. [2020-11-30 00:15:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:46,753 INFO L93 Difference]: Finished difference Result 8823 states and 11486 transitions. [2020-11-30 00:15:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:46,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-11-30 00:15:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:46,765 INFO L225 Difference]: With dead ends: 8823 [2020-11-30 00:15:46,765 INFO L226 Difference]: Without dead ends: 4604 [2020-11-30 00:15:46,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2020-11-30 00:15:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 4564. [2020-11-30 00:15:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4564 states. [2020-11-30 00:15:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 5916 transitions. [2020-11-30 00:15:47,255 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 5916 transitions. Word has length 134 [2020-11-30 00:15:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:47,256 INFO L481 AbstractCegarLoop]: Abstraction has 4564 states and 5916 transitions. [2020-11-30 00:15:47,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 5916 transitions. [2020-11-30 00:15:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-30 00:15:47,266 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:47,267 INFO L422 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] [2020-11-30 00:15:47,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-30 00:15:47,267 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:47,268 INFO L82 PathProgramCache]: Analyzing trace with hash 207133831, now seen corresponding path program 1 times [2020-11-30 00:15:47,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:47,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003498226] [2020-11-30 00:15:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-30 00:15:47,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003498226] [2020-11-30 00:15:47,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:47,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:47,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99436190] [2020-11-30 00:15:47,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:47,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:47,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:47,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:47,336 INFO L87 Difference]: Start difference. First operand 4564 states and 5916 transitions. Second operand 3 states. [2020-11-30 00:15:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:47,779 INFO L93 Difference]: Finished difference Result 8762 states and 11347 transitions. [2020-11-30 00:15:47,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:47,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-11-30 00:15:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:47,785 INFO L225 Difference]: With dead ends: 8762 [2020-11-30 00:15:47,785 INFO L226 Difference]: Without dead ends: 4574 [2020-11-30 00:15:47,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2020-11-30 00:15:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4534. [2020-11-30 00:15:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4534 states. [2020-11-30 00:15:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 5845 transitions. [2020-11-30 00:15:48,254 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 5845 transitions. Word has length 134 [2020-11-30 00:15:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:48,255 INFO L481 AbstractCegarLoop]: Abstraction has 4534 states and 5845 transitions. [2020-11-30 00:15:48,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 5845 transitions. [2020-11-30 00:15:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-30 00:15:48,264 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:48,265 INFO L422 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] [2020-11-30 00:15:48,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-30 00:15:48,265 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1190580402, now seen corresponding path program 1 times [2020-11-30 00:15:48,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:48,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324540547] [2020-11-30 00:15:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-30 00:15:48,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324540547] [2020-11-30 00:15:48,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:48,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:48,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167067002] [2020-11-30 00:15:48,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:48,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:48,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:48,338 INFO L87 Difference]: Start difference. First operand 4534 states and 5845 transitions. Second operand 4 states. [2020-11-30 00:15:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:48,645 INFO L93 Difference]: Finished difference Result 7387 states and 9568 transitions. [2020-11-30 00:15:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:48,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-11-30 00:15:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:48,649 INFO L225 Difference]: With dead ends: 7387 [2020-11-30 00:15:48,650 INFO L226 Difference]: Without dead ends: 3225 [2020-11-30 00:15:48,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2020-11-30 00:15:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3223. [2020-11-30 00:15:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3223 states. [2020-11-30 00:15:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4047 transitions. [2020-11-30 00:15:48,941 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4047 transitions. Word has length 137 [2020-11-30 00:15:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:48,941 INFO L481 AbstractCegarLoop]: Abstraction has 3223 states and 4047 transitions. [2020-11-30 00:15:48,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4047 transitions. [2020-11-30 00:15:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-30 00:15:48,949 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:48,949 INFO L422 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] [2020-11-30 00:15:48,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-30 00:15:48,950 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:48,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1209536509, now seen corresponding path program 1 times [2020-11-30 00:15:48,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:48,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084791343] [2020-11-30 00:15:48,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-30 00:15:49,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084791343] [2020-11-30 00:15:49,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:49,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:49,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817691791] [2020-11-30 00:15:49,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:49,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:49,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:49,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:49,085 INFO L87 Difference]: Start difference. First operand 3223 states and 4047 transitions. Second operand 4 states. [2020-11-30 00:15:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:49,354 INFO L93 Difference]: Finished difference Result 5208 states and 6542 transitions. [2020-11-30 00:15:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:49,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-11-30 00:15:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:49,358 INFO L225 Difference]: With dead ends: 5208 [2020-11-30 00:15:49,358 INFO L226 Difference]: Without dead ends: 2057 [2020-11-30 00:15:49,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2020-11-30 00:15:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2055. [2020-11-30 00:15:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2020-11-30 00:15:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2509 transitions. [2020-11-30 00:15:49,566 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2509 transitions. Word has length 137 [2020-11-30 00:15:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:49,566 INFO L481 AbstractCegarLoop]: Abstraction has 2055 states and 2509 transitions. [2020-11-30 00:15:49,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2509 transitions. [2020-11-30 00:15:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-11-30 00:15:49,570 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:49,570 INFO L422 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] [2020-11-30 00:15:49,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-30 00:15:49,571 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:49,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1699329156, now seen corresponding path program 1 times [2020-11-30 00:15:49,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:49,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669258481] [2020-11-30 00:15:49,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-30 00:15:49,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669258481] [2020-11-30 00:15:49,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:49,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:49,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285370184] [2020-11-30 00:15:49,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:49,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:49,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:49,684 INFO L87 Difference]: Start difference. First operand 2055 states and 2509 transitions. Second operand 3 states. [2020-11-30 00:15:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:49,916 INFO L93 Difference]: Finished difference Result 3727 states and 4582 transitions. [2020-11-30 00:15:49,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:49,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-11-30 00:15:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:49,921 INFO L225 Difference]: With dead ends: 3727 [2020-11-30 00:15:49,921 INFO L226 Difference]: Without dead ends: 2013 [2020-11-30 00:15:49,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2020-11-30 00:15:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1935. [2020-11-30 00:15:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2020-11-30 00:15:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2331 transitions. [2020-11-30 00:15:50,119 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2331 transitions. Word has length 176 [2020-11-30 00:15:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:50,120 INFO L481 AbstractCegarLoop]: Abstraction has 1935 states and 2331 transitions. [2020-11-30 00:15:50,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2331 transitions. [2020-11-30 00:15:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-11-30 00:15:50,122 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:50,122 INFO L422 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] [2020-11-30 00:15:50,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-30 00:15:50,123 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:50,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:50,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1448447116, now seen corresponding path program 1 times [2020-11-30 00:15:50,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:50,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642870691] [2020-11-30 00:15:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-30 00:15:50,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642870691] [2020-11-30 00:15:50,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:50,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:50,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633382215] [2020-11-30 00:15:50,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:50,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:50,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:50,227 INFO L87 Difference]: Start difference. First operand 1935 states and 2331 transitions. Second operand 3 states. [2020-11-30 00:15:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:50,523 INFO L93 Difference]: Finished difference Result 4164 states and 5050 transitions. [2020-11-30 00:15:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:50,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-11-30 00:15:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:50,528 INFO L225 Difference]: With dead ends: 4164 [2020-11-30 00:15:50,528 INFO L226 Difference]: Without dead ends: 2566 [2020-11-30 00:15:50,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2020-11-30 00:15:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2213. [2020-11-30 00:15:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2020-11-30 00:15:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2631 transitions. [2020-11-30 00:15:50,725 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2631 transitions. Word has length 182 [2020-11-30 00:15:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:50,726 INFO L481 AbstractCegarLoop]: Abstraction has 2213 states and 2631 transitions. [2020-11-30 00:15:50,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2631 transitions. [2020-11-30 00:15:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-30 00:15:50,728 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:50,729 INFO L422 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] [2020-11-30 00:15:50,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-30 00:15:50,729 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:50,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:50,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2030050848, now seen corresponding path program 1 times [2020-11-30 00:15:50,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:50,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806224533] [2020-11-30 00:15:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-30 00:15:50,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806224533] [2020-11-30 00:15:50,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:50,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:50,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747560276] [2020-11-30 00:15:50,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:50,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:50,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:50,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:50,887 INFO L87 Difference]: Start difference. First operand 2213 states and 2631 transitions. Second operand 3 states. [2020-11-30 00:15:51,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:51,084 INFO L93 Difference]: Finished difference Result 3754 states and 4497 transitions. [2020-11-30 00:15:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:51,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-11-30 00:15:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:51,087 INFO L225 Difference]: With dead ends: 3754 [2020-11-30 00:15:51,088 INFO L226 Difference]: Without dead ends: 1876 [2020-11-30 00:15:51,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2020-11-30 00:15:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1797. [2020-11-30 00:15:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2020-11-30 00:15:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2105 transitions. [2020-11-30 00:15:51,227 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2105 transitions. Word has length 185 [2020-11-30 00:15:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:51,228 INFO L481 AbstractCegarLoop]: Abstraction has 1797 states and 2105 transitions. [2020-11-30 00:15:51,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2105 transitions. [2020-11-30 00:15:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-30 00:15:51,229 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:51,230 INFO L422 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] [2020-11-30 00:15:51,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-30 00:15:51,230 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:51,231 INFO L82 PathProgramCache]: Analyzing trace with hash 47286050, now seen corresponding path program 1 times [2020-11-30 00:15:51,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:51,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325477254] [2020-11-30 00:15:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 00:15:51,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325477254] [2020-11-30 00:15:51,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761329894] [2020-11-30 00:15:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:15:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:51,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-30 00:15:51,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:15:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 00:15:52,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:15:52,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-11-30 00:15:52,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564833885] [2020-11-30 00:15:52,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 00:15:52,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:52,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 00:15:52,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-11-30 00:15:52,603 INFO L87 Difference]: Start difference. First operand 1797 states and 2105 transitions. Second operand 19 states. [2020-11-30 00:15:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:54,670 INFO L93 Difference]: Finished difference Result 5663 states and 6619 transitions. [2020-11-30 00:15:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-30 00:15:54,671 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 185 [2020-11-30 00:15:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:54,694 INFO L225 Difference]: With dead ends: 5663 [2020-11-30 00:15:54,698 INFO L226 Difference]: Without dead ends: 4128 [2020-11-30 00:15:54,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=230, Invalid=1492, Unknown=0, NotChecked=0, Total=1722 [2020-11-30 00:15:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2020-11-30 00:15:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 2486. [2020-11-30 00:15:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2020-11-30 00:15:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 2906 transitions. [2020-11-30 00:15:55,089 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 2906 transitions. Word has length 185 [2020-11-30 00:15:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:55,090 INFO L481 AbstractCegarLoop]: Abstraction has 2486 states and 2906 transitions. [2020-11-30 00:15:55,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 00:15:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 2906 transitions. [2020-11-30 00:15:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-11-30 00:15:55,094 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:55,095 INFO L422 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] [2020-11-30 00:15:55,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-11-30 00:15:55,320 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:55,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:55,321 INFO L82 PathProgramCache]: Analyzing trace with hash 6681598, now seen corresponding path program 1 times [2020-11-30 00:15:55,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:55,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400645893] [2020-11-30 00:15:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-30 00:15:55,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400645893] [2020-11-30 00:15:55,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685675898] [2020-11-30 00:15:55,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:15:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:55,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 00:15:55,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:15:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-30 00:15:56,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:15:56,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-11-30 00:15:56,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546840552] [2020-11-30 00:15:56,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-30 00:15:56,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:56,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 00:15:56,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-11-30 00:15:56,054 INFO L87 Difference]: Start difference. First operand 2486 states and 2906 transitions. Second operand 17 states. [2020-11-30 00:15:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:57,774 INFO L93 Difference]: Finished difference Result 6563 states and 7641 transitions. [2020-11-30 00:15:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-30 00:15:57,774 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 191 [2020-11-30 00:15:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:57,781 INFO L225 Difference]: With dead ends: 6563 [2020-11-30 00:15:57,782 INFO L226 Difference]: Without dead ends: 4339 [2020-11-30 00:15:57,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2020-11-30 00:15:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2020-11-30 00:15:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 2719. [2020-11-30 00:15:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2719 states. [2020-11-30 00:15:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 3172 transitions. [2020-11-30 00:15:58,106 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 3172 transitions. Word has length 191 [2020-11-30 00:15:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:58,107 INFO L481 AbstractCegarLoop]: Abstraction has 2719 states and 3172 transitions. [2020-11-30 00:15:58,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-30 00:15:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3172 transitions. [2020-11-30 00:15:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2020-11-30 00:15:58,110 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:58,111 INFO L422 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] [2020-11-30 00:15:58,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-11-30 00:15:58,312 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:58,312 INFO L82 PathProgramCache]: Analyzing trace with hash -451408310, now seen corresponding path program 1 times [2020-11-30 00:15:58,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:58,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714724919] [2020-11-30 00:15:58,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-11-30 00:15:58,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714724919] [2020-11-30 00:15:58,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:58,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:58,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734218652] [2020-11-30 00:15:58,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:58,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:58,433 INFO L87 Difference]: Start difference. First operand 2719 states and 3172 transitions. Second operand 3 states. [2020-11-30 00:15:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:58,568 INFO L93 Difference]: Finished difference Result 3052 states and 3532 transitions. [2020-11-30 00:15:58,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:58,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2020-11-30 00:15:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:58,570 INFO L225 Difference]: With dead ends: 3052 [2020-11-30 00:15:58,570 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 00:15:58,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:58,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 00:15:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 00:15:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 00:15:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 00:15:58,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 251 [2020-11-30 00:15:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:58,574 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:15:58,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 00:15:58,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 00:15:58,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-30 00:15:58,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-30 00:16:01,177 WARN L193 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 434 DAG size of output: 374 [2020-11-30 00:16:01,996 WARN L193 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 204 [2020-11-30 00:16:03,893 WARN L193 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 437 DAG size of output: 377 [2020-11-30 00:16:04,046 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 165 [2020-11-30 00:16:04,245 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 187 [2020-11-30 00:16:04,425 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 153 [2020-11-30 00:16:05,952 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 445 DAG size of output: 385 [2020-11-30 00:16:06,250 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 189 [2020-11-30 00:16:06,441 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 184 [2020-11-30 00:16:07,746 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 437 DAG size of output: 377 [2020-11-30 00:16:08,156 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 259 [2020-11-30 00:16:08,364 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 189 [2020-11-30 00:16:09,668 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 441 DAG size of output: 381 [2020-11-30 00:16:10,056 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 259 [2020-11-30 00:16:10,207 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 166 [2020-11-30 00:16:10,384 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 203 [2020-11-30 00:16:17,239 WARN L193 SmtUtils]: Spent 6.85 s on a formula simplification. DAG size of input: 363 DAG size of output: 150 [2020-11-30 00:16:18,345 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 196 DAG size of output: 64 [2020-11-30 00:16:24,873 WARN L193 SmtUtils]: Spent 6.52 s on a formula simplification. DAG size of input: 366 DAG size of output: 149 [2020-11-30 00:16:26,293 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 157 DAG size of output: 95 [2020-11-30 00:16:27,339 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 179 DAG size of output: 83 [2020-11-30 00:16:27,964 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 79 [2020-11-30 00:16:35,976 WARN L193 SmtUtils]: Spent 8.01 s on a formula simplification. DAG size of input: 374 DAG size of output: 151 [2020-11-30 00:16:36,378 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 68 [2020-11-30 00:16:37,339 WARN L193 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 83 [2020-11-30 00:16:38,789 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 176 DAG size of output: 108 [2020-11-30 00:16:39,058 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-11-30 00:16:45,567 WARN L193 SmtUtils]: Spent 6.51 s on a formula simplification. DAG size of input: 366 DAG size of output: 149 [2020-11-30 00:16:47,962 WARN L193 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 251 DAG size of output: 125 [2020-11-30 00:16:48,719 WARN L193 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 83 [2020-11-30 00:16:56,814 WARN L193 SmtUtils]: Spent 8.09 s on a formula simplification. DAG size of input: 370 DAG size of output: 151 [2020-11-30 00:16:59,201 WARN L193 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 251 DAG size of output: 125 [2020-11-30 00:16:59,884 WARN L193 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 80 [2020-11-30 00:17:01,305 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 192 DAG size of output: 104 [2020-11-30 00:17:01,309 INFO L274 CegarLoopResult]: For program point L498(lines 498 502) no Hoare annotation was computed. [2020-11-30 00:17:01,311 INFO L270 CegarLoopResult]: At program point L234-1(lines 222 249) the Hoare annotation is: (let ((.cse24 (= ~c2_st~0 0)) (.cse25 (= ~c1_st~0 0)) (.cse37 (+ ~t_b~0 1))) (let ((.cse8 (= ~c2_pc~0 0)) (.cse32 (= ~c_t~0 .cse37)) (.cse34 (= ~data~0 .cse37)) (.cse9 (not (= 2 ~wl_pc~0))) (.cse28 (= ~c1_pc~0 1)) (.cse33 (not (= ~r_st~0 0))) (.cse35 (= ~wb_pc~0 1)) (.cse29 (not .cse25)) (.cse12 (not (= 0 ~wl_st~0))) (.cse30 (= ~c2_pc~0 1)) (.cse0 (= ~processed~0 0)) (.cse1 (= ~r_st~0 ~e_f~0)) (.cse2 (not (= ~wb_st~0 0))) (.cse4 (= ~data~0 0)) (.cse3 (not (= ~e_wl~0 1))) (.cse5 (= ~c2_i~0 1)) (.cse6 (= ~t_b~0 0)) (.cse7 (= ~wb_pc~0 0)) (.cse31 (not .cse24)) (.cse10 (= ~wb_i~0 1)) (.cse11 (not (= ~e_c~0 0))) (.cse13 (= ~e_f~0 2)) (.cse14 (= ~d~0 0)) (.cse16 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= ~e_e~0 1))) (.cse19 (not (= ~r_i~0 1))) (.cse20 (= ~c1_pc~0 0)) (.cse21 (not (= ~e_g~0 0))) (.cse26 (not (= ~e_wl~0 0))) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (not (= ~e_e~0 0))) (.cse27 (= 0 ~wl_pc~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 .cse23 .cse24 .cse25) (and .cse16 .cse3 .cse5 .cse17 .cse18 .cse19 .cse21 .cse26 .cse23 .cse10 .cse27 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse29 .cse24) (and .cse30 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25) (and .cse30 .cse16 .cse15 .cse32 .cse2 .cse3 .cse28 .cse5 .cse33 .cse17 .cse18 .cse19 .cse21 .cse34 .cse35 .cse26 .cse23 .cse29 .cse24 .cse10 .cse12 .cse13) (and .cse30 .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse31 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse28 .cse17 .cse18 .cse19 .cse21 .cse26 .cse22 .cse23 .cse29 .cse27) (and .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22 .cse23 .cse24 .cse27 .cse25) (and .cse30 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse28 .cse17 .cse18 .cse19 .cse21 .cse26 .cse22 .cse23 .cse29 .cse24 .cse27) (and .cse30 .cse16 .cse15 .cse32 .cse2 .cse3 .cse28 .cse5 .cse33 .cse31 .cse17 .cse18 .cse19 .cse21 .cse26 .cse34 .cse35 .cse23 .cse10 .cse25 .cse12 .cse13) (and .cse30 .cse16 .cse3 .cse28 .cse5 .cse9 .cse17 .cse18 .cse19 .cse21 .cse35 .cse26 .cse23 .cse10 .cse11 .cse12 .cse13) (let ((.cse36 (+ ~t_b~0 2))) (and .cse30 .cse16 .cse15 .cse2 .cse3 .cse28 .cse5 .cse33 (= ~data~0 .cse36) .cse31 (= ~c_t~0 .cse36) .cse17 .cse18 .cse19 .cse21 .cse26 .cse35 .cse23 .cse29 .cse10 .cse12 .cse13)) (and .cse30 .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse31 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22 .cse23 .cse27 .cse25)))) [2020-11-30 00:17:01,311 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-30 00:17:01,312 INFO L274 CegarLoopResult]: For program point L631-1(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,312 INFO L274 CegarLoopResult]: For program point L400(lines 400 410) no Hoare annotation was computed. [2020-11-30 00:17:01,312 INFO L274 CegarLoopResult]: For program point L400-2(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,312 INFO L274 CegarLoopResult]: For program point L301(lines 301 309) no Hoare annotation was computed. [2020-11-30 00:17:01,312 INFO L274 CegarLoopResult]: For program point L235(line 235) no Hoare annotation was computed. [2020-11-30 00:17:01,313 INFO L274 CegarLoopResult]: For program point L136(lines 136 140) no Hoare annotation was computed. [2020-11-30 00:17:01,313 INFO L274 CegarLoopResult]: For program point L665(lines 665 673) no Hoare annotation was computed. [2020-11-30 00:17:01,313 INFO L274 CegarLoopResult]: For program point L599(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,313 INFO L274 CegarLoopResult]: For program point L566-1(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,313 INFO L274 CegarLoopResult]: For program point L401(lines 401 406) no Hoare annotation was computed. [2020-11-30 00:17:01,313 INFO L274 CegarLoopResult]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2020-11-30 00:17:01,314 INFO L270 CegarLoopResult]: At program point L137(lines 132 172) the Hoare annotation is: (let ((.cse24 (+ ~t_b~0 1)) (.cse20 (= ~c2_st~0 0))) (let ((.cse10 (not (= ~e_c~0 0))) (.cse17 (= ~processed~0 0)) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse21 (= ~wb_st~0 0)) (.cse1 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse18 (not (= ~r_st~0 0))) (.cse22 (not .cse20)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse7 (not (= ~e_wl~0 0))) (.cse23 (= ~data~0 .cse24)) (.cse15 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_e~0 0))) (.cse19 (not (= ~c1_st~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse14 .cse2 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= ~data~0 ~t_b~0) .cse13 .cse0 .cse16 .cse17 .cse1 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse14 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse19 .cse20 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse16 .cse17 .cse1 .cse14 .cse2 .cse21 .cse18 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse23 .cse8 .cse19 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse16 (= ~c_t~0 .cse24) (not .cse21) .cse1 .cse14 .cse2 .cse18 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse15 .cse8 .cse19 .cse9 .cse11 .cse12)))) [2020-11-30 00:17:01,315 INFO L270 CegarLoopResult]: At program point L71(lines 57 127) the Hoare annotation is: (let ((.cse24 (= ~c1_st~0 0)) (.cse26 (= ~c2_st~0 0)) (.cse6 (= ~wb_st~0 0))) (let ((.cse25 (= ~c2_pc~0 0)) (.cse8 (= ~wb_pc~0 0)) (.cse31 (not (= ~r_st~0 0))) (.cse20 (= ~c1_pc~0 0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse2 (= ~r_st~0 ~e_f~0)) (.cse27 (not .cse6)) (.cse3 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse5 (= ~c2_i~0 1)) (.cse7 (= ~t_b~0 0)) (.cse9 (not .cse26)) (.cse10 (not (= 2 ~wl_pc~0))) (.cse28 (= ~wb_pc~0 1)) (.cse11 (= ~wb_i~0 1)) (.cse12 (not (= 0 ~wl_st~0))) (.cse13 (= ~e_f~0 2)) (.cse14 (= ~d~0 0)) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse29 (= ~c1_pc~0 1)) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= ~e_e~0 1))) (.cse19 (not (= ~r_i~0 1))) (.cse21 (not (= ~e_g~0 0))) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (not (= ~e_e~0 0))) (.cse32 (not .cse24))) (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 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse24) (and .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse25 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse24) (let ((.cse30 (+ ~t_b~0 2))) (and .cse0 .cse15 .cse16 .cse27 .cse4 .cse29 (= ~c~0 .cse30) .cse5 .cse31 (= ~data~0 .cse30) .cse9 (= ~c_t~0 .cse30) .cse10 .cse18 .cse19 .cse17 .cse21 .cse28 .cse32 .cse23 .cse11 .cse12 .cse13)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse32 .cse26) (and .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse25 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse32 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse32) (let ((.cse33 (+ ~t_b~0 1))) (and .cse0 .cse15 .cse16 (= ~c~0 .cse33) (= ~c_t~0 .cse33) .cse27 .cse4 .cse29 .cse5 .cse31 .cse9 .cse10 .cse18 .cse19 .cse17 .cse21 (= ~data~0 .cse33) .cse28 .cse32 .cse23 .cse11 .cse12 .cse13)) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse32)))) [2020-11-30 00:17:01,315 INFO L274 CegarLoopResult]: For program point L600(lines 600 604) no Hoare annotation was computed. [2020-11-30 00:17:01,315 INFO L270 CegarLoopResult]: At program point L468(lines 461 478) the Hoare annotation is: (let ((.cse0 (= ~e_c~0 2)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse3 (= ~wb_st~0 0)) (.cse4 (= ~e_g~0 ~e_f~0)) (.cse5 (not (= ~r_i~0 1))) (.cse6 (= ~c_req_up~0 ~r_i~0)) (.cse7 (= ~c2_st~0 0)) (.cse8 (= ~wb_i~0 1)) (.cse9 (= 0 ~wl_pc~0)) (.cse10 (= ~e_e~0 ~e_c~0)) (.cse11 (= ~c1_st~0 0)) (.cse12 (= ~e_f~0 2)) (.cse13 (= ~e_wl~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ~wl_st~0)) .cse12 .cse13) (and .cse0 .cse1 (= ~processed~0 0) (= ~r_st~0 ~e_f~0) (= ~data~0 0) .cse2 .cse3 (= ~t_b~0 0) .cse4 (= ~wb_pc~0 0) (= ~c2_pc~0 0) .cse5 (= ~c1_pc~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~d~0 0) .cse13))) [2020-11-30 00:17:01,315 INFO L274 CegarLoopResult]: For program point L469(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,315 INFO L274 CegarLoopResult]: For program point L436-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,316 INFO L274 CegarLoopResult]: For program point L304(lines 304 308) no Hoare annotation was computed. [2020-11-30 00:17:01,316 INFO L274 CegarLoopResult]: For program point L304-1(lines 290 388) no Hoare annotation was computed. [2020-11-30 00:17:01,316 INFO L274 CegarLoopResult]: For program point L668(lines 668 672) no Hoare annotation was computed. [2020-11-30 00:17:01,316 INFO L274 CegarLoopResult]: For program point L668-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,316 INFO L274 CegarLoopResult]: For program point L470(lines 470 474) no Hoare annotation was computed. [2020-11-30 00:17:01,316 INFO L274 CegarLoopResult]: For program point L636-1(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,316 INFO L274 CegarLoopResult]: For program point L538(line 538) no Hoare annotation was computed. [2020-11-30 00:17:01,316 INFO L274 CegarLoopResult]: For program point L571-1(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,317 INFO L270 CegarLoopResult]: At program point L373(lines 290 388) the Hoare annotation is: (let ((.cse32 (= ~c1_st~0 0)) (.cse18 (= ~c2_st~0 0)) (.cse7 (= ~wb_st~0 0)) (.cse42 (+ ~t_b~0 2)) (.cse41 (+ ~t_b~0 1))) (let ((.cse35 (= ~c~0 .cse41)) (.cse36 (= ~c_t~0 .cse41)) (.cse13 (= ~data~0 .cse41)) (.cse38 (= ~c~0 .cse42)) (.cse40 (= ~c_t~0 .cse42)) (.cse31 (= 0 ~wl_pc~0)) (.cse25 (= ~wb_pc~0 0)) (.cse26 (= ~c2_pc~0 0)) (.cse29 (= ~c1_pc~0 0)) (.cse39 (= ~data~0 .cse42)) (.cse8 (not (= ~r_st~0 0))) (.cse20 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse3 (= ~processed~0 0)) (.cse22 (= ~r_st~0 ~e_f~0)) (.cse33 (not .cse7)) (.cse23 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse24 (= ~t_b~0 0)) (.cse34 (not .cse18)) (.cse37 (not (= 2 ~wl_pc~0))) (.cse14 (= ~wb_pc~0 1)) (.cse19 (= ~wb_i~0 1)) (.cse27 (not (= ~e_c~0 0))) (.cse21 (= ~e_f~0 2)) (.cse28 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse9 (not (= ~e_g~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_g~0 0))) (.cse15 (not (= ~e_wl~0 0))) (.cse30 (= ~c_req_up~0 ~r_i~0)) (.cse17 (not (= ~e_e~0 0))) (.cse16 (not .cse32))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse18 .cse31 .cse32) (and .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse30 .cse17 .cse16 .cse19 .cse27 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse37 .cse10 .cse11 .cse9 .cse12 .cse14 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse8 .cse39 .cse34 .cse40 .cse37 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse13 .cse17 .cse16 (= ~d~0 .cse41) .cse19 .cse21) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse37 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse26 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 (= ~d~0 .cse42) .cse8 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse14 .cse17 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse37 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse19 .cse27 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse13 .cse17 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse6 .cse8 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse17 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse32) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse34 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse32) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse34 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse31) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse34 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse1 .cse4 .cse6 .cse9 .cse10 .cse11 .cse12 .cse15 .cse17 .cse19 .cse31 .cse27 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse34 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse31 .cse32) (and .cse0 .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16) (and .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse18 .cse31 .cse32) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse34 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse8 .cse39 .cse34 .cse40 .cse37 .cse10 .cse11 .cse9 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse26 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse34 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse31 .cse32) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse39 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse17 .cse16 .cse19 .cse20 .cse21) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16)))) [2020-11-30 00:17:01,317 INFO L274 CegarLoopResult]: For program point L506-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,317 INFO L274 CegarLoopResult]: For program point L441-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,318 INFO L274 CegarLoopResult]: For program point L111(lines 111 121) no Hoare annotation was computed. [2020-11-30 00:17:01,318 INFO L270 CegarLoopResult]: At program point L343(lines 290 388) the Hoare annotation is: (let ((.cse32 (= ~c1_st~0 0)) (.cse18 (= ~c2_st~0 0)) (.cse7 (= ~wb_st~0 0)) (.cse42 (+ ~t_b~0 2)) (.cse41 (+ ~t_b~0 1))) (let ((.cse35 (= ~c~0 .cse41)) (.cse36 (= ~c_t~0 .cse41)) (.cse13 (= ~data~0 .cse41)) (.cse38 (= ~c~0 .cse42)) (.cse40 (= ~c_t~0 .cse42)) (.cse31 (= 0 ~wl_pc~0)) (.cse25 (= ~wb_pc~0 0)) (.cse26 (= ~c2_pc~0 0)) (.cse29 (= ~c1_pc~0 0)) (.cse39 (= ~data~0 .cse42)) (.cse8 (not (= ~r_st~0 0))) (.cse20 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse3 (= ~processed~0 0)) (.cse22 (= ~r_st~0 ~e_f~0)) (.cse33 (not .cse7)) (.cse23 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse24 (= ~t_b~0 0)) (.cse34 (not .cse18)) (.cse37 (not (= 2 ~wl_pc~0))) (.cse14 (= ~wb_pc~0 1)) (.cse19 (= ~wb_i~0 1)) (.cse27 (not (= ~e_c~0 0))) (.cse21 (= ~e_f~0 2)) (.cse28 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse9 (not (= ~e_g~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_g~0 0))) (.cse15 (not (= ~e_wl~0 0))) (.cse30 (= ~c_req_up~0 ~r_i~0)) (.cse17 (not (= ~e_e~0 0))) (.cse16 (not .cse32))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse18 .cse31 .cse32) (and .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse30 .cse17 .cse16 .cse19 .cse27 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse37 .cse10 .cse11 .cse9 .cse12 .cse14 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse8 .cse39 .cse34 .cse40 .cse37 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse13 .cse17 .cse16 (= ~d~0 .cse41) .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse13 .cse17 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse37 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse26 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 (= ~d~0 .cse42) .cse8 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse37 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse19 .cse27 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse13 .cse17 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse32) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse34 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse32) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse34 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse31) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse34 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse1 .cse4 .cse6 .cse9 .cse10 .cse11 .cse12 .cse15 .cse17 .cse19 .cse31 .cse27 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse34 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse31 .cse32) (and .cse0 .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16) (and .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse18 .cse31 .cse32) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse34 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse8 .cse39 .cse34 .cse40 .cse37 .cse10 .cse11 .cse9 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse26 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse34 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse31 .cse32) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse39 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse17 .cse16 .cse19 .cse20 .cse21) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16)))) [2020-11-30 00:17:01,319 INFO L274 CegarLoopResult]: For program point L178(lines 178 186) no Hoare annotation was computed. [2020-11-30 00:17:01,319 INFO L274 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2020-11-30 00:17:01,319 INFO L274 CegarLoopResult]: For program point L608(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,319 INFO L274 CegarLoopResult]: For program point L641-1(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,320 INFO L274 CegarLoopResult]: For program point L377(lines 377 384) no Hoare annotation was computed. [2020-11-30 00:17:01,320 INFO L274 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-11-30 00:17:01,320 INFO L274 CegarLoopResult]: For program point L609(lines 609 613) no Hoare annotation was computed. [2020-11-30 00:17:01,320 INFO L274 CegarLoopResult]: For program point L576-1(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,320 INFO L274 CegarLoopResult]: For program point L411-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,321 INFO L274 CegarLoopResult]: For program point L114(lines 114 120) no Hoare annotation was computed. [2020-11-30 00:17:01,321 INFO L274 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-30 00:17:01,321 INFO L270 CegarLoopResult]: At program point L709(lines 684 711) the Hoare annotation is: (= ~c2_i~0 1) [2020-11-30 00:17:01,321 INFO L274 CegarLoopResult]: For program point L544(lines 544 554) no Hoare annotation was computed. [2020-11-30 00:17:01,321 INFO L274 CegarLoopResult]: For program point L511-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,322 INFO L274 CegarLoopResult]: For program point L544-2(lines 544 554) no Hoare annotation was computed. [2020-11-30 00:17:01,323 INFO L270 CegarLoopResult]: At program point L313(lines 290 388) the Hoare annotation is: (let ((.cse32 (= ~c1_st~0 0)) (.cse18 (= ~c2_st~0 0)) (.cse7 (= ~wb_st~0 0)) (.cse42 (+ ~t_b~0 2)) (.cse41 (+ ~t_b~0 1))) (let ((.cse35 (= ~c~0 .cse41)) (.cse38 (= ~c~0 .cse42)) (.cse40 (= ~c_t~0 .cse42)) (.cse31 (= 0 ~wl_pc~0)) (.cse25 (= ~wb_pc~0 0)) (.cse26 (= ~c2_pc~0 0)) (.cse29 (= ~c1_pc~0 0)) (.cse36 (= ~c_t~0 .cse41)) (.cse13 (= ~data~0 .cse41)) (.cse39 (= ~data~0 .cse42)) (.cse8 (not (= ~r_st~0 0))) (.cse20 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse3 (= ~processed~0 0)) (.cse22 (= ~r_st~0 ~e_f~0)) (.cse33 (not .cse7)) (.cse23 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse24 (= ~t_b~0 0)) (.cse34 (not .cse18)) (.cse37 (not (= 2 ~wl_pc~0))) (.cse14 (= ~wb_pc~0 1)) (.cse19 (= ~wb_i~0 1)) (.cse27 (not (= ~e_c~0 0))) (.cse21 (= ~e_f~0 2)) (.cse28 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse9 (not (= ~e_g~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_g~0 0))) (.cse15 (not (= ~e_wl~0 0))) (.cse30 (= ~c_req_up~0 ~r_i~0)) (.cse17 (not (= ~e_e~0 0))) (.cse16 (not .cse32))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse18 .cse31 .cse32) (and .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse30 .cse17 .cse16 .cse19 .cse27 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse37 .cse10 .cse11 .cse9 .cse12 .cse14 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse8 .cse39 .cse34 .cse40 .cse37 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse13 .cse17 .cse16 (= ~d~0 .cse41) .cse19 .cse21) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse37 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse26 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 (= ~d~0 .cse42) .cse8 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse37 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse19 .cse27 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse13 .cse17 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse32) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse34 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse32) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse34 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse31) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse34 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse1 .cse4 .cse6 .cse9 .cse10 .cse11 .cse12 .cse15 .cse17 .cse19 .cse31 .cse27 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse34 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse31 .cse32) (and .cse0 .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16) (and .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse18 .cse31 .cse32) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse34 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse8 .cse39 .cse34 .cse40 .cse37 .cse10 .cse11 .cse9 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse26 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse34 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse31 .cse32) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse14 .cse17 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse39 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse17 .cse16 .cse19 .cse20 .cse21) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16)))) [2020-11-30 00:17:01,323 INFO L274 CegarLoopResult]: For program point L181(lines 181 185) no Hoare annotation was computed. [2020-11-30 00:17:01,324 INFO L270 CegarLoopResult]: At program point L16(lines 57 127) the Hoare annotation is: (let ((.cse0 (= ~c1_i~0 1)) (.cse1 (= ~e_c~0 2)) (.cse2 (= ~c2_pc~0 1)) (.cse3 (not (= ~wb_st~0 0))) (.cse4 (not (= ~e_wl~0 1))) (.cse5 (= ~c1_pc~0 1)) (.cse6 (= ~c2_i~0 1)) (.cse7 (not (= ~r_st~0 0))) (.cse9 (not (= ~e_g~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_g~0 0))) (.cse13 (not (= ~e_wl~0 0))) (.cse14 (= ~wb_pc~0 1)) (.cse15 (not (= ~e_e~0 0))) (.cse16 (= ~wb_i~0 1)) (.cse17 (not (= 0 ~wl_st~0))) (.cse18 (= ~e_f~0 2))) (or (let ((.cse8 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~data~0 .cse8) (= ~c_t~0 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~data~0 (+ ~t_b~0 1)) .cse15 .cse16 .cse17 .cse18) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2020-11-30 00:17:01,324 INFO L274 CegarLoopResult]: For program point L545(lines 545 550) no Hoare annotation was computed. [2020-11-30 00:17:01,324 INFO L274 CegarLoopResult]: For program point L479(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,324 INFO L274 CegarLoopResult]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2020-11-30 00:17:01,325 INFO L274 CegarLoopResult]: For program point L446-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,325 INFO L274 CegarLoopResult]: For program point L347(lines 347 354) no Hoare annotation was computed. [2020-11-30 00:17:01,325 INFO L270 CegarLoopResult]: At program point L182(lines 177 217) the Hoare annotation is: (let ((.cse23 (= ~c1_st~0 0)) (.cse24 (+ ~t_b~0 1))) (let ((.cse10 (not (= ~e_c~0 0))) (.cse17 (= ~processed~0 0)) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse18 (= ~wb_st~0 0)) (.cse1 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse19 (not (= ~r_st~0 0))) (.cse20 (not (= ~c2_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse7 (not (= ~e_wl~0 0))) (.cse21 (= ~data~0 .cse24)) (.cse15 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_e~0 0))) (.cse22 (not .cse23)) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse14 .cse2 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse16 .cse17 .cse1 .cse14 .cse2 .cse18 .cse19 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse21 .cse8 .cse22 .cse9 .cse11 .cse12) (and (= ~data~0 ~t_b~0) .cse13 .cse0 .cse16 .cse17 .cse1 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse14 .cse2 .cse19 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse23 .cse11 .cse12) (and .cse13 .cse0 .cse16 (= ~c_t~0 .cse24) (not .cse18) .cse1 .cse14 .cse2 .cse19 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse15 .cse8 .cse22 .cse9 .cse11 .cse12)))) [2020-11-30 00:17:01,326 INFO L270 CegarLoopResult]: At program point L678(lines 395 683) the Hoare annotation is: (= ~c2_i~0 1) [2020-11-30 00:17:01,326 INFO L274 CegarLoopResult]: For program point L480(lines 480 484) no Hoare annotation was computed. [2020-11-30 00:17:01,326 INFO L274 CegarLoopResult]: For program point L646-1(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,327 INFO L270 CegarLoopResult]: At program point L151-1(lines 132 172) the Hoare annotation is: (let ((.cse7 (= ~wb_st~0 0)) (.cse18 (= ~c2_st~0 0)) (.cse34 (+ ~t_b~0 1))) (let ((.cse25 (= ~wb_pc~0 0)) (.cse13 (= ~data~0 .cse34)) (.cse27 (not (= 2 ~wl_pc~0))) (.cse0 (= ~c2_pc~0 1)) (.cse5 (= ~c1_pc~0 1)) (.cse8 (not (= ~r_st~0 0))) (.cse33 (not .cse18)) (.cse20 (not (= 0 ~wl_st~0))) (.cse3 (= ~processed~0 0)) (.cse22 (= ~r_st~0 ~e_f~0)) (.cse32 (not .cse7)) (.cse23 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse24 (= ~t_b~0 0)) (.cse26 (= ~c2_pc~0 0)) (.cse14 (= ~wb_pc~0 1)) (.cse19 (= ~wb_i~0 1)) (.cse28 (not (= ~e_c~0 0))) (.cse21 (= ~e_f~0 2)) (.cse29 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse9 (not (= ~e_g~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_g~0 0))) (.cse15 (not (= ~e_wl~0 0))) (.cse30 (= ~c_req_up~0 ~r_i~0)) (.cse16 (not (= ~c1_st~0 0))) (.cse17 (not (= ~e_e~0 0))) (.cse31 (= 0 ~wl_pc~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) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse27 .cse19 .cse28 .cse20 .cse21 .cse29 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse30 .cse16 .cse17 .cse18) (and .cse1 .cse4 .cse6 .cse9 .cse10 .cse11 .cse12 .cse15 .cse17 .cse19 .cse31 .cse28 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse32 .cse4 .cse5 .cse6 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse30 .cse17 .cse16 .cse19 .cse28 .cse20 .cse21) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse28 .cse21 .cse29 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse33 .cse19 .cse28 .cse21 .cse29 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse31) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse33 .cse27 .cse19 .cse28 .cse20 .cse21 .cse29 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse30 .cse16 .cse17) (and .cse0 .cse1 .cse2 (= ~c_t~0 .cse34) .cse32 .cse4 .cse5 .cse6 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse13 .cse17 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse27 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse19 .cse28 .cse20 .cse21) (and .cse3 .cse22 .cse32 .cse23 .cse4 .cse6 .cse24 .cse26 .cse27 .cse14 .cse19 .cse28 .cse20 .cse21 .cse29 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse3 .cse32 .cse22 .cse23 .cse4 .cse6 .cse24 .cse33 .cse14 .cse19 .cse28 .cse21 .cse29 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse16 .cse17 .cse31) (and .cse0 .cse3 .cse22 .cse32 .cse23 .cse4 .cse6 .cse24 .cse33 .cse27 .cse14 .cse19 .cse28 .cse20 .cse21 .cse29 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse30 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~data~0 (+ ~t_b~0 2)) .cse33 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse17 .cse16 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse32 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse28 .cse21 .cse29 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse16 .cse17 .cse18 .cse31)))) [2020-11-30 00:17:01,327 INFO L274 CegarLoopResult]: For program point L85(lines 85 93) no Hoare annotation was computed. [2020-11-30 00:17:01,327 INFO L274 CegarLoopResult]: For program point L85-1(lines 79 122) no Hoare annotation was computed. [2020-11-30 00:17:01,327 INFO L274 CegarLoopResult]: For program point L416-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,327 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-30 00:17:01,328 INFO L274 CegarLoopResult]: For program point L317(lines 317 324) no Hoare annotation was computed. [2020-11-30 00:17:01,328 INFO L274 CegarLoopResult]: For program point L86(lines 86 90) no Hoare annotation was computed. [2020-11-30 00:17:01,328 INFO L274 CegarLoopResult]: For program point L582(lines 582 586) no Hoare annotation was computed. [2020-11-30 00:17:01,328 INFO L274 CegarLoopResult]: For program point L516-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,328 INFO L274 CegarLoopResult]: For program point L451-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,329 INFO L274 CegarLoopResult]: For program point L154(lines 154 162) no Hoare annotation was computed. [2020-11-30 00:17:01,329 INFO L274 CegarLoopResult]: For program point L154-1(lines 154 162) no Hoare annotation was computed. [2020-11-30 00:17:01,329 INFO L274 CegarLoopResult]: For program point L617(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,329 INFO L274 CegarLoopResult]: For program point L155(lines 155 159) no Hoare annotation was computed. [2020-11-30 00:17:01,329 INFO L274 CegarLoopResult]: For program point L618(lines 618 622) no Hoare annotation was computed. [2020-11-30 00:17:01,330 INFO L274 CegarLoopResult]: For program point L651-1(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,330 INFO L274 CegarLoopResult]: For program point L421-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,330 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-30 00:17:01,330 INFO L274 CegarLoopResult]: For program point L223(lines 223 231) no Hoare annotation was computed. [2020-11-30 00:17:01,330 INFO L274 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2020-11-30 00:17:01,330 INFO L274 CegarLoopResult]: For program point L58(lines 58 70) no Hoare annotation was computed. [2020-11-30 00:17:01,331 INFO L274 CegarLoopResult]: For program point L488(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,331 INFO L274 CegarLoopResult]: For program point L521-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,331 INFO L270 CegarLoopResult]: At program point L389(lines 281 394) the Hoare annotation is: (let ((.cse23 (+ ~t_b~0 1)) (.cse28 (+ ~t_b~0 2))) (let ((.cse20 (= ~c_req_up~0 ~r_i~0)) (.cse26 (= ~data~0 .cse28)) (.cse27 (= ~c_t~0 .cse28)) (.cse16 (not (= 2 ~wl_pc~0))) (.cse10 (not (= ~e_c~0 0))) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse18 (= ~e_c~0 2)) (.cse24 (= ~c_t~0 .cse23)) (.cse14 (not (= ~wb_st~0 0))) (.cse1 (not (= ~e_wl~0 1))) (.cse19 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse22 (not (= ~r_st~0 0))) (.cse15 (not (= ~c2_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse7 (not (= ~e_wl~0 0))) (.cse17 (= ~wb_pc~0 1)) (.cse25 (= ~data~0 .cse23)) (.cse8 (not (= ~e_e~0 0))) (.cse21 (not (= ~c1_st~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and .cse13 (= ~processed~0 0) (= ~r_st~0 ~e_f~0) .cse14 .cse1 (= ~data~0 0) .cse2 (= ~t_b~0 0) .cse15 .cse16 .cse17 .cse9 .cse10 .cse11 .cse12 (= ~d~0 0) .cse18 .cse0 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse8 .cse21) (and .cse13 .cse0 .cse18 .cse14 .cse1 .cse19 .cse2 .cse22 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse20 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse18 (= ~c~0 .cse23) .cse24 .cse14 .cse1 .cse19 .cse2 .cse22 .cse15 .cse16 .cse4 .cse5 .cse3 .cse6 .cse17 .cse25 .cse21 .cse8 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse18 .cse14 .cse1 .cse19 .cse2 .cse22 .cse26 .cse15 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse21 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse18 .cse14 .cse1 .cse19 (= ~c~0 .cse28) .cse2 .cse22 .cse26 .cse15 .cse27 .cse16 .cse4 .cse5 .cse3 .cse6 .cse17 .cse21 .cse8 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse19 .cse2 .cse22 .cse16 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse18 .cse24 .cse14 .cse1 .cse19 .cse2 .cse22 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse25 .cse8 .cse21 .cse9 .cse11 .cse12)))) [2020-11-30 00:17:01,332 INFO L274 CegarLoopResult]: For program point L257(lines 257 274) no Hoare annotation was computed. [2020-11-30 00:17:01,332 INFO L270 CegarLoopResult]: At program point L588(lines 581 598) the Hoare annotation is: (let ((.cse23 (= ~e_wl~0 1))) (let ((.cse21 (not (= 2 ~wl_pc~0))) (.cse10 (not (= ~e_c~0 0))) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse14 (not (= ~wb_st~0 0))) (.cse1 (not .cse23)) (.cse15 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse17 (not (= ~r_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse7 (not (= ~e_wl~0 0))) (.cse19 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_e~0 0))) (.cse20 (not (= ~c1_st~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (let ((.cse16 (+ ~t_b~0 2))) (and .cse13 .cse0 .cse14 .cse1 .cse15 (= ~c~0 .cse16) .cse2 .cse17 (= ~data~0 .cse16) .cse18 (= ~c_t~0 .cse16) .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12)) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse21 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse22 (+ ~t_b~0 1))) (and .cse13 .cse0 (= ~c~0 .cse22) (= ~c_t~0 .cse22) .cse14 .cse1 .cse15 .cse2 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 (= ~data~0 .cse22) .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12)) (and .cse13 .cse0 .cse23 .cse15 .cse2 .cse17 .cse21 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 (= ~e_c~0 2) .cse14 .cse1 .cse15 .cse2 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse20 .cse9 .cse11 .cse12)))) [2020-11-30 00:17:01,332 INFO L274 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2020-11-30 00:17:01,333 INFO L274 CegarLoopResult]: For program point L456-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,333 INFO L274 CegarLoopResult]: For program point L291(lines 290 388) no Hoare annotation was computed. [2020-11-30 00:17:01,333 INFO L274 CegarLoopResult]: For program point L258(lines 258 262) no Hoare annotation was computed. [2020-11-30 00:17:01,333 INFO L274 CegarLoopResult]: For program point L589(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,333 INFO L274 CegarLoopResult]: For program point L556(lines 556 560) no Hoare annotation was computed. [2020-11-30 00:17:01,334 INFO L274 CegarLoopResult]: For program point L556-2(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,335 INFO L270 CegarLoopResult]: At program point L358(lines 290 388) the Hoare annotation is: (let ((.cse32 (= ~c1_st~0 0)) (.cse18 (= ~c2_st~0 0)) (.cse7 (= ~wb_st~0 0)) (.cse42 (+ ~t_b~0 2)) (.cse41 (+ ~t_b~0 1))) (let ((.cse35 (= ~c~0 .cse41)) (.cse36 (= ~c_t~0 .cse41)) (.cse13 (= ~data~0 .cse41)) (.cse38 (= ~c~0 .cse42)) (.cse40 (= ~c_t~0 .cse42)) (.cse31 (= 0 ~wl_pc~0)) (.cse25 (= ~wb_pc~0 0)) (.cse26 (= ~c2_pc~0 0)) (.cse29 (= ~c1_pc~0 0)) (.cse39 (= ~data~0 .cse42)) (.cse8 (not (= ~r_st~0 0))) (.cse20 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse3 (= ~processed~0 0)) (.cse22 (= ~r_st~0 ~e_f~0)) (.cse33 (not .cse7)) (.cse23 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse24 (= ~t_b~0 0)) (.cse34 (not .cse18)) (.cse37 (not (= 2 ~wl_pc~0))) (.cse14 (= ~wb_pc~0 1)) (.cse19 (= ~wb_i~0 1)) (.cse27 (not (= ~e_c~0 0))) (.cse21 (= ~e_f~0 2)) (.cse28 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse9 (not (= ~e_g~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_g~0 0))) (.cse15 (not (= ~e_wl~0 0))) (.cse30 (= ~c_req_up~0 ~r_i~0)) (.cse17 (not (= ~e_e~0 0))) (.cse16 (not .cse32))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse18 .cse31 .cse32) (and .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse30 .cse17 .cse16 .cse19 .cse27 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse37 .cse10 .cse11 .cse9 .cse12 .cse14 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse8 .cse39 .cse34 .cse40 .cse37 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse13 .cse17 .cse16 (= ~d~0 .cse41) .cse19 .cse21) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse37 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse26 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 (= ~d~0 .cse42) .cse8 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse14 .cse17 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse37 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse19 .cse27 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse13 .cse17 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse6 .cse8 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse17 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse32) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse34 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse32) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse34 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse31) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse34 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse1 .cse4 .cse6 .cse9 .cse10 .cse11 .cse12 .cse15 .cse17 .cse19 .cse31 .cse27 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse34 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse31 .cse32) (and .cse0 .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16) (and .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse18 .cse31 .cse32) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse34 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse8 .cse39 .cse34 .cse40 .cse37 .cse10 .cse11 .cse9 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse26 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse34 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse31 .cse32) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse39 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse17 .cse16 .cse19 .cse20 .cse21) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16)))) [2020-11-30 00:17:01,335 INFO L274 CegarLoopResult]: For program point L226(lines 226 230) no Hoare annotation was computed. [2020-11-30 00:17:01,336 INFO L274 CegarLoopResult]: For program point L94(lines 94 102) no Hoare annotation was computed. [2020-11-30 00:17:01,336 INFO L274 CegarLoopResult]: For program point L61(lines 61 69) no Hoare annotation was computed. [2020-11-30 00:17:01,336 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-30 00:17:01,336 INFO L274 CegarLoopResult]: For program point L590(lines 590 594) no Hoare annotation was computed. [2020-11-30 00:17:01,337 INFO L270 CegarLoopResult]: At program point L227(lines 222 249) the Hoare annotation is: (let ((.cse22 (= ~c2_st~0 0)) (.cse24 (= ~c1_st~0 0))) (let ((.cse21 (not .cse24)) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse15 (= ~processed~0 0)) (.cse16 (not (= ~wb_st~0 0))) (.cse1 (not (= ~e_wl~0 1))) (.cse17 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse18 (not (= ~r_st~0 0))) (.cse23 (not .cse22)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse19 (= ~data~0 (+ ~t_b~0 1))) (.cse20 (= ~wb_pc~0 1)) (.cse7 (not (= ~e_wl~0 0))) (.cse8 (not (= ~e_e~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse10 (not (= ~e_c~0 0))) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse15 .cse16 .cse1 .cse17 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse19 .cse20 .cse7 .cse21 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse17 .cse2 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse15 .cse16 .cse1 .cse17 .cse2 .cse18 (= ~data~0 (+ ~t_b~0 2)) .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse15 .cse16 .cse1 .cse17 .cse2 .cse18 .cse23 .cse3 .cse4 .cse5 .cse6 .cse19 .cse20 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12)))) [2020-11-30 00:17:01,337 INFO L274 CegarLoopResult]: For program point L95(lines 95 99) no Hoare annotation was computed. [2020-11-30 00:17:01,337 INFO L270 CegarLoopResult]: At program point L62(lines 57 127) the Hoare annotation is: (let ((.cse0 (= ~c1_i~0 1)) (.cse1 (= ~e_c~0 2)) (.cse2 (= ~c2_pc~0 1)) (.cse4 (not (= ~wb_st~0 0))) (.cse5 (not (= ~e_wl~0 1))) (.cse6 (= ~c1_pc~0 1)) (.cse7 (= ~c2_i~0 1)) (.cse8 (not (= ~r_st~0 0))) (.cse9 (not (= ~e_g~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_g~0 0))) (.cse13 (not (= ~e_wl~0 0))) (.cse14 (= ~wb_pc~0 1)) (.cse15 (not (= ~e_e~0 0))) (.cse16 (= ~wb_i~0 1)) (.cse17 (not (= 0 ~wl_st~0))) (.cse18 (= ~e_f~0 2))) (or (let ((.cse3 (+ ~t_b~0 1))) (and .cse0 .cse1 .cse2 (= ~c~0 .cse3) (= ~c_t~0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~data~0 .cse3) .cse15 (= ~d~0 .cse3) .cse16 .cse17 .cse18)) (let ((.cse19 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (= ~c~0 .cse19) .cse7 (= ~d~0 .cse19) .cse8 (= ~data~0 .cse19) (= ~c_t~0 .cse19) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2020-11-30 00:17:01,338 INFO L274 CegarLoopResult]: For program point L426-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,338 INFO L274 CegarLoopResult]: For program point L526-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,339 INFO L270 CegarLoopResult]: At program point L328(lines 290 388) the Hoare annotation is: (let ((.cse32 (= ~c1_st~0 0)) (.cse18 (= ~c2_st~0 0)) (.cse7 (= ~wb_st~0 0)) (.cse42 (+ ~t_b~0 2)) (.cse41 (+ ~t_b~0 1))) (let ((.cse35 (= ~c~0 .cse41)) (.cse36 (= ~c_t~0 .cse41)) (.cse13 (= ~data~0 .cse41)) (.cse38 (= ~c~0 .cse42)) (.cse40 (= ~c_t~0 .cse42)) (.cse31 (= 0 ~wl_pc~0)) (.cse25 (= ~wb_pc~0 0)) (.cse26 (= ~c2_pc~0 0)) (.cse29 (= ~c1_pc~0 0)) (.cse39 (= ~data~0 .cse42)) (.cse8 (not (= ~r_st~0 0))) (.cse20 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse3 (= ~processed~0 0)) (.cse22 (= ~r_st~0 ~e_f~0)) (.cse33 (not .cse7)) (.cse23 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse24 (= ~t_b~0 0)) (.cse34 (not .cse18)) (.cse37 (not (= 2 ~wl_pc~0))) (.cse14 (= ~wb_pc~0 1)) (.cse19 (= ~wb_i~0 1)) (.cse27 (not (= ~e_c~0 0))) (.cse21 (= ~e_f~0 2)) (.cse28 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse9 (not (= ~e_g~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_g~0 0))) (.cse15 (not (= ~e_wl~0 0))) (.cse30 (= ~c_req_up~0 ~r_i~0)) (.cse17 (not (= ~e_e~0 0))) (.cse16 (not .cse32))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse18 .cse31 .cse32) (and .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse30 .cse17 .cse16 .cse19 .cse27 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse37 .cse10 .cse11 .cse9 .cse12 .cse14 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse8 .cse39 .cse34 .cse40 .cse37 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse13 .cse17 .cse16 (= ~d~0 .cse41) .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse13 .cse17 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse34 .cse37 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse26 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 (= ~d~0 .cse42) .cse8 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse16 .cse19 .cse21) (and .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse26 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse18 .cse31) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse37 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse19 .cse27 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse13 .cse17 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse36 .cse33 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse32) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse34 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse32) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse34 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16 .cse31) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse39 .cse34 .cse40 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse34 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse1 .cse4 .cse6 .cse9 .cse10 .cse11 .cse12 .cse15 .cse17 .cse19 .cse31 .cse27 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse34 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse31 .cse32) (and .cse0 .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16) (and .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse26 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse18 .cse31 .cse32) (and .cse0 .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse34 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse5 .cse38 .cse6 .cse8 .cse39 .cse34 .cse40 .cse37 .cse10 .cse11 .cse9 .cse12 .cse14 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse3 .cse22 .cse33 .cse4 .cse23 .cse6 .cse24 .cse26 .cse37 .cse14 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse5 .cse9 .cse10 .cse11 .cse12 .cse30 .cse17 .cse16 .cse18) (and .cse0 .cse3 .cse22 .cse23 .cse4 .cse6 .cse7 .cse24 .cse25 .cse34 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse9 .cse10 .cse11 .cse29 .cse12 .cse15 .cse30 .cse17 .cse31 .cse32) (and .cse3 .cse22 .cse4 .cse23 .cse6 .cse7 .cse24 .cse25 .cse26 .cse37 .cse19 .cse27 .cse20 .cse21 .cse28 .cse2 .cse1 .cse9 .cse10 .cse11 .cse29 .cse12 .cse30 .cse17 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse39 .cse34 .cse9 .cse10 .cse11 .cse12 .cse15 .cse14 .cse17 .cse16 .cse19 .cse20 .cse21) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21) (and .cse0 .cse3 .cse22 .cse33 .cse23 .cse4 .cse6 .cse24 .cse34 .cse37 .cse14 .cse19 .cse27 .cse21 .cse28 .cse1 .cse2 .cse5 .cse9 .cse10 .cse11 .cse12 .cse15 .cse30 .cse17 .cse16)))) [2020-11-30 00:17:01,340 INFO L274 CegarLoopResult]: For program point L295(lines 295 311) no Hoare annotation was computed. [2020-11-30 00:17:01,340 INFO L270 CegarLoopResult]: At program point L196-1(lines 177 217) the Hoare annotation is: (let ((.cse32 (= ~c1_st~0 0)) (.cse5 (= ~wb_st~0 0)) (.cse33 (+ ~t_b~0 1))) (let ((.cse27 (not (= 2 ~wl_pc~0))) (.cse34 (= ~data~0 .cse33)) (.cse26 (not .cse5)) (.cse29 (= ~c2_pc~0 1)) (.cse15 (= ~c1_pc~0 1)) (.cse30 (not (= ~r_st~0 0))) (.cse28 (= ~wb_pc~0 1)) (.cse23 (not .cse32)) (.cse25 (not (= 0 ~wl_st~0))) (.cse0 (= ~processed~0 0)) (.cse1 (= ~r_st~0 ~e_f~0)) (.cse2 (not (= ~e_wl~0 1))) (.cse3 (= ~data~0 0)) (.cse4 (= ~c2_i~0 1)) (.cse6 (= ~t_b~0 0)) (.cse7 (= ~wb_pc~0 0)) (.cse8 (not (= ~c2_st~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse10 (not (= ~e_c~0 0))) (.cse11 (= ~e_f~0 2)) (.cse12 (= ~d~0 0)) (.cse13 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse16 (not (= ~e_g~0 1))) (.cse17 (not (= ~e_e~0 1))) (.cse18 (not (= ~r_i~0 1))) (.cse31 (= ~c1_pc~0 0)) (.cse19 (not (= ~e_g~0 0))) (.cse20 (not (= ~e_wl~0 0))) (.cse21 (= ~c_req_up~0 ~r_i~0)) (.cse22 (not (= ~e_e~0 0))) (.cse24 (= 0 ~wl_pc~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 .cse23 .cse24) (and .cse13 .cse2 .cse4 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse9 .cse24 .cse10 .cse25 .cse11) (and .cse0 .cse26 .cse1 .cse3 .cse2 .cse4 .cse6 .cse8 .cse27 .cse28 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23 .cse22) (and .cse29 .cse13 .cse14 .cse26 .cse2 .cse15 .cse4 .cse30 .cse8 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse9 .cse10 .cse25 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse27 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse31 .cse19 .cse21 .cse22 .cse32) (and .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse27 .cse28 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse31 .cse19 .cse21 .cse22 .cse32) (and .cse29 .cse13 .cse14 (= ~c_t~0 .cse33) .cse26 .cse2 .cse15 .cse4 .cse30 .cse8 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse34 .cse22 .cse23 .cse9 .cse25 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse27 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23) (and .cse29 .cse13 .cse2 .cse15 .cse4 .cse27 .cse16 .cse17 .cse18 .cse19 .cse28 .cse20 .cse22 .cse9 .cse10 .cse25 .cse11) (and .cse29 .cse13 .cse14 .cse0 .cse2 .cse15 .cse4 .cse5 .cse30 .cse8 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse34 .cse22 .cse9 .cse32 .cse25 .cse11) (and .cse0 .cse26 .cse1 .cse3 .cse2 .cse4 .cse6 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse22 .cse24) (and .cse0 .cse1 .cse26 .cse3 .cse2 .cse4 .cse6 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse22 .cse24 .cse32) (and .cse29 .cse13 .cse14 .cse0 .cse2 .cse15 .cse4 .cse5 .cse30 (= ~data~0 (+ ~t_b~0 2)) .cse8 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse22 .cse23 .cse9 .cse25 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse22 .cse24 .cse32)))) [2020-11-30 00:17:01,341 INFO L274 CegarLoopResult]: For program point L64(lines 64 68) no Hoare annotation was computed. [2020-11-30 00:17:01,341 INFO L274 CegarLoopResult]: For program point L659(lines 659 675) no Hoare annotation was computed. [2020-11-30 00:17:01,341 INFO L274 CegarLoopResult]: For program point L626-1(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,341 INFO L274 CegarLoopResult]: For program point L362(lines 362 369) no Hoare annotation was computed. [2020-11-30 00:17:01,341 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-30 00:17:01,342 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-30 00:17:01,342 INFO L274 CegarLoopResult]: For program point L561-1(lines 537 677) no Hoare annotation was computed. [2020-11-30 00:17:01,342 INFO L274 CegarLoopResult]: For program point L462(lines 462 466) no Hoare annotation was computed. [2020-11-30 00:17:01,343 INFO L270 CegarLoopResult]: At program point L264(lines 257 274) the Hoare annotation is: (let ((.cse13 (= ~e_c~0 2)) (.cse15 (not (= ~wb_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse20 (not (= ~c1_st~0 0))) (.cse12 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse1 (not (= ~e_wl~0 1))) (.cse16 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse17 (not (= ~r_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~r_i~0 1))) (.cse5 (not (= ~e_g~0 0))) (.cse19 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_wl~0 0))) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~wb_i~0 1)) (.cse9 (not (= ~e_c~0 0))) (.cse10 (not (= 0 ~wl_st~0))) (.cse11 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~wl_pc~0) .cse9 .cse10 .cse11) (let ((.cse14 (+ ~t_b~0 1))) (and .cse12 .cse0 .cse13 (= ~c~0 .cse14) (= ~c_t~0 .cse14) .cse15 .cse1 .cse16 .cse2 .cse17 .cse18 .cse3 .cse4 .cse5 (= ~data~0 .cse14) .cse19 .cse6 (= ~d~0 .cse14) .cse20 .cse7 .cse8 .cse10 .cse11)) (let ((.cse21 (+ ~t_b~0 2))) (and .cse12 .cse0 .cse13 .cse15 .cse1 .cse16 (= ~c~0 .cse21) .cse2 (= ~d~0 .cse21) .cse17 (= ~data~0 .cse21) .cse18 (= ~c_t~0 .cse21) .cse3 .cse4 .cse5 .cse19 .cse6 .cse20 .cse7 .cse8 .cse10 .cse11)) (and .cse12 .cse0 .cse1 .cse16 .cse2 .cse17 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2020-11-30 00:17:01,343 INFO L274 CegarLoopResult]: For program point L298(lines 298 310) no Hoare annotation was computed. [2020-11-30 00:17:01,343 INFO L274 CegarLoopResult]: For program point L265(lines 257 274) no Hoare annotation was computed. [2020-11-30 00:17:01,343 INFO L274 CegarLoopResult]: For program point L199(lines 199 207) no Hoare annotation was computed. [2020-11-30 00:17:01,343 INFO L274 CegarLoopResult]: For program point L199-1(lines 199 207) no Hoare annotation was computed. [2020-11-30 00:17:01,344 INFO L274 CegarLoopResult]: For program point L133(lines 133 141) no Hoare annotation was computed. [2020-11-30 00:17:01,344 INFO L274 CegarLoopResult]: For program point L662(lines 662 674) no Hoare annotation was computed. [2020-11-30 00:17:01,344 INFO L274 CegarLoopResult]: For program point L497(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,344 INFO L274 CegarLoopResult]: For program point L431-1(lines 398 682) no Hoare annotation was computed. [2020-11-30 00:17:01,344 INFO L274 CegarLoopResult]: For program point L332(lines 332 339) no Hoare annotation was computed. [2020-11-30 00:17:01,345 INFO L274 CegarLoopResult]: For program point L266(lines 266 270) no Hoare annotation was computed. [2020-11-30 00:17:01,345 INFO L274 CegarLoopResult]: For program point L200(lines 200 204) no Hoare annotation was computed. [2020-11-30 00:17:01,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:17:01 BoogieIcfgContainer [2020-11-30 00:17:01,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:17:01,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:17:01,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:17:01,614 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:17:01,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:15:28" (3/4) ... [2020-11-30 00:17:01,619 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 00:17:01,651 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-11-30 00:17:01,652 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-30 00:17:01,653 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 00:17:01,654 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 00:17:01,868 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_646e9538-4da1-4a5e-83b9-978f419cf80b/bin/uautomizer/witness.graphml [2020-11-30 00:17:01,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:17:01,870 INFO L168 Benchmark]: Toolchain (without parser) took 96055.57 ms. Allocated memory was 113.2 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 82.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 377.0 MB. Max. memory is 16.1 GB. [2020-11-30 00:17:01,870 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 77.6 MB. Free memory was 36.0 MB in the beginning and 35.9 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:17:01,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.69 ms. Allocated memory is still 113.2 MB. Free memory was 82.6 MB in the beginning and 86.9 MB in the end (delta: -4.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:17:01,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.61 ms. Allocated memory is still 113.2 MB. Free memory was 86.9 MB in the beginning and 84.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:17:01,872 INFO L168 Benchmark]: Boogie Preprocessor took 96.85 ms. Allocated memory is still 113.2 MB. Free memory was 84.1 MB in the beginning and 82.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:17:01,872 INFO L168 Benchmark]: RCFGBuilder took 1642.06 ms. Allocated memory is still 113.2 MB. Free memory was 82.0 MB in the beginning and 41.4 MB in the end (delta: 40.6 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:17:01,873 INFO L168 Benchmark]: TraceAbstraction took 93335.87 ms. Allocated memory was 113.2 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 41.4 MB in the beginning and 1.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2020-11-30 00:17:01,873 INFO L168 Benchmark]: Witness Printer took 255.16 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:17:01,878 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.55 ms. Allocated memory is still 77.6 MB. Free memory was 36.0 MB in the beginning and 35.9 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 648.69 ms. Allocated memory is still 113.2 MB. Free memory was 82.6 MB in the beginning and 86.9 MB in the end (delta: -4.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.61 ms. Allocated memory is still 113.2 MB. Free memory was 86.9 MB in the beginning and 84.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 96.85 ms. Allocated memory is still 113.2 MB. Free memory was 84.1 MB in the beginning and 82.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1642.06 ms. Allocated memory is still 113.2 MB. Free memory was 82.0 MB in the beginning and 41.4 MB in the end (delta: 40.6 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 93335.87 ms. Allocated memory was 113.2 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 41.4 MB in the beginning and 1.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. * Witness Printer took 255.16 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && d == t_b + 1) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && t == data) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c1_i == 1 && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((c1_i == 1 && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((data == t_b && c1_i == 1) && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && d == t_b + 1) && wb_i == 1) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && t == data) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && e_wl == 1) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && d == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c1_i == 1 && e_c == 2) && c2_pc == 1) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && d == t_b + 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((c1_i == 1 && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && d == t_b + 1) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && t == data) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && t == data) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((e_c == 2 && c1_i == 1) && c2_i == 1) && wb_st == 0) && e_g == e_f) && !(r_i == 1)) && c_req_up == r_i) && c2_st == 0) && wb_i == 1) && 0 == wl_pc) && e_e == e_c) && c1_st == 0) && !(0 == wl_st)) && e_f == 2) && e_wl == e_c) || (((((((((((((((((((((e_c == 2 && c1_i == 1) && processed == 0) && r_st == e_f) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && e_g == e_f) && wb_pc == 0) && c2_pc == 0) && !(r_i == 1)) && c1_pc == 0) && c_req_up == r_i) && c2_st == 0) && wb_i == 1) && 0 == wl_pc) && e_e == e_c) && c1_st == 0) && e_f == 2) && d == 0) && e_wl == e_c) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && d == t_b + 1) && wb_i == 1) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && t == data) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0))) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && !(wb_st == 0)) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && 0 == wl_pc)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0))) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && t == data) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && d == t_b + 1) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && t == data) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && !(wb_st == 0)) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0))) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || ((((((((((((((((((((((((processed == 0 && !(wb_st == 0)) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && !(wb_st == 0)) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && 0 == wl_pc)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c == t_b + 1) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(2 == wl_pc)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 1)) && !(e_g == 0)) && wb_pc == 1) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && c_t == t_b + 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 30.2s, OverallIterations: 36, TraceHistogramMax: 9, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 62.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7721 SDtfs, 10598 SDslu, 16022 SDs, 0 SdLazy, 1765 SolverSat, 301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 479 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5290occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 7564 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 808 NumberOfFragments, 21277 HoareAnnotationTreeSize, 20 FomulaSimplifications, 26571765 FormulaSimplificationTreeSizeReduction, 11.7s HoareSimplificationTime, 20 FomulaSimplificationsInter, 3153522 FormulaSimplificationTreeSizeReductionInter, 50.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3541 NumberOfCodeBlocks, 3541 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3503 ConstructedInterpolants, 0 QuantifiedInterpolants, 1129777 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1059 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 38 InterpolantComputations, 34 PerfectInterpolantSequences, 1226/1492 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...