./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d321e3b1b642bcfc9c94c4888bd187898cb1af58 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:58:59,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:58:59,599 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:58:59,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:58:59,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:58:59,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:58:59,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:58:59,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:58:59,612 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:58:59,613 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:58:59,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:58:59,614 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:58:59,615 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:58:59,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:58:59,616 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:58:59,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:58:59,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:58:59,619 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:58:59,620 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:58:59,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:58:59,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:58:59,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:58:59,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:58:59,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:58:59,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:58:59,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:58:59,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:58:59,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:58:59,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:58:59,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:58:59,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:58:59,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:58:59,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:58:59,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:58:59,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:58:59,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:58:59,632 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 15:58:59,642 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:58:59,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:58:59,643 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:58:59,643 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 15:58:59,644 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:58:59,644 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:58:59,644 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:58:59,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:58:59,644 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:58:59,644 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:58:59,645 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:58:59,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:58:59,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:58:59,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:58:59,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:58:59,645 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:58:59,645 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:58:59,645 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:58:59,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:58:59,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:58:59,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:58:59,646 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:58:59,646 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:58:59,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:58:59,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:58:59,647 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:58:59,647 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:58:59,647 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:58:59,647 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:58:59,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:58:59,647 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/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(__VERIFIER_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 -> d321e3b1b642bcfc9c94c4888bd187898cb1af58 [2018-11-18 15:58:59,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:58:59,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:58:59,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:58:59,682 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:58:59,682 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:58:59,683 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-18 15:58:59,723 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/data/08ce999f5/1acdcb7c8f1d47a7abadd6087acde748/FLAG2b63c2cf4 [2018-11-18 15:59:00,056 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:59:00,057 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-18 15:59:00,064 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/data/08ce999f5/1acdcb7c8f1d47a7abadd6087acde748/FLAG2b63c2cf4 [2018-11-18 15:59:00,482 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/data/08ce999f5/1acdcb7c8f1d47a7abadd6087acde748 [2018-11-18 15:59:00,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:59:00,484 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 15:59:00,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:59:00,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:59:00,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:59:00,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:59:00" (1/1) ... [2018-11-18 15:59:00,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296a64e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00, skipping insertion in model container [2018-11-18 15:59:00,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:59:00" (1/1) ... [2018-11-18 15:59:00,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:59:00,518 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:59:00,647 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:59:00,650 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:59:00,672 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:59:00,682 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:59:00,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00 WrapperNode [2018-11-18 15:59:00,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:59:00,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:59:00,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:59:00,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:59:00,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00" (1/1) ... [2018-11-18 15:59:00,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00" (1/1) ... [2018-11-18 15:59:00,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00" (1/1) ... [2018-11-18 15:59:00,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00" (1/1) ... [2018-11-18 15:59:00,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00" (1/1) ... [2018-11-18 15:59:00,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00" (1/1) ... [2018-11-18 15:59:00,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00" (1/1) ... [2018-11-18 15:59:00,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:59:00,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:59:00,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:59:00,750 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:59:00,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/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 [2018-11-18 15:59:00,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:59:00,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:59:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 15:59:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-11-18 15:59:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-18 15:59:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-18 15:59:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2018-11-18 15:59:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-18 15:59:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-18 15:59:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 15:59:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 15:59:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 15:59:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 15:59:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 15:59:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 15:59:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 15:59:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 15:59:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 15:59:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 15:59:00,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:59:00,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 15:59:00,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 15:59:00,789 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 15:59:00,789 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-11-18 15:59:00,789 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-18 15:59:00,789 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-18 15:59:00,789 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2018-11-18 15:59:00,789 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 15:59:00,790 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 15:59:00,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:59:00,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:59:00,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:59:01,150 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:59:01,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:59:01 BoogieIcfgContainer [2018-11-18 15:59:01,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:59:01,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:59:01,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:59:01,155 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:59:01,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:59:00" (1/3) ... [2018-11-18 15:59:01,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e6a588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:59:01, skipping insertion in model container [2018-11-18 15:59:01,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:59:00" (2/3) ... [2018-11-18 15:59:01,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e6a588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:59:01, skipping insertion in model container [2018-11-18 15:59:01,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:59:01" (3/3) ... [2018-11-18 15:59:01,158 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-18 15:59:01,165 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:59:01,172 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:59:01,183 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:59:01,207 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:59:01,207 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:59:01,207 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:59:01,208 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:59:01,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:59:01,208 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:59:01,208 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:59:01,208 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:59:01,208 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:59:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-11-18 15:59:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 15:59:01,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:01,237 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:01,239 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:01,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:01,244 INFO L82 PathProgramCache]: Analyzing trace with hash 414554663, now seen corresponding path program 1 times [2018-11-18 15:59:01,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:01,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:01,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:01,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:01,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:01,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:01,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:59:01,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:59:01,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:59:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:59:01,476 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 5 states. [2018-11-18 15:59:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:02,010 INFO L93 Difference]: Finished difference Result 392 states and 558 transitions. [2018-11-18 15:59:02,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:59:02,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-18 15:59:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:02,024 INFO L225 Difference]: With dead ends: 392 [2018-11-18 15:59:02,024 INFO L226 Difference]: Without dead ends: 261 [2018-11-18 15:59:02,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:59:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-18 15:59:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 241. [2018-11-18 15:59:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-18 15:59:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 313 transitions. [2018-11-18 15:59:02,084 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 313 transitions. Word has length 80 [2018-11-18 15:59:02,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:02,084 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 313 transitions. [2018-11-18 15:59:02,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:59:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 313 transitions. [2018-11-18 15:59:02,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 15:59:02,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:02,087 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:02,087 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:02,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:02,088 INFO L82 PathProgramCache]: Analyzing trace with hash -180453434, now seen corresponding path program 1 times [2018-11-18 15:59:02,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:02,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:02,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:02,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:02,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:02,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:02,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:59:02,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:59:02,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:59:02,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:59:02,193 INFO L87 Difference]: Start difference. First operand 241 states and 313 transitions. Second operand 6 states. [2018-11-18 15:59:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:02,700 INFO L93 Difference]: Finished difference Result 650 states and 865 transitions. [2018-11-18 15:59:02,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:59:02,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-18 15:59:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:02,704 INFO L225 Difference]: With dead ends: 650 [2018-11-18 15:59:02,705 INFO L226 Difference]: Without dead ends: 436 [2018-11-18 15:59:02,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:59:02,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-18 15:59:02,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 371. [2018-11-18 15:59:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-18 15:59:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 487 transitions. [2018-11-18 15:59:02,744 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 487 transitions. Word has length 80 [2018-11-18 15:59:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:02,744 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 487 transitions. [2018-11-18 15:59:02,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:59:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 487 transitions. [2018-11-18 15:59:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 15:59:02,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:02,748 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:02,748 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:02,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1080463816, now seen corresponding path program 1 times [2018-11-18 15:59:02,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:02,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:02,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:02,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:02,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:02,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:02,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:59:02,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:59:02,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:59:02,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:59:02,802 INFO L87 Difference]: Start difference. First operand 371 states and 487 transitions. Second operand 6 states. [2018-11-18 15:59:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:02,853 INFO L93 Difference]: Finished difference Result 709 states and 932 transitions. [2018-11-18 15:59:02,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:59:02,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-18 15:59:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:02,856 INFO L225 Difference]: With dead ends: 709 [2018-11-18 15:59:02,856 INFO L226 Difference]: Without dead ends: 381 [2018-11-18 15:59:02,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:59:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-18 15:59:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 376. [2018-11-18 15:59:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-18 15:59:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 490 transitions. [2018-11-18 15:59:02,879 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 490 transitions. Word has length 80 [2018-11-18 15:59:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:02,880 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 490 transitions. [2018-11-18 15:59:02,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:59:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 490 transitions. [2018-11-18 15:59:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 15:59:02,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:02,883 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:02,883 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:02,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash -968924026, now seen corresponding path program 1 times [2018-11-18 15:59:02,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:02,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:02,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:02,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:02,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:59:02,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:59:02,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:59:02,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:59:02,951 INFO L87 Difference]: Start difference. First operand 376 states and 490 transitions. Second operand 4 states. [2018-11-18 15:59:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:03,059 INFO L93 Difference]: Finished difference Result 1027 states and 1355 transitions. [2018-11-18 15:59:03,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:59:03,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-18 15:59:03,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:03,063 INFO L225 Difference]: With dead ends: 1027 [2018-11-18 15:59:03,063 INFO L226 Difference]: Without dead ends: 694 [2018-11-18 15:59:03,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:59:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-11-18 15:59:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2018-11-18 15:59:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-11-18 15:59:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 855 transitions. [2018-11-18 15:59:03,096 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 855 transitions. Word has length 80 [2018-11-18 15:59:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:03,096 INFO L480 AbstractCegarLoop]: Abstraction has 672 states and 855 transitions. [2018-11-18 15:59:03,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:59:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 855 transitions. [2018-11-18 15:59:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 15:59:03,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:03,098 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:03,099 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:03,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:03,100 INFO L82 PathProgramCache]: Analyzing trace with hash -462014161, now seen corresponding path program 1 times [2018-11-18 15:59:03,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:03,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:03,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:03,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:03,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:03,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:03,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:59:03,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:59:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:59:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:59:03,165 INFO L87 Difference]: Start difference. First operand 672 states and 855 transitions. Second operand 6 states. [2018-11-18 15:59:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:03,210 INFO L93 Difference]: Finished difference Result 1322 states and 1681 transitions. [2018-11-18 15:59:03,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:59:03,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-18 15:59:03,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:03,213 INFO L225 Difference]: With dead ends: 1322 [2018-11-18 15:59:03,214 INFO L226 Difference]: Without dead ends: 693 [2018-11-18 15:59:03,215 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:59:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-11-18 15:59:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 687. [2018-11-18 15:59:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-11-18 15:59:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 867 transitions. [2018-11-18 15:59:03,239 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 867 transitions. Word has length 81 [2018-11-18 15:59:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:03,240 INFO L480 AbstractCegarLoop]: Abstraction has 687 states and 867 transitions. [2018-11-18 15:59:03,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:59:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 867 transitions. [2018-11-18 15:59:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 15:59:03,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:03,241 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:03,242 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:03,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash -856380947, now seen corresponding path program 1 times [2018-11-18 15:59:03,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:03,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:03,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:03,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:03,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:59:03,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:59:03,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:59:03,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:59:03,306 INFO L87 Difference]: Start difference. First operand 687 states and 867 transitions. Second operand 6 states. [2018-11-18 15:59:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:03,843 INFO L93 Difference]: Finished difference Result 1400 states and 1755 transitions. [2018-11-18 15:59:03,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:59:03,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-18 15:59:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:03,846 INFO L225 Difference]: With dead ends: 1400 [2018-11-18 15:59:03,846 INFO L226 Difference]: Without dead ends: 854 [2018-11-18 15:59:03,848 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:59:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-18 15:59:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 703. [2018-11-18 15:59:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-11-18 15:59:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 876 transitions. [2018-11-18 15:59:03,876 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 876 transitions. Word has length 81 [2018-11-18 15:59:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:03,876 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 876 transitions. [2018-11-18 15:59:03,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:59:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 876 transitions. [2018-11-18 15:59:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 15:59:03,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:03,878 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:03,878 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:03,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash -154781073, now seen corresponding path program 1 times [2018-11-18 15:59:03,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:03,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:03,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:03,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:03,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:03,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:03,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:59:03,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:59:03,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:59:03,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:59:03,905 INFO L87 Difference]: Start difference. First operand 703 states and 876 transitions. Second operand 3 states. [2018-11-18 15:59:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:03,947 INFO L93 Difference]: Finished difference Result 1944 states and 2474 transitions. [2018-11-18 15:59:03,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:59:03,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-18 15:59:03,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:03,951 INFO L225 Difference]: With dead ends: 1944 [2018-11-18 15:59:03,951 INFO L226 Difference]: Without dead ends: 1312 [2018-11-18 15:59:03,953 INFO L604 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 [2018-11-18 15:59:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2018-11-18 15:59:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1308. [2018-11-18 15:59:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2018-11-18 15:59:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1642 transitions. [2018-11-18 15:59:03,993 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1642 transitions. Word has length 81 [2018-11-18 15:59:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:03,994 INFO L480 AbstractCegarLoop]: Abstraction has 1308 states and 1642 transitions. [2018-11-18 15:59:03,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:59:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1642 transitions. [2018-11-18 15:59:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 15:59:03,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:03,995 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:03,995 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:03,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:03,996 INFO L82 PathProgramCache]: Analyzing trace with hash -360471793, now seen corresponding path program 1 times [2018-11-18 15:59:03,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:03,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:03,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:03,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:03,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:04,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:04,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:59:04,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:59:04,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:59:04,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:59:04,081 INFO L87 Difference]: Start difference. First operand 1308 states and 1642 transitions. Second operand 5 states. [2018-11-18 15:59:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:04,193 INFO L93 Difference]: Finished difference Result 3672 states and 4841 transitions. [2018-11-18 15:59:04,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:59:04,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-18 15:59:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:04,201 INFO L225 Difference]: With dead ends: 3672 [2018-11-18 15:59:04,201 INFO L226 Difference]: Without dead ends: 2381 [2018-11-18 15:59:04,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:59:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2018-11-18 15:59:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2288. [2018-11-18 15:59:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2288 states. [2018-11-18 15:59:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 2911 transitions. [2018-11-18 15:59:04,293 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 2911 transitions. Word has length 82 [2018-11-18 15:59:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:04,294 INFO L480 AbstractCegarLoop]: Abstraction has 2288 states and 2911 transitions. [2018-11-18 15:59:04,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:59:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2911 transitions. [2018-11-18 15:59:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 15:59:04,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:04,308 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:04,308 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:04,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:04,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1844117390, now seen corresponding path program 1 times [2018-11-18 15:59:04,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:04,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:04,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:04,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:04,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:04,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:04,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:59:04,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:59:04,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:59:04,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:59:04,373 INFO L87 Difference]: Start difference. First operand 2288 states and 2911 transitions. Second operand 5 states. [2018-11-18 15:59:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:04,830 INFO L93 Difference]: Finished difference Result 7220 states and 10005 transitions. [2018-11-18 15:59:04,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:59:04,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-18 15:59:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:04,846 INFO L225 Difference]: With dead ends: 7220 [2018-11-18 15:59:04,846 INFO L226 Difference]: Without dead ends: 5022 [2018-11-18 15:59:04,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:59:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2018-11-18 15:59:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4867. [2018-11-18 15:59:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4867 states. [2018-11-18 15:59:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 6457 transitions. [2018-11-18 15:59:05,058 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 6457 transitions. Word has length 91 [2018-11-18 15:59:05,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:05,059 INFO L480 AbstractCegarLoop]: Abstraction has 4867 states and 6457 transitions. [2018-11-18 15:59:05,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:59:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 6457 transitions. [2018-11-18 15:59:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 15:59:05,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:05,061 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:05,062 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:05,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:05,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2027366593, now seen corresponding path program 1 times [2018-11-18 15:59:05,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:05,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:05,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 15:59:05,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:05,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:59:05,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:59:05,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:59:05,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:59:05,098 INFO L87 Difference]: Start difference. First operand 4867 states and 6457 transitions. Second operand 4 states. [2018-11-18 15:59:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:05,299 INFO L93 Difference]: Finished difference Result 9564 states and 12701 transitions. [2018-11-18 15:59:05,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:59:05,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-18 15:59:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:05,314 INFO L225 Difference]: With dead ends: 9564 [2018-11-18 15:59:05,314 INFO L226 Difference]: Without dead ends: 4754 [2018-11-18 15:59:05,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:59:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2018-11-18 15:59:05,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4754. [2018-11-18 15:59:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4754 states. [2018-11-18 15:59:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6310 transitions. [2018-11-18 15:59:05,498 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6310 transitions. Word has length 93 [2018-11-18 15:59:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:05,499 INFO L480 AbstractCegarLoop]: Abstraction has 4754 states and 6310 transitions. [2018-11-18 15:59:05,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:59:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6310 transitions. [2018-11-18 15:59:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 15:59:05,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:05,500 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:05,500 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:05,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash 49970305, now seen corresponding path program 1 times [2018-11-18 15:59:05,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:05,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:05,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:05,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:05,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:05,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:05,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:59:05,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:59:05,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:59:05,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:59:05,545 INFO L87 Difference]: Start difference. First operand 4754 states and 6310 transitions. Second operand 4 states. [2018-11-18 15:59:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:05,868 INFO L93 Difference]: Finished difference Result 6277 states and 8349 transitions. [2018-11-18 15:59:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:59:05,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-18 15:59:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:05,888 INFO L225 Difference]: With dead ends: 6277 [2018-11-18 15:59:05,888 INFO L226 Difference]: Without dead ends: 6274 [2018-11-18 15:59:05,891 INFO L604 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 [2018-11-18 15:59:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6274 states. [2018-11-18 15:59:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6274 to 6100. [2018-11-18 15:59:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6100 states. [2018-11-18 15:59:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6100 states to 6100 states and 8100 transitions. [2018-11-18 15:59:06,123 INFO L78 Accepts]: Start accepts. Automaton has 6100 states and 8100 transitions. Word has length 93 [2018-11-18 15:59:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:06,124 INFO L480 AbstractCegarLoop]: Abstraction has 6100 states and 8100 transitions. [2018-11-18 15:59:06,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:59:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6100 states and 8100 transitions. [2018-11-18 15:59:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 15:59:06,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:06,125 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:06,126 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:06,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1548759428, now seen corresponding path program 1 times [2018-11-18 15:59:06,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:06,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:06,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:06,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:06,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:06,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:59:06,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:59:06,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:06,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:59:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:06,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:59:06,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-18 15:59:06,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:59:06,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:59:06,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:59:06,417 INFO L87 Difference]: Start difference. First operand 6100 states and 8100 transitions. Second operand 11 states. [2018-11-18 15:59:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:09,188 INFO L93 Difference]: Finished difference Result 16455 states and 24564 transitions. [2018-11-18 15:59:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 15:59:09,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-11-18 15:59:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:09,270 INFO L225 Difference]: With dead ends: 16455 [2018-11-18 15:59:09,270 INFO L226 Difference]: Without dead ends: 16452 [2018-11-18 15:59:09,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:59:09,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16452 states. [2018-11-18 15:59:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16452 to 15869. [2018-11-18 15:59:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15869 states. [2018-11-18 15:59:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15869 states to 15869 states and 23411 transitions. [2018-11-18 15:59:10,486 INFO L78 Accepts]: Start accepts. Automaton has 15869 states and 23411 transitions. Word has length 94 [2018-11-18 15:59:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:10,487 INFO L480 AbstractCegarLoop]: Abstraction has 15869 states and 23411 transitions. [2018-11-18 15:59:10,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:59:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 15869 states and 23411 transitions. [2018-11-18 15:59:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 15:59:10,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:10,489 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-18 15:59:10,489 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:10,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:10,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1694713556, now seen corresponding path program 2 times [2018-11-18 15:59:10,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:10,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:10,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:10,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:10,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:59:10,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:10,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:59:10,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:59:10,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:59:10,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:59:10,533 INFO L87 Difference]: Start difference. First operand 15869 states and 23411 transitions. Second operand 3 states. [2018-11-18 15:59:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:11,284 INFO L93 Difference]: Finished difference Result 25956 states and 39936 transitions. [2018-11-18 15:59:11,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:59:11,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-11-18 15:59:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:11,334 INFO L225 Difference]: With dead ends: 25956 [2018-11-18 15:59:11,334 INFO L226 Difference]: Without dead ends: 10849 [2018-11-18 15:59:11,421 INFO L604 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 [2018-11-18 15:59:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10849 states. [2018-11-18 15:59:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10849 to 10581. [2018-11-18 15:59:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10581 states. [2018-11-18 15:59:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10581 states to 10581 states and 14848 transitions. [2018-11-18 15:59:12,197 INFO L78 Accepts]: Start accepts. Automaton has 10581 states and 14848 transitions. Word has length 98 [2018-11-18 15:59:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:12,197 INFO L480 AbstractCegarLoop]: Abstraction has 10581 states and 14848 transitions. [2018-11-18 15:59:12,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:59:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 10581 states and 14848 transitions. [2018-11-18 15:59:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 15:59:12,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:12,199 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:59:12,200 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:12,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash 153623661, now seen corresponding path program 1 times [2018-11-18 15:59:12,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:12,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:12,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:12,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:59:12,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:59:12,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:59:12,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:59:12,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:59:12,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:59:12,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:59:12,279 INFO L87 Difference]: Start difference. First operand 10581 states and 14848 transitions. Second operand 7 states. [2018-11-18 15:59:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:14,836 INFO L93 Difference]: Finished difference Result 37235 states and 59628 transitions. [2018-11-18 15:59:14,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 15:59:14,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-18 15:59:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:14,923 INFO L225 Difference]: With dead ends: 37235 [2018-11-18 15:59:14,923 INFO L226 Difference]: Without dead ends: 20686 [2018-11-18 15:59:15,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:59:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20686 states. [2018-11-18 15:59:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20686 to 19202. [2018-11-18 15:59:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19202 states. [2018-11-18 15:59:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19202 states to 19202 states and 25921 transitions. [2018-11-18 15:59:16,064 INFO L78 Accepts]: Start accepts. Automaton has 19202 states and 25921 transitions. Word has length 104 [2018-11-18 15:59:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:16,065 INFO L480 AbstractCegarLoop]: Abstraction has 19202 states and 25921 transitions. [2018-11-18 15:59:16,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:59:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 19202 states and 25921 transitions. [2018-11-18 15:59:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 15:59:16,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:16,068 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-18 15:59:16,068 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:16,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:16,068 INFO L82 PathProgramCache]: Analyzing trace with hash -290028969, now seen corresponding path program 1 times [2018-11-18 15:59:16,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:16,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:16,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:59:16,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:59:16,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:59:16,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:16,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:59:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 15:59:16,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:59:16,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-18 15:59:16,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:59:16,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:59:16,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:59:16,328 INFO L87 Difference]: Start difference. First operand 19202 states and 25921 transitions. Second operand 9 states. [2018-11-18 15:59:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:17,737 INFO L93 Difference]: Finished difference Result 33794 states and 46412 transitions. [2018-11-18 15:59:17,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 15:59:17,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2018-11-18 15:59:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:17,790 INFO L225 Difference]: With dead ends: 33794 [2018-11-18 15:59:17,790 INFO L226 Difference]: Without dead ends: 15604 [2018-11-18 15:59:17,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:59:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15604 states. [2018-11-18 15:59:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15604 to 14832. [2018-11-18 15:59:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14832 states. [2018-11-18 15:59:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 17612 transitions. [2018-11-18 15:59:18,357 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 17612 transitions. Word has length 117 [2018-11-18 15:59:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:18,357 INFO L480 AbstractCegarLoop]: Abstraction has 14832 states and 17612 transitions. [2018-11-18 15:59:18,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:59:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 17612 transitions. [2018-11-18 15:59:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 15:59:18,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:18,363 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:18,364 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:18,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1020421402, now seen corresponding path program 1 times [2018-11-18 15:59:18,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:18,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:18,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:18,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:18,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 15:59:18,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:59:18,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:59:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:18,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:59:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 15:59:18,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:59:18,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-18 15:59:18,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:59:18,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:59:18,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:59:18,661 INFO L87 Difference]: Start difference. First operand 14832 states and 17612 transitions. Second operand 8 states. [2018-11-18 15:59:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:19,697 INFO L93 Difference]: Finished difference Result 32836 states and 39584 transitions. [2018-11-18 15:59:19,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:59:19,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2018-11-18 15:59:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:19,750 INFO L225 Difference]: With dead ends: 32836 [2018-11-18 15:59:19,750 INFO L226 Difference]: Without dead ends: 18422 [2018-11-18 15:59:19,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:59:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18422 states. [2018-11-18 15:59:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18422 to 18203. [2018-11-18 15:59:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18203 states. [2018-11-18 15:59:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18203 states to 18203 states and 21726 transitions. [2018-11-18 15:59:20,414 INFO L78 Accepts]: Start accepts. Automaton has 18203 states and 21726 transitions. Word has length 180 [2018-11-18 15:59:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:20,414 INFO L480 AbstractCegarLoop]: Abstraction has 18203 states and 21726 transitions. [2018-11-18 15:59:20,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:59:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 18203 states and 21726 transitions. [2018-11-18 15:59:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 15:59:20,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:20,417 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:59:20,417 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:20,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1395755092, now seen corresponding path program 1 times [2018-11-18 15:59:20,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:20,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:20,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 15:59:20,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:59:20,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:59:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:20,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:59:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 15:59:20,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:59:20,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-18 15:59:20,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:59:20,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:59:20,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:59:20,724 INFO L87 Difference]: Start difference. First operand 18203 states and 21726 transitions. Second operand 11 states. [2018-11-18 15:59:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:22,533 INFO L93 Difference]: Finished difference Result 54693 states and 66960 transitions. [2018-11-18 15:59:22,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 15:59:22,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 198 [2018-11-18 15:59:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:22,638 INFO L225 Difference]: With dead ends: 54693 [2018-11-18 15:59:22,638 INFO L226 Difference]: Without dead ends: 31482 [2018-11-18 15:59:22,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-11-18 15:59:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31482 states. [2018-11-18 15:59:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31482 to 26785. [2018-11-18 15:59:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26785 states. [2018-11-18 15:59:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26785 states to 26785 states and 31218 transitions. [2018-11-18 15:59:23,846 INFO L78 Accepts]: Start accepts. Automaton has 26785 states and 31218 transitions. Word has length 198 [2018-11-18 15:59:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:23,846 INFO L480 AbstractCegarLoop]: Abstraction has 26785 states and 31218 transitions. [2018-11-18 15:59:23,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:59:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 26785 states and 31218 transitions. [2018-11-18 15:59:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-18 15:59:23,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:23,851 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-18 15:59:23,851 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:23,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:23,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2014329844, now seen corresponding path program 1 times [2018-11-18 15:59:23,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:23,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:23,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:23,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:23,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-18 15:59:23,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:59:23,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:59:23,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:24,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:59:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 15:59:24,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:59:24,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-18 15:59:24,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:59:24,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:59:24,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:59:24,084 INFO L87 Difference]: Start difference. First operand 26785 states and 31218 transitions. Second operand 9 states. [2018-11-18 15:59:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:24,652 INFO L93 Difference]: Finished difference Result 36899 states and 43686 transitions. [2018-11-18 15:59:24,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 15:59:24,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 285 [2018-11-18 15:59:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:24,675 INFO L225 Difference]: With dead ends: 36899 [2018-11-18 15:59:24,675 INFO L226 Difference]: Without dead ends: 10163 [2018-11-18 15:59:24,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-18 15:59:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10163 states. [2018-11-18 15:59:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10163 to 7348. [2018-11-18 15:59:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7348 states. [2018-11-18 15:59:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7348 states to 7348 states and 8322 transitions. [2018-11-18 15:59:25,138 INFO L78 Accepts]: Start accepts. Automaton has 7348 states and 8322 transitions. Word has length 285 [2018-11-18 15:59:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:25,139 INFO L480 AbstractCegarLoop]: Abstraction has 7348 states and 8322 transitions. [2018-11-18 15:59:25,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:59:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7348 states and 8322 transitions. [2018-11-18 15:59:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-18 15:59:25,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:25,142 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-18 15:59:25,143 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:25,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:25,143 INFO L82 PathProgramCache]: Analyzing trace with hash 431077837, now seen corresponding path program 1 times [2018-11-18 15:59:25,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:25,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:25,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:25,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:25,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 58 proven. 7 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-18 15:59:25,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:59:25,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:59:25,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:25,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:59:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 293 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 15:59:25,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:59:25,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 15:59:25,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:59:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:59:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:59:25,393 INFO L87 Difference]: Start difference. First operand 7348 states and 8322 transitions. Second operand 8 states. [2018-11-18 15:59:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:26,011 INFO L93 Difference]: Finished difference Result 11291 states and 12902 transitions. [2018-11-18 15:59:26,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 15:59:26,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 307 [2018-11-18 15:59:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:26,019 INFO L225 Difference]: With dead ends: 11291 [2018-11-18 15:59:26,019 INFO L226 Difference]: Without dead ends: 4324 [2018-11-18 15:59:26,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-18 15:59:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4324 states. [2018-11-18 15:59:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4324 to 4153. [2018-11-18 15:59:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2018-11-18 15:59:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 4705 transitions. [2018-11-18 15:59:26,203 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 4705 transitions. Word has length 307 [2018-11-18 15:59:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:26,203 INFO L480 AbstractCegarLoop]: Abstraction has 4153 states and 4705 transitions. [2018-11-18 15:59:26,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:59:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 4705 transitions. [2018-11-18 15:59:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-18 15:59:26,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:59:26,206 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-18 15:59:26,206 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:59:26,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:59:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1634190171, now seen corresponding path program 1 times [2018-11-18 15:59:26,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:59:26,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:59:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:26,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:59:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-18 15:59:26,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:59:26,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:59:26,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:59:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:59:26,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:59:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-18 15:59:26,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:59:26,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-18 15:59:26,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:59:26,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:59:26,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:59:26,492 INFO L87 Difference]: Start difference. First operand 4153 states and 4705 transitions. Second operand 6 states. [2018-11-18 15:59:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:59:26,777 INFO L93 Difference]: Finished difference Result 4809 states and 5427 transitions. [2018-11-18 15:59:26,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:59:26,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 307 [2018-11-18 15:59:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:59:26,779 INFO L225 Difference]: With dead ends: 4809 [2018-11-18 15:59:26,779 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 15:59:26,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:59:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 15:59:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 15:59:26,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 15:59:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:59:26,786 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-11-18 15:59:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:59:26,786 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:59:26,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:59:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:59:26,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 15:59:26,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 15:59:26,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:26,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:26,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:26,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:26,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:27,557 WARN L180 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 267 [2018-11-18 15:59:28,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:28,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:29,770 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 273 [2018-11-18 15:59:30,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,842 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 245 [2018-11-18 15:59:30,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:30,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,076 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 241 [2018-11-18 15:59:31,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,856 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 252 [2018-11-18 15:59:31,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:31,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:32,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:32,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:32,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:32,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:33,594 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 272 [2018-11-18 15:59:34,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,760 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 272 [2018-11-18 15:59:34,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:34,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:35,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:59:35,409 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 85 [2018-11-18 15:59:36,552 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 273 DAG size of output: 105 [2018-11-18 15:59:37,516 WARN L180 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 98 [2018-11-18 15:59:41,165 WARN L180 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 429 DAG size of output: 162 [2018-11-18 15:59:43,954 WARN L180 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 393 DAG size of output: 112 [2018-11-18 15:59:44,223 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 1 [2018-11-18 15:59:44,326 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2018-11-18 15:59:45,729 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 290 DAG size of output: 124 [2018-11-18 15:59:47,573 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 477 DAG size of output: 95 [2018-11-18 15:59:48,687 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 248 DAG size of output: 104 [2018-11-18 15:59:48,894 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2018-11-18 15:59:50,101 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 279 DAG size of output: 109 [2018-11-18 15:59:50,286 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 1 [2018-11-18 15:59:50,486 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 1 [2018-11-18 15:59:52,037 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 379 DAG size of output: 99 [2018-11-18 15:59:53,250 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 378 DAG size of output: 91 [2018-11-18 15:59:53,392 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 374 DAG size of output: 1 [2018-11-18 15:59:53,951 WARN L180 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 82 [2018-11-18 15:59:54,681 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 92 [2018-11-18 15:59:55,609 WARN L180 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 101 [2018-11-18 15:59:56,496 WARN L180 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 99 [2018-11-18 15:59:58,068 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 379 DAG size of output: 99 [2018-11-18 16:00:01,296 WARN L180 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 386 DAG size of output: 153 [2018-11-18 16:00:02,369 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 261 DAG size of output: 104 [2018-11-18 16:00:03,815 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 496 DAG size of output: 81 [2018-11-18 16:00:05,222 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 434 DAG size of output: 108 [2018-11-18 16:00:08,818 WARN L180 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 429 DAG size of output: 162 [2018-11-18 16:00:09,021 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 492 DAG size of output: 1 [2018-11-18 16:00:10,145 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 276 DAG size of output: 109 [2018-11-18 16:00:10,707 WARN L180 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 491 DAG size of output: 1 [2018-11-18 16:00:12,951 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 422 DAG size of output: 147 [2018-11-18 16:00:14,400 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 309 DAG size of output: 94 [2018-11-18 16:00:16,592 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 387 DAG size of output: 88 [2018-11-18 16:00:17,090 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 91 [2018-11-18 16:00:19,221 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 304 DAG size of output: 138 [2018-11-18 16:00:20,341 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 276 DAG size of output: 109 [2018-11-18 16:00:21,019 WARN L180 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 89 [2018-11-18 16:00:21,377 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 94 [2018-11-18 16:00:22,817 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 405 DAG size of output: 101 [2018-11-18 16:00:23,013 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2018-11-18 16:00:23,522 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 91 [2018-11-18 16:00:23,616 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-11-18 16:00:23,616 INFO L425 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-11-18 16:00:23,616 INFO L425 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2018-11-18 16:00:23,616 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-11-18 16:00:23,617 INFO L421 ceAbstractionStarter]: At program point L303(line 303) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse32 (+ ~c_num_read~0 1)) (.cse26 (= 2 ~c_dr_st~0)) (.cse21 (= 2 ~p_dw_st~0)) (.cse31 (not (= 0 ~c_dr_st~0))) (.cse28 (= ~p_dw_st~0 0))) (let ((.cse10 (not (= 0 ~p_num_write~0))) (.cse22 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (and .cse31 .cse28)) (.cse12 (and .cse26 .cse21)) (.cse25 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 0 ~c_num_read~0))) (.cse19 (< 0 ~q_req_up~0)) (.cse14 (< ~p_num_write~0 ~c_num_read~0)) (.cse2 (< ~q_free~0 1)) (.cse9 (< 1 ~q_free~0)) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (and .cse31 .cse21)) (.cse29 (< ~p_num_write~0 .cse32)) (.cse15 (not .cse0)) (.cse30 (< .cse32 ~p_num_write~0)) (.cse17 (not (= |old(~p_dw_st~0)| 2))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse13 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse23 (not (= ~q_free~0 0))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse24 (= 1 ~q_req_up~0)) (.cse20 (not (= ~q_read_ev~0 2))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse7 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 (or .cse13 .cse14 .cse1 .cse2 .cse3 .cse15 .cse16 .cse17 .cse9 .cse18 .cse11 .cse19)) (or .cse3 .cse1 .cse20 .cse21 .cse17 .cse22 .cse23 .cse24 .cse25 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse13 .cse1 .cse3 .cse15 .cse27 .cse23 .cse24 .cse4 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse28 .cse23 .cse4 .cse6) (or (= 0 ~p_dw_st~0) .cse3 .cse1 .cse20 .cse10 .cse22 .cse19 .cse0 .cse2 .cse6 .cse7 .cse8 .cse9 .cse11) (or .cse13 .cse1 .cse3 .cse23 .cse24 .cse4 .cse5 .cse20 .cse6 .cse7) (or .cse26 .cse0 .cse1 .cse3 .cse23 .cse16) (or .cse29 .cse3 .cse1 .cse15 .cse12 .cse30 .cse20 (not .cse7) .cse17 (= 0 ~q_write_ev~0) .cse19 .cse23 .cse16) (or .cse13 .cse1 .cse3 .cse23 .cse16 .cse24 .cse26 .cse7 .cse17) (or .cse3 .cse1 .cse15 .cse20 .cse17 .cse14 .cse13 .cse2 .cse26 .cse16 .cse24 .cse9 .cse18 .cse11) (or .cse13 .cse1 .cse3 .cse23 .cse20 .cse21 .cse25 .cse7 .cse17 .cse8 .cse19) (or .cse3 .cse1 .cse15 .cse17 .cse14 .cse13 .cse2 .cse26 .cse16 .cse24 .cse7 .cse9 .cse18 .cse11) (or .cse3 .cse1 .cse15 .cse27 .cse17 .cse14 .cse13 .cse2 .cse24 .cse4 .cse7 .cse9 .cse18 .cse11) (or .cse3 .cse1 .cse15 .cse20 .cse17 .cse14 .cse13 .cse2 .cse24 .cse4 .cse9 .cse18 .cse11 .cse27) (or .cse27 .cse13 .cse1 .cse3 .cse15 .cse23 .cse24 .cse4 .cse7 .cse17) (or .cse13 .cse1 .cse3 .cse23 .cse16 .cse24 .cse20 .cse17 .cse26) (or .cse29 .cse13 .cse1 .cse3 .cse15 .cse23 .cse24 .cse21 .cse30 .cse7 .cse17) (or .cse0 .cse1 .cse3 .cse23 .cse4 .cse31) (or .cse13 .cse1 .cse3 .cse23 .cse16 .cse24 .cse20 .cse6 .cse7 .cse26)))) [2018-11-18 16:00:23,617 INFO L421 ceAbstractionStarter]: At program point L305-2(lines 305 309) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse33 (+ ~c_num_read~0 1)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse30 (= activate_threads_~tmp~1 0)) (.cse12 (= 2 ~p_dw_st~0))) (let ((.cse6 (= ~p_dw_st~0 0)) (.cse24 (< 0 ~q_req_up~0)) (.cse19 (not (= 0 ~p_num_write~0))) (.cse27 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= |old(~p_dw_st~0)| 0))) (.cse25 (= 2 ~c_dr_st~0)) (.cse32 (and .cse16 .cse30 .cse12)) (.cse31 (and .cse16 .cse12)) (.cse26 (< ~p_num_write~0 ~c_num_read~0)) (.cse15 (< ~q_free~0 1)) (.cse18 (< 1 ~q_free~0)) (.cse28 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse29 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse21 (and .cse30 .cse12)) (.cse23 (not (= 1 ~p_num_write~0))) (.cse17 (not (= 0 ~c_num_read~0))) (.cse7 (< ~p_num_write~0 .cse33)) (.cse8 (< ~q_write_ev~0 2)) (.cse9 (not .cse0)) (.cse10 (= 1 ~q_req_up~0)) (.cse11 (< .cse33 ~p_num_write~0)) (.cse13 (= ~p_dw_pc~0 1)) (.cse14 (not (= |old(~p_dw_st~0)| 2))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_free~0 0))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse22 (not (= ~q_read_ev~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse15 .cse2 .cse4 (and .cse16 .cse6) .cse5 .cse13 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse4) (or .cse8 .cse1 .cse2 .cse3 .cse21 .cse22 .cse23 .cse13 .cse14 .cse17 .cse24) (or (and .cse25 .cse12) (and (and .cse6 .cse25) (= ~q_read_ev~0 1)) (or .cse8 .cse26 .cse1 .cse15 .cse2 .cse9 .cse27 .cse14 .cse18 .cse28 .cse20 .cse24)) (or .cse0 .cse1 .cse15 .cse2 .cse27 .cse25 .cse5 .cse13 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse1 .cse22 .cse19 .cse29 .cse24 .cse0 .cse15 .cse5 (and (= 0 ~p_dw_st~0) .cse30) .cse13 .cse17 .cse18 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse27 .cse25) (or (and .cse16 .cse6 .cse30) .cse8 .cse1 .cse2 .cse3 .cse10 .cse4 .cse22 .cse5 .cse13) (or .cse8 .cse1 .cse2 .cse3 .cse27 .cse10 .cse22 .cse25 .cse14) (or .cse8 .cse1 .cse2 .cse3 .cse27 .cse10 .cse25 .cse13 .cse14) (or .cse8 .cse1 .cse2 .cse31 .cse9 .cse3 .cse10 .cse4 .cse13 .cse14) (or .cse2 .cse1 .cse9 .cse22 .cse14 .cse26 .cse8 .cse15 .cse25 .cse27 .cse10 .cse18 .cse28 .cse20) (or .cse7 .cse2 .cse1 .cse9 .cse11 .cse22 (not .cse13) .cse14 (= 0 ~q_write_ev~0) .cse24 .cse3 .cse27 (and .cse25 .cse30 .cse12)) (or .cse1 .cse2 .cse22 .cse19 .cse30 .cse0 .cse15 .cse4 .cse5 .cse13 .cse17 .cse18 .cse20) (or .cse2 .cse1 .cse9 .cse25 .cse14 .cse26 .cse8 .cse15 .cse27 .cse10 .cse13 .cse18 .cse28 .cse20) (or .cse8 .cse1 .cse2 .cse3 .cse27 .cse10 .cse22 .cse5 .cse25 .cse13) (or .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse4 .cse22 .cse14 .cse32) (or .cse2 .cse1 .cse9 .cse32 .cse22 .cse14 .cse26 .cse8 .cse15 .cse10 .cse4 .cse18 .cse28 .cse20) (or .cse31 .cse2 .cse1 .cse9 .cse14 .cse26 .cse8 .cse15 .cse10 .cse4 .cse13 .cse18 .cse28 .cse20) (or .cse2 .cse1 .cse22 .cse14 .cse29 .cse3 .cse10 .cse21 .cse23 .cse13 .cse17) (or .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse11 .cse22 .cse13 .cse14 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse30)))) [2018-11-18 16:00:23,618 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 297 321) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse32 (+ ~c_num_read~0 1)) (.cse26 (= 2 ~c_dr_st~0)) (.cse21 (= 2 ~p_dw_st~0)) (.cse31 (not (= 0 ~c_dr_st~0))) (.cse28 (= ~p_dw_st~0 0))) (let ((.cse10 (not (= 0 ~p_num_write~0))) (.cse22 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (and .cse31 .cse28)) (.cse12 (and .cse26 .cse21)) (.cse25 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 0 ~c_num_read~0))) (.cse19 (< 0 ~q_req_up~0)) (.cse14 (< ~p_num_write~0 ~c_num_read~0)) (.cse2 (< ~q_free~0 1)) (.cse9 (< 1 ~q_free~0)) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (and .cse31 .cse21)) (.cse29 (< ~p_num_write~0 .cse32)) (.cse15 (not .cse0)) (.cse30 (< .cse32 ~p_num_write~0)) (.cse17 (not (= |old(~p_dw_st~0)| 2))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse13 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse23 (not (= ~q_free~0 0))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse24 (= 1 ~q_req_up~0)) (.cse20 (not (= ~q_read_ev~0 2))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse7 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 (or .cse13 .cse14 .cse1 .cse2 .cse3 .cse15 .cse16 .cse17 .cse9 .cse18 .cse11 .cse19)) (or .cse3 .cse1 .cse20 .cse21 .cse17 .cse22 .cse23 .cse24 .cse25 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse13 .cse1 .cse3 .cse15 .cse27 .cse23 .cse24 .cse4 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse28 .cse23 .cse4 .cse6) (or (= 0 ~p_dw_st~0) .cse3 .cse1 .cse20 .cse10 .cse22 .cse19 .cse0 .cse2 .cse6 .cse7 .cse8 .cse9 .cse11) (or .cse13 .cse1 .cse3 .cse23 .cse24 .cse4 .cse5 .cse20 .cse6 .cse7) (or .cse26 .cse0 .cse1 .cse3 .cse23 .cse16) (or .cse29 .cse3 .cse1 .cse15 .cse12 .cse30 .cse20 (not .cse7) .cse17 (= 0 ~q_write_ev~0) .cse19 .cse23 .cse16) (or .cse13 .cse1 .cse3 .cse23 .cse16 .cse24 .cse26 .cse7 .cse17) (or .cse3 .cse1 .cse15 .cse20 .cse17 .cse14 .cse13 .cse2 .cse26 .cse16 .cse24 .cse9 .cse18 .cse11) (or .cse13 .cse1 .cse3 .cse23 .cse20 .cse21 .cse25 .cse7 .cse17 .cse8 .cse19) (or .cse3 .cse1 .cse15 .cse17 .cse14 .cse13 .cse2 .cse26 .cse16 .cse24 .cse7 .cse9 .cse18 .cse11) (or .cse3 .cse1 .cse15 .cse27 .cse17 .cse14 .cse13 .cse2 .cse24 .cse4 .cse7 .cse9 .cse18 .cse11) (or .cse3 .cse1 .cse15 .cse20 .cse17 .cse14 .cse13 .cse2 .cse24 .cse4 .cse9 .cse18 .cse11 .cse27) (or .cse27 .cse13 .cse1 .cse3 .cse15 .cse23 .cse24 .cse4 .cse7 .cse17) (or .cse13 .cse1 .cse3 .cse23 .cse16 .cse24 .cse20 .cse17 .cse26) (or .cse29 .cse13 .cse1 .cse3 .cse15 .cse23 .cse24 .cse21 .cse30 .cse7 .cse17) (or .cse0 .cse1 .cse3 .cse23 .cse4 .cse31) (or .cse13 .cse1 .cse3 .cse23 .cse16 .cse24 .cse20 .cse6 .cse7 .cse26)))) [2018-11-18 16:00:23,618 INFO L425 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2018-11-18 16:00:23,618 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2018-11-18 16:00:23,618 INFO L421 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse8 (= ~p_dw_pc~0 1)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse5 (= 0 ~c_dr_st~0))) (let ((.cse4 (= 1 exists_runnable_thread_~__retres1~2)) (.cse11 (not (= 0 ~p_num_write~0))) (.cse18 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse21 (< 0 ~q_req_up~0)) (.cse9 (not (= 0 ~c_num_read~0))) (.cse7 (< ~q_free~0 1)) (.cse23 (not (= 2 ~c_dr_st~0))) (.cse6 (not (= ~p_dw_st~0 0))) (.cse10 (< 1 ~q_free~0)) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not .cse5)) (.cse20 (= exists_runnable_thread_~__retres1~2 1)) (.cse13 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse22 (not .cse0)) (.cse3 (not (= ~q_free~0 0))) (.cse14 (= 1 ~q_req_up~0)) (.cse15 (not (= ~q_read_ev~0 2))) (.cse16 (not .cse8)) (.cse17 (not (= ~p_dw_st~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse15 .cse6 .cse4 .cse8) (or .cse2 .cse1 .cse15 .cse16 .cse17 .cse18 .cse19 .cse0 .cse3 .cse20 (not (= 1 ~p_num_write~0)) .cse9) (or .cse2 .cse1 .cse15 .cse11 .cse18 .cse21 .cse0 .cse7 .cse6 .cse4 .cse8 .cse9 .cse10 .cse12) (or .cse2 .cse1 .cse22 .cse4 .cse15 .cse11 .cse18 .cse21 .cse7 .cse23 .cse6 .cse9 .cse10 .cse12) (or .cse20 (or .cse16 (or .cse2 .cse1 .cse22 .cse15 (< ~p_num_write~0 ~c_num_read~0) .cse13 .cse7 .cse23 .cse14 .cse6 .cse10 (< ~c_num_read~0 ~p_num_write~0) .cse12))) (or (and (<= ~q_req_up~0 0) .cse19) .cse20 (let ((.cse24 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse24) .cse13 .cse1 .cse2 .cse22 .cse3 .cse14 (< .cse24 ~p_num_write~0) .cse15 .cse16 .cse17)))))) [2018-11-18 16:00:23,618 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2018-11-18 16:00:23,618 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2018-11-18 16:00:23,618 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2018-11-18 16:00:23,618 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2018-11-18 16:00:23,618 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2018-11-18 16:00:23,618 INFO L421 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 21 40) the Hoare annotation is: (let ((.cse21 (= 1 ~c_dr_pc~0))) (let ((.cse5 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse22 (< ~q_free~0 1)) (.cse15 (not .cse21)) (.cse23 (< 1 ~q_free~0)) (.cse6 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse7 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse18 (and (and .cse6 .cse7) (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse0 (< |old(~q_write_ev~0)| 2)) (.cse1 (< ~p_num_write~0 ~c_num_read~0)) (.cse4 (not (= 2 ~c_dr_st~0))) (.cse8 (or .cse22 .cse15 .cse23)) (.cse17 (not (= |old(~q_read_ev~0)| 2))) (.cse10 (not (= ~p_dw_st~0 2))) (.cse11 (not (= 1 |old(~q_req_up~0)|))) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 0))) (.cse19 (= 0 ~c_dr_st~0)) (.cse20 (and .cse5 .cse7))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (or .cse4 (let ((.cse14 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse14) .cse2 .cse3 .cse15 .cse16 (< .cse14 ~p_num_write~0) .cse17)) .cse10 .cse11 (= 0 |old(~q_write_ev~0)|)) (not .cse9) .cse18) (or .cse18 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse17 .cse10 .cse11 .cse12 .cse13)) (or .cse2 .cse3 .cse19 .cse20 .cse9 (not (= 0 ~c_num_read~0)) (not (= 0 ~p_num_write~0)) (or .cse21 .cse22 (not (= ~p_dw_st~0 0)) .cse23) .cse13) (or .cse21 .cse2 .cse3 .cse16 .cse19 .cse20))))) [2018-11-18 16:00:23,618 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-11-18 16:00:23,618 INFO L425 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2018-11-18 16:00:23,618 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2018-11-18 16:00:23,618 INFO L425 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2018-11-18 16:00:23,619 INFO L425 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2018-11-18 16:00:23,619 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2018-11-18 16:00:23,619 INFO L425 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2018-11-18 16:00:23,619 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 279 296) the Hoare annotation is: (let ((.cse26 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse15 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse34 (+ ~c_num_read~0 1)) (.cse33 (= 1 ~c_dr_pc~0)) (.cse18 (not (= |old(~q_read_ev~0)| 2)))) (let ((.cse29 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse23 (not (= 1 ~p_num_write~0))) (.cse32 (or .cse33 .cse18 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (.cse24 (not (= 0 ~c_num_read~0))) (.cse30 (not (= 0 ~p_num_write~0))) (.cse25 (not (= |old(~q_read_ev~0)| 1))) (.cse27 (= ~q_read_ev~0 1)) (.cse14 (< ~p_num_write~0 .cse34)) (.cse17 (< .cse34 ~p_num_write~0)) (.cse19 (not .cse10)) (.cse31 (not (= ~p_dw_st~0 0))) (.cse21 (not (= ~q_free~0 0))) (.cse28 (= ~q_read_ev~0 |old(~q_read_ev~0)|)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse22 (not (= 2 ~c_dr_st~0))) (.cse20 (< 0 ~q_req_up~0)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not .cse33)) (.cse4 (not (= ~p_dw_st~0 2))) (.cse5 (< ~p_num_write~0 ~c_num_read~0)) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse7 (< ~q_free~0 1)) (.cse8 (= 1 ~q_req_up~0)) (.cse9 (= 0 ~c_dr_st~0)) (.cse11 (< 1 ~q_free~0)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (and .cse26 .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse0 .cse1 (and .cse15 .cse16) .cse17 .cse18 .cse19 .cse4 (= 0 |old(~q_write_ev~0)|) .cse20 .cse21 .cse22) (or .cse6 .cse1 .cse0 .cse21 .cse18 .cse3 .cse23 .cse10 .cse4 .cse24 .cse20) (or .cse3 .cse6 .cse1 .cse0 .cse21 .cse8 .cse9 .cse10 .cse4) (or (or .cse6 .cse5 .cse1 .cse7 .cse0 .cse2 .cse8 .cse9 .cse4 .cse11 .cse12 .cse13) .cse25 (and .cse26 .cse27)) (or .cse0 .cse1 (and .cse28 .cse29) .cse30 .cse20 .cse7 .cse31 .cse10 .cse24 .cse11 .cse32 .cse13) (or .cse14 .cse6 .cse1 .cse0 .cse2 .cse21 .cse8 .cse3 .cse17 .cse10 .cse4) (or .cse1 .cse0 .cse4 (and .cse15 .cse29) .cse21 .cse8 .cse23 .cse10 .cse24 .cse32) (or .cse33 .cse1 .cse7 .cse0 .cse9 .cse3 .cse31 .cse10 .cse24 .cse11 .cse30 .cse13) (or .cse33 .cse1 .cse0 .cse21 .cse9 .cse3) (or (or (or .cse6 .cse5 .cse1 .cse7 .cse0 .cse2 .cse22 .cse8 .cse31 .cse11 .cse12 .cse13) .cse19) .cse25 (and .cse16 .cse27)) (or .cse14 .cse0 .cse1 .cse2 .cse17 .cse18 .cse19 .cse4 .cse20 .cse21 (not (= 1 |old(~q_write_ev~0)|)) (and .cse15 (= 1 ~q_write_ev~0))) (or .cse6 .cse1 .cse0 .cse21 .cse8 .cse9 .cse3 .cse18 .cse31 .cse10) (or .cse6 .cse1 .cse0 .cse3 .cse21 .cse8 .cse9 .cse18 .cse4) (or (and .cse28 .cse16) (or .cse6 .cse5 .cse1 .cse7 .cse0 .cse2 .cse22 .cse4 .cse11 .cse12 .cse13 .cse20)) (or .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse3)))) [2018-11-18 16:00:23,619 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2018-11-18 16:00:23,619 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 223 240) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= ~q_read_ev~0 2)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (< 0 ~q_req_up~0) (= 1 ~c_dr_pc~0) (< ~q_free~0 1) (= ~p_dw_st~0 0) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_pc~0 1) (not (= 0 ~c_num_read~0)) (< 1 ~q_free~0) (not (= ~c_last_read~0 ~p_last_write~0))) [2018-11-18 16:00:23,619 INFO L425 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2018-11-18 16:00:23,619 INFO L425 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2018-11-18 16:00:23,619 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 455 466) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-11-18 16:00:23,619 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-18 16:00:23,619 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2018-11-18 16:00:23,619 INFO L421 ceAbstractionStarter]: At program point L460(line 460) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-11-18 16:00:23,620 INFO L421 ceAbstractionStarter]: At program point L460-1(line 460) the Hoare annotation is: (or (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= 2 ~q_read_ev~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (not (= ~p_dw_pc~0 1)) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-11-18 16:00:23,620 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2018-11-18 16:00:23,620 INFO L421 ceAbstractionStarter]: At program point do_write_pENTRY(lines 114 153) the Hoare annotation is: (let ((.cse7 (= 1 ~c_dr_pc~0))) (let ((.cse5 (< 0 |old(~q_req_up~0)|)) (.cse26 (not (= 2 ~c_dr_st~0))) (.cse13 (<= 1 ~q_free~0)) (.cse18 (<= ~q_free~0 1)) (.cse20 (= 0 ~p_num_write~0)) (.cse6 (= |old(~p_dw_st~0)| 0)) (.cse24 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse15 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (= ~q_free~0 0)) (.cse14 (not (= 0 ~p_dw_st~0))) (.cse17 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse27 (< ~q_write_ev~0 2)) (.cse25 (not .cse7)) (.cse21 (not (= |old(~q_free~0)| 0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~q_read_ev~0 2))) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (< |old(~q_free~0)| 1)) (.cse22 (= 0 ~c_dr_st~0)) (.cse9 (= |old(~p_dw_pc~0)| 1)) (.cse10 (not (= 0 ~c_num_read~0))) (.cse11 (< 1 |old(~q_free~0)|)) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse7 .cse1 .cse0 .cse21 .cse22 (and .cse23 .cse24 .cse15 .cse16)) (or (or .cse1 .cse8 .cse0 .cse25 .cse11) .cse2 .cse3 .cse4 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) .cse5 .cse6 .cse26 .cse10) (or .cse27 (not .cse9) (and .cse14 .cse17 (and .cse24 .cse15 .cse18 .cse16 .cse13)) (or .cse6 .cse26 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse0 .cse8 .cse25 .cse2 .cse11) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse22 (or .cse7 .cse1 .cse0 .cse8 .cse9 .cse11) .cse10 (and .cse15 .cse16 .cse13 .cse18 .cse20) .cse3) (or .cse6 (and .cse24 .cse15 .cse16 .cse23 .cse14 .cse17) .cse27 .cse1 .cse0 .cse25 .cse21 (= 1 |old(~q_req_up~0)|) .cse22 .cse2 .cse9) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 16:00:23,620 INFO L421 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= 1 ~c_dr_pc~0))) (let ((.cse12 (not .cse20)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse16 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse17 (< 0 |old(~q_req_up~0)|)) (.cse0 (not (= 0 ~p_dw_st~0))) (.cse1 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse2 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse7 (= |old(~p_dw_st~0)| 0)) (.cse5 (< ~q_write_ev~0 2)) (.cse22 (not (= |old(~q_free~0)| 0))) (.cse13 (not (= ~q_read_ev~0 2))) (.cse21 (and .cse3 .cse4)) (.cse19 (= 0 ~p_num_write~0)) (.cse23 (= 0 ~c_dr_st~0)) (.cse9 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse11 (< |old(~q_free~0)| 1)) (.cse6 (= |old(~p_dw_pc~0)| 1)) (.cse14 (< 1 |old(~q_free~0)|)) (.cse18 (not (= 0 ~c_num_read~0))) (.cse15 (not (= 0 |old(~p_num_write~0)|)))) (and (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4)) .cse5 (not .cse6) (or .cse7 .cse8 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or (or .cse9 .cse11 .cse10 .cse12 .cse14) .cse13 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18 (and .cse3 .cse4 .cse0 .cse1 .cse19)) (or .cse10 .cse9 .cse13 .cse15 .cse16 .cse17 .cse7 .cse20 .cse11 (and .cse0 .cse1 .cse21 .cse19) .cse6 .cse18 .cse14 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (or .cse20 .cse9 .cse10 .cse22 (and (= ~q_free~0 0) (= 1 |old(~p_dw_pc~0)|) .cse2 .cse3 .cse4) .cse23) (or .cse7 .cse5 .cse9 .cse10 .cse22 (= 1 |old(~q_req_up~0)|) .cse23 .cse13 .cse6) (or (and .cse21 .cse19) .cse23 (or .cse20 .cse9 .cse10 .cse11 .cse6 .cse14) .cse18 .cse15)))) [2018-11-18 16:00:23,620 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 147) no Hoare annotation was computed. [2018-11-18 16:00:23,620 INFO L421 ceAbstractionStarter]: At program point L129-2(lines 117 152) the Hoare annotation is: (let ((.cse5 (= 1 ~c_dr_pc~0)) (.cse30 (+ |old(~p_num_write~0)| 1)) (.cse0 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 0)) (.cse19 (not (= 0 ~p_dw_st~0))) (.cse3 (= 1 ~p_num_write~0))) (let ((.cse21 (< 0 |old(~q_req_up~0)|)) (.cse24 (and .cse0 .cse1 .cse2 .cse19 .cse3)) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~q_free~0 1)) (.cse14 (= 0 ~p_num_write~0)) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse18 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (not (= 0 ~c_num_read~0))) (.cse25 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse29 (<= .cse30 ~p_num_write~0)) (.cse23 (not (= 2 ~c_dr_st~0))) (.cse8 (< |old(~q_free~0)| 1)) (.cse10 (< 1 |old(~q_free~0)|)) (.cse22 (= |old(~p_dw_st~0)| 0)) (.cse28 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse20 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse31 (< ~q_write_ev~0 2)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse16 (not .cse5)) (.cse27 (not (= |old(~q_free~0)| 0))) (.cse4 (= 0 ~c_dr_st~0)) (.cse17 (not (= ~q_read_ev~0 2))) (.cse9 (= |old(~p_dw_pc~0)| 1))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 (and .cse0 .cse1 .cse12 .cse13 .cse14) .cse15) (or (or .cse6 .cse8 .cse7 .cse16 .cse10) .cse17 .cse15 .cse18 (and .cse12 .cse19 .cse0 .cse1 .cse20 .cse13 .cse14) .cse21 .cse22 .cse23 .cse11 .cse24) (or .cse7 .cse6 .cse17 .cse15 .cse18 .cse21 .cse22 .cse5 .cse8 .cse9 .cse11 .cse10 .cse25 .cse24 (and .cse12 .cse19 .cse0 .cse1 .cse20 .cse13 .cse26 .cse14)) (or .cse3 .cse7 .cse6 .cse17 .cse26 .cse15 .cse18 .cse5 .cse8 .cse4 .cse9 .cse11 .cse10 .cse25) (or .cse5 .cse6 .cse7 .cse27 .cse4 (and .cse2 .cse28 .cse0 (not (= ~p_dw_pc~0 1)) .cse1) (and .cse2 (= 1 |old(~p_dw_pc~0)|) .cse0 .cse1 .cse29 (<= ~p_num_write~0 .cse30))) (or .cse31 (and .cse1 .cse29 (= 1 ~p_dw_pc~0) .cse2 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not .cse9) (or .cse22 .cse23 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse6 .cse7 .cse8 .cse16 .cse17 .cse10) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse22 (and .cse28 .cse0 .cse1 .cse2 .cse19 .cse20) .cse31 .cse6 .cse7 .cse16 .cse27 (= 1 |old(~q_req_up~0)|) .cse4 .cse17 .cse9)))) [2018-11-18 16:00:23,620 INFO L425 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2018-11-18 16:00:23,620 INFO L425 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2018-11-18 16:00:23,621 INFO L421 ceAbstractionStarter]: At program point L148(lines 114 153) the Hoare annotation is: (let ((.cse28 (+ |old(~p_num_write~0)| 1))) (let ((.cse24 (= 1 ~p_dw_pc~0)) (.cse22 (= 2 ~p_dw_st~0)) (.cse10 (= 1 ~p_num_write~0)) (.cse9 (= ~q_free~0 0)) (.cse26 (= 1 |old(~p_dw_pc~0)|)) (.cse0 (= 0 ~c_dr_st~0)) (.cse27 (= ~p_dw_i~0 1)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (<= .cse28 ~p_num_write~0)) (.cse1 (= 1 ~c_dr_pc~0))) (let ((.cse19 (< ~q_write_ev~0 2)) (.cse18 (not (= 2 ~c_dr_st~0))) (.cse13 (not .cse1)) (.cse20 (not (= |old(~q_free~0)| 0))) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse25 (and .cse9 (not (= ~c_dr_pc~0 1)) .cse26 (not .cse0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse27 .cse11 .cse23 (<= ~p_num_write~0 .cse28))) (.cse3 (not .cse27)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse14 (not (= ~q_read_ev~0 2))) (.cse8 (not (= 0 |old(~p_num_write~0)|))) (.cse15 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse16 (< 0 |old(~q_req_up~0)|)) (.cse17 (= |old(~p_dw_st~0)| 0)) (.cse4 (< |old(~q_free~0)| 1)) (.cse5 (= |old(~p_dw_pc~0)| 1)) (.cse7 (not (= 0 ~c_num_read~0))) (.cse6 (< 1 |old(~q_free~0)|)) (.cse12 (and .cse11 .cse24 .cse9 .cse22 .cse10))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 (and .cse9 .cse10 .cse11)) (or .cse12 (or .cse2 .cse4 .cse3 .cse13 .cse6) .cse14 .cse8 .cse15 .cse16 .cse17 .cse18 .cse7) (or .cse17 .cse19 .cse2 .cse3 .cse13 .cse20 (= 1 |old(~q_req_up~0)|) (and .cse21 .cse11 .cse9 .cse22 (= |old(~q_req_up~0)| ~q_req_up~0)) .cse0 .cse14 .cse5) (or .cse19 (not .cse5) (and .cse11 .cse23 .cse24 .cse9 .cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (or .cse17 .cse18 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse2 .cse3 .cse4 .cse13 .cse14 .cse6) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse1 .cse2 .cse3 .cse20 .cse0 .cse25 (not .cse26)) (or .cse1 .cse2 .cse3 .cse20 .cse0 (and .cse9 .cse21 .cse11) .cse25) (or .cse3 .cse2 .cse14 .cse8 .cse15 .cse16 .cse17 .cse1 .cse4 .cse5 .cse7 .cse6 .cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|))))))) [2018-11-18 16:00:23,621 INFO L425 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2018-11-18 16:00:23,621 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-18 16:00:23,621 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-18 16:00:23,621 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-18 16:00:23,621 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-18 16:00:23,621 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 101) no Hoare annotation was computed. [2018-11-18 16:00:23,621 INFO L425 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-11-18 16:00:23,621 INFO L425 ceAbstractionStarter]: For program point L97-2(lines 97 101) no Hoare annotation was computed. [2018-11-18 16:00:23,621 INFO L425 ceAbstractionStarter]: For program point L95-1(line 95) no Hoare annotation was computed. [2018-11-18 16:00:23,621 INFO L425 ceAbstractionStarter]: For program point immediate_notify_threadsENTRY(lines 89 113) no Hoare annotation was computed. [2018-11-18 16:00:23,621 INFO L425 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 89 113) no Hoare annotation was computed. [2018-11-18 16:00:23,622 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 109) no Hoare annotation was computed. [2018-11-18 16:00:23,622 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-18 16:00:23,622 INFO L425 ceAbstractionStarter]: For program point L105-2(lines 89 113) no Hoare annotation was computed. [2018-11-18 16:00:23,622 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:00:23,622 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p_num_write~0 |old(~p_num_write~0)|) (= |old(~q_req_up~0)| ~q_req_up~0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) [2018-11-18 16:00:23,622 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:00:23,623 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 322 375) the Hoare annotation is: (let ((.cse45 (not (= ~c_dr_pc~0 1))) (.cse39 (= ~c_num_read~0 0)) (.cse31 (= 1 |old(~c_dr_pc~0)|)) (.cse12 (= |old(~p_dw_pc~0)| 1)) (.cse50 (+ ~c_num_read~0 1)) (.cse51 (+ |old(~c_num_read~0)| 1)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= 1 ~q_free~0)) (.cse18 (<= ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse35 (not (= 0 ~c_dr_st~0))) (.cse36 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse15 (= 1 ~c_dr_pc~0)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse38 (= ~q_free~0 0)) (.cse19 (= 2 ~p_dw_st~0)) (.cse20 (= |old(~q_req_up~0)| ~q_req_up~0))) (let ((.cse9 (and .cse14 .cse35 .cse36 .cse15 .cse16 .cse38 .cse19 .cse20)) (.cse46 (= 0 ~p_num_write~0)) (.cse34 (not (= 0 |old(~p_num_write~0)|))) (.cse48 (and .cse13 .cse14 .cse35 .cse36 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)) (.cse41 (< |old(~p_num_write~0)| .cse51)) (.cse44 (< .cse51 |old(~p_num_write~0)|)) (.cse42 (<= .cse50 ~p_num_write~0)) (.cse43 (<= ~p_num_write~0 .cse50)) (.cse47 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse24 (not .cse12)) (.cse10 (not .cse31)) (.cse25 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse26 (< |old(~q_free~0)| 1)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse32 (not (= |old(~p_dw_st~0)| 0))) (.cse27 (< 1 |old(~q_free~0)|)) (.cse28 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse29 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse37 (= ~p_dw_st~0 0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse23 (= 1 ~p_dw_pc~0)) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse6 (not (= ~q_read_ev~0 2))) (.cse49 (and .cse45 .cse36 .cse16 .cse39 .cse38 .cse19 .cse20 (= 1 ~p_num_write~0))) (.cse40 (not (= 1 |old(~p_num_write~0)|))) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse33 (not (= 0 |old(~c_num_read~0)|))) (.cse30 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 .cse12 .cse7) (or (and (and .cse13 .cse14 .cse8 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23) .cse24 (or .cse0 .cse25 .cse1 .cse26 .cse2 .cse10 .cse4 .cse7 .cse27 .cse28 .cse29 .cse30)) (or .cse31 .cse1 .cse26 .cse2 .cse4 .cse8 .cse32 .cse12 .cse33 .cse27 .cse34 .cse29) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 (and .cse14 .cse35 .cse36 .cse37 .cse15 .cse16 .cse38 .cse20) .cse6 .cse32 .cse12) (or .cse31 .cse1 .cse2 .cse3 .cse39 .cse11 .cse40 .cse33) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse25 .cse0 .cse26 .cse8 .cse4 .cse5 .cse27 .cse28 .cse29) (or .cse41 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 (and .cse42 .cse14 .cse36 .cse15 .cse16 .cse38 .cse19 .cse20 .cse43) .cse44 .cse12 .cse7) (or .cse41 .cse2 .cse1 .cse10 (and .cse42 .cse14 .cse8 .cse15 .cse16 .cse23 .cse38 .cse19 .cse20 .cse43) .cse44 .cse6 .cse24 .cse7 (= 0 ~q_write_ev~0) .cse30 .cse3 .cse4) (or (and .cse17 .cse45 .cse36 (= 0 ~p_dw_st~0) .cse16 .cse39 .cse20 .cse21 .cse22 .cse46) .cse2 .cse1 .cse6 .cse34 .cse47 .cse30 .cse31 .cse26 .cse32 .cse12 .cse33 .cse27 .cse29) (or .cse0 .cse1 .cse2 .cse10 .cse9 .cse3 .cse5 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse12 .cse7) (or .cse31 .cse1 .cse26 .cse2 .cse11 (and .cse45 .cse35 .cse36 .cse37 .cse16 .cse17 .cse39 .cse21 .cse22 .cse46) .cse32 .cse12 .cse33 .cse27 .cse34 .cse29) (or .cse31 .cse1 .cse2 .cse37 .cse3 .cse11 .cse32) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse25 .cse0 .cse26 .cse5 .cse11 .cse27 .cse28 .cse29 .cse48) (or .cse41 .cse1 .cse2 .cse10 (and .cse42 .cse43) .cse44 .cse6 .cse0 .cse3 .cse5 .cse11 .cse32 .cse12) (or .cse2 .cse1 .cse10 .cse7 .cse25 .cse0 .cse26 .cse8 .cse4 .cse5 .cse12 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse32 .cse12 .cse8) (or .cse2 .cse1 .cse10 .cse48 .cse7 .cse25 .cse0 .cse26 .cse5 .cse11 .cse12 .cse27 .cse28 .cse29) (or .cse8 .cse31 .cse1 .cse2 .cse3 .cse4) (or (or .cse41 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse44 .cse6 .cse24 .cse7) (and .cse42 .cse14 .cse15 .cse16 .cse23 .cse38 .cse19 .cse20 .cse43)) (or .cse2 .cse1 .cse6 .cse49 .cse7 .cse47 .cse31 .cse3 .cse5 .cse40 .cse12 .cse33) (or .cse31 .cse1 .cse2 .cse3 .cse11 (and .cse38 .cse45 .cse14 .cse35 .cse36 .cse16)) (or (or .cse24 (or .cse2 .cse1 .cse10 .cse6 .cse25 .cse0 .cse26 .cse4 .cse5 .cse32 .cse27 .cse28 .cse29)) (and (and .cse13 .cse14 .cse37 .cse8 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) .cse23)) (or .cse31 .cse0 .cse1 .cse2 .cse3 .cse6 .cse49 .cse40 .cse12 .cse7 .cse33 .cse30)))) [2018-11-18 16:00:23,623 INFO L425 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2018-11-18 16:00:23,623 INFO L425 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2018-11-18 16:00:23,623 INFO L421 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse34 (= 1 |old(~c_dr_pc~0)|)) (.cse54 (= ~p_dw_st~0 0)) (.cse12 (= |old(~p_dw_pc~0)| 1)) (.cse56 (+ |old(~c_num_read~0)| 1)) (.cse57 (+ ~c_num_read~0 1)) (.cse8 (= 2 ~c_dr_st~0)) (.cse29 (= ~c_num_read~0 1)) (.cse21 (= ~c_num_read~0 0)) (.cse24 (= 1 ~p_num_write~0)) (.cse51 (not (= ~c_dr_pc~0 1))) (.cse22 (= ~q_free~0 0)) (.cse55 (= ~p_dw_i~0 1)) (.cse58 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse45 (<= ~p_num_write~0 ~c_num_read~0)) (.cse40 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse52 (not (= 0 ~c_dr_st~0))) (.cse41 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse31 (= 1 ~c_dr_pc~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse30 (<= 1 ~q_free~0)) (.cse46 (<= ~c_num_read~0 ~p_num_write~0)) (.cse23 (= 2 ~p_dw_st~0)) (.cse42 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse32 (<= ~q_free~0 1)) (.cse33 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse18 (and .cse45 .cse40 .cse52 .cse41 .cse31 .cse19 .cse30 .cse46 .cse23 .cse42 .cse32 .cse33)) (.cse26 (not .cse58)) (.cse27 (and .cse51 .cse52 .cse19 (= 2 ~q_read_ev~0) .cse22 .cse58 .cse55)) (.cse48 (and .cse51 .cse41 .cse19 .cse21 .cse22 .cse23 .cse42 .cse24)) (.cse50 (not (= 1 |old(~p_num_write~0)|))) (.cse49 (and .cse41 .cse8 .cse31 .cse19 .cse29 .cse30 .cse23 .cse32 .cse24 .cse33)) (.cse28 (< 0 |old(~q_req_up~0)|)) (.cse13 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse16 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse20 (= 1 ~p_dw_pc~0)) (.cse39 (<= .cse57 ~p_num_write~0)) (.cse43 (<= ~p_num_write~0 .cse57)) (.cse38 (< |old(~p_num_write~0)| .cse56)) (.cse44 (< .cse56 |old(~p_num_write~0)|)) (.cse47 (not .cse12)) (.cse53 (and .cse22 .cse51 .cse52 .cse55 .cse19)) (.cse35 (and .cse51 .cse52 .cse41 .cse54 .cse19 .cse30 .cse21 .cse32 .cse33 (= 0 ~p_num_write~0))) (.cse9 (and .cse40 .cse52 .cse41 .cse31 .cse19 .cse22 .cse23 .cse42)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse25 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (< |old(~q_free~0)| 1)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse37 (not (= 0 |old(~c_num_read~0)|))) (.cse15 (< 1 |old(~q_free~0)|)) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse55)) (.cse10 (not .cse34)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse36 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 .cse12 .cse7) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse13 .cse0 .cse14 .cse5 .cse11 .cse15 .cse16 .cse17 .cse18) (or (and .cse8 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse2 .cse1 .cse6 .cse25 .cse26 .cse27 .cse28 (and .cse8 .cse29 .cse30 .cse31 .cse19 .cse20 .cse23 .cse32 .cse24 .cse33) .cse34 .cse14 .cse35 .cse36 .cse12 .cse37 .cse15 .cse17) (or .cse38 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 (and .cse39 .cse40 .cse41 .cse31 .cse19 .cse22 .cse23 .cse42 .cse43) .cse44 .cse12 .cse7 (and .cse45 .cse40 .cse41 .cse8 .cse31 .cse19 .cse30 .cse46 .cse23 .cse32 .cse33)) (or (and (and .cse45 .cse40 .cse8 .cse31 .cse19 .cse30 .cse46 .cse23 .cse42 .cse32 .cse33) .cse20) .cse47 (or .cse0 .cse13 .cse1 .cse14 .cse2 .cse10 .cse4 .cse7 .cse15 .cse16 .cse17 .cse28)) (or .cse38 .cse1 .cse2 .cse10 (and .cse39 .cse43) .cse44 .cse6 .cse0 .cse3 .cse5 .cse11 .cse36 .cse12) (or .cse2 .cse1 .cse10 .cse7 .cse13 .cse0 .cse14 .cse8 .cse4 .cse5 .cse12 .cse15 .cse16 .cse17) (or .cse34 .cse1 .cse2 .cse3 .cse4 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse36 .cse12 .cse8) (or .cse2 .cse1 .cse10 .cse18 .cse7 .cse13 .cse0 .cse14 .cse5 .cse11 .cse12 .cse15 .cse16 .cse17) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse13 .cse0 .cse14 .cse8 .cse4 .cse5 .cse15 .cse16 .cse17) (or .cse2 .cse1 .cse6 .cse48 .cse7 .cse26 .cse27 .cse34 .cse3 .cse5 .cse49 .cse50 .cse12 .cse37) (or .cse1 .cse2 .cse6 .cse48 .cse7 .cse28 .cse34 .cse0 .cse3 .cse50 .cse12 .cse37 .cse49 (and .cse22 .cse51 .cse52 .cse19)) (or .cse53 .cse34 .cse1 .cse2 .cse3 .cse11) (or .cse38 .cse2 .cse1 .cse10 (and .cse39 .cse40 .cse8 .cse31 .cse19 .cse20 .cse22 .cse23 .cse42 .cse43) .cse44 .cse6 .cse47 .cse7 (= 0 ~q_write_ev~0) .cse28 .cse3 .cse4) (or (and .cse39 .cse8 .cse31 .cse19 .cse20 .cse22 .cse23 .cse43) (or .cse47 (or .cse2 .cse1 .cse10 .cse6 .cse13 .cse0 .cse14 .cse4 .cse5 .cse36 .cse15 .cse16 .cse17))) (or (and .cse45 .cse40 .cse8 .cse31 .cse19 .cse20 .cse30 .cse46 .cse23 .cse32 .cse33) (and (<= ~q_req_up~0 0) .cse39 .cse40 .cse52 .cse41 .cse31 .cse19 .cse22 .cse23 .cse42 .cse43) (or .cse38 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse44 .cse6 .cse47 .cse7)) (or .cse1 .cse2 .cse25 .cse53 .cse34 .cse14 .cse11 .cse35 .cse36 .cse12 .cse37 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse10 .cse9 .cse3 .cse5 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse12 .cse7) (or .cse1 .cse2 .cse25 .cse34 .cse14 .cse4 .cse8 .cse36 .cse12 .cse37 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 (and .cse40 .cse52 .cse31 .cse19 .cse22 .cse23 .cse42) .cse11 (and .cse40 .cse52 .cse41 .cse54 .cse31 .cse19 .cse22 .cse42) .cse6 .cse36 .cse12)))) [2018-11-18 16:00:23,623 INFO L425 ceAbstractionStarter]: For program point L329-1(lines 329 369) no Hoare annotation was computed. [2018-11-18 16:00:23,624 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2018-11-18 16:00:23,624 INFO L421 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse22 (= 1 |old(~c_dr_pc~0)|)) (.cse53 (= ~p_dw_st~0 0)) (.cse18 (= 0 ~p_num_write~0)) (.cse29 (= |old(~p_dw_pc~0)| 1)) (.cse60 (+ |old(~c_num_read~0)| 1)) (.cse61 (+ ~c_num_read~0 1)) (.cse8 (= 2 ~c_dr_st~0)) (.cse36 (= ~c_num_read~0 1)) (.cse14 (= ~c_num_read~0 0)) (.cse28 (= 1 ~p_num_write~0)) (.cse10 (not (= ~c_dr_pc~0 1))) (.cse25 (= ~q_free~0 0)) (.cse59 (= ~p_dw_i~0 1)) (.cse62 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse50 (<= ~p_num_write~0 ~c_num_read~0)) (.cse47 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse57 (not (= 0 ~c_dr_st~0))) (.cse11 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse35 (= 1 ~c_dr_pc~0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 1 ~q_free~0)) (.cse51 (<= ~c_num_read~0 ~p_num_write~0)) (.cse26 (= 2 ~p_dw_st~0)) (.cse15 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse16 (<= ~q_free~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse44 (and .cse50 .cse47 .cse57 .cse11 .cse35 .cse13 .cse9 .cse51 .cse26 .cse15 .cse16 .cse17)) (.cse42 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse43 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse34 (not .cse62)) (.cse19 (and .cse10 .cse57 .cse13 (= 2 ~q_read_ev~0) .cse25 .cse62 .cse59)) (.cse54 (and .cse10 .cse11 .cse13 .cse14 .cse25 .cse26 .cse15 .cse28)) (.cse20 (< 0 |old(~q_req_up~0)|)) (.cse56 (not (= 1 |old(~p_num_write~0)|))) (.cse55 (and .cse11 .cse8 .cse35 .cse13 .cse36 .cse9 .cse26 .cse16 .cse28 .cse17)) (.cse27 (not (= 0 eval_~tmp___1~0))) (.cse46 (<= .cse61 ~p_num_write~0)) (.cse24 (= 1 ~p_dw_pc~0)) (.cse48 (<= ~p_num_write~0 .cse61)) (.cse45 (< |old(~p_num_write~0)| .cse60)) (.cse49 (< .cse60 |old(~p_num_write~0)|)) (.cse52 (not .cse29)) (.cse58 (and .cse25 .cse10 .cse57 .cse59 .cse13)) (.cse37 (and .cse10 .cse57 .cse11 .cse53 .cse13 .cse9 .cse14 .cse16 .cse17 .cse18)) (.cse39 (and .cse47 .cse57 .cse11 .cse35 .cse13 .cse25 .cse26 .cse15)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse33 (not (= 0 |old(~p_num_write~0)|))) (.cse23 (< |old(~q_free~0)| 1)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse30 (not (= 0 |old(~c_num_read~0)|))) (.cse31 (< 1 |old(~q_free~0)|)) (.cse32 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse59)) (.cse40 (not .cse22)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse41 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse38 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse12 (= 0 ~p_dw_st~0)) (.cse21 (= eval_~tmp___1~0 1))) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse2 .cse19 .cse20 (and .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse22 .cse23 (and .cse8 .cse13 .cse24 .cse14 .cse25 .cse26 .cse27 .cse28) .cse29 .cse30 .cse31 (and .cse10 .cse21 .cse13 .cse24 .cse14 .cse25 .cse26 .cse28) .cse32 .cse1 .cse6 .cse33 .cse34 (and .cse8 .cse35 .cse13 .cse36 .cse24 .cse9 .cse26 .cse16 .cse27 .cse28 .cse17) .cse37 .cse38)) (or .cse39 .cse0 .cse1 .cse2 .cse40 .cse3 .cse5 .cse41 .cse29 .cse7) (or .cse2 .cse1 .cse40 .cse6 .cse7 .cse42 .cse0 .cse23 .cse5 .cse41 .cse31 .cse43 .cse32 .cse44) (or .cse45 .cse0 .cse1 .cse2 .cse40 .cse3 .cse5 (and .cse46 .cse47 .cse11 .cse35 .cse13 .cse25 .cse26 .cse15 .cse48) .cse49 .cse29 .cse7 (and .cse50 .cse47 .cse11 .cse8 .cse35 .cse13 .cse9 .cse51 .cse26 .cse16 .cse17)) (or (and (and .cse50 .cse47 .cse8 .cse35 .cse13 .cse9 .cse51 .cse26 .cse15 .cse16 .cse17) .cse24) .cse52 (or .cse0 .cse42 .cse1 .cse23 .cse2 .cse40 .cse4 .cse7 .cse31 .cse43 .cse32 .cse20)) (or .cse45 .cse1 .cse2 .cse40 (and .cse46 .cse48) .cse49 .cse6 .cse0 .cse3 .cse5 .cse41 .cse38 .cse29) (or .cse45 .cse2 .cse1 .cse40 .cse49 .cse6 .cse52 .cse7 (= 0 ~q_write_ev~0) .cse20 (and .cse46 .cse47 .cse8 .cse35 .cse13 .cse24 .cse25 .cse26 .cse15 .cse48) .cse3 .cse4) (or .cse2 .cse1 .cse40 .cse7 .cse42 .cse0 .cse23 .cse8 .cse4 .cse5 .cse29 .cse31 .cse43 .cse32) (or (and .cse46 .cse8 .cse35 .cse13 .cse24 .cse25 .cse26 .cse27 .cse48) (or .cse52 (or .cse2 .cse1 .cse40 .cse6 .cse42 .cse0 .cse23 .cse4 .cse5 .cse38 .cse31 .cse43 .cse32)) (and (and .cse50 .cse47 .cse53 .cse8 .cse35 .cse13 .cse9 .cse51 .cse15 .cse16 .cse17) .cse24)) (or .cse22 .cse1 .cse2 .cse3 .cse4 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse38 .cse29 .cse8) (or .cse2 .cse1 .cse40 .cse44 .cse7 .cse42 .cse0 .cse23 .cse5 .cse41 .cse29 .cse31 .cse43 .cse32) (or .cse2 .cse1 .cse40 .cse6 .cse7 .cse42 .cse0 .cse23 .cse8 .cse4 .cse5 .cse31 .cse43 .cse32) (or .cse2 .cse1 .cse6 .cse54 .cse7 .cse34 .cse19 .cse22 .cse3 .cse5 .cse55 .cse56 .cse29 .cse30) (or .cse1 .cse2 .cse6 .cse54 .cse7 .cse20 .cse22 .cse0 .cse3 .cse56 .cse29 .cse30 .cse55 (and .cse25 .cse10 .cse57 .cse13)) (or .cse58 .cse22 .cse1 .cse2 .cse3 .cse41) (or (and .cse50 .cse47 .cse8 .cse35 .cse13 .cse24 .cse9 .cse51 .cse26 .cse16 .cse27 .cse17) (and .cse46 .cse47 .cse35 .cse13 .cse24 .cse25 .cse26 .cse15 .cse48) (or .cse45 .cse0 .cse1 .cse2 .cse40 .cse3 .cse5 .cse49 .cse6 .cse52 .cse7)) (or .cse1 .cse2 .cse33 .cse58 .cse22 .cse23 .cse41 .cse37 .cse38 .cse29 .cse30 .cse31 .cse32) (or .cse0 .cse1 .cse2 .cse40 .cse39 .cse3 .cse5 .cse41 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse29 .cse7) (or .cse1 .cse2 .cse33 .cse22 .cse23 .cse4 .cse8 .cse38 .cse29 .cse30 .cse31 .cse32) (or .cse0 .cse1 .cse2 .cse40 .cse3 .cse5 (and .cse47 .cse57 .cse35 .cse13 .cse25 .cse26 .cse15) .cse41 (and .cse47 .cse57 .cse11 .cse53 .cse35 .cse13 .cse25 .cse15) .cse6 .cse38 .cse29)))) [2018-11-18 16:00:23,624 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2018-11-18 16:00:23,625 INFO L421 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse47 (+ |old(~c_num_read~0)| 1)) (.cse49 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse24 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse48 (= 2 ~q_read_ev~0)) (.cse26 (<= 1 ~q_free~0)) (.cse27 (= ~c_num_read~0 0)) (.cse28 (<= ~q_free~0 1)) (.cse45 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (= 0 ~p_num_write~0)) (.cse8 (= |old(~p_dw_pc~0)| 1)) (.cse35 (= ~q_free~0 0)) (.cse22 (not (= ~c_dr_pc~0 1))) (.cse23 (not (= 0 ~c_dr_st~0))) (.cse46 (= ~p_dw_i~0 1)) (.cse25 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse20 (and .cse35 .cse22 .cse23 .cse46 .cse25)) (.cse33 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse16 (not .cse8)) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse38 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse39 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse5 (= 2 ~c_dr_st~0)) (.cse34 (= 1 ~c_dr_pc~0)) (.cse43 (= eval_~tmp___1~0 1)) (.cse36 (not (= 0 ~p_dw_st~0))) (.cse37 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse44 (and .cse22 .cse23 .cse24 .cse25 .cse48 .cse26 .cse27 .cse28 .cse45 .cse46 .cse29)) (.cse2 (not (= 0 |old(~p_num_write~0)|))) (.cse40 (not .cse49)) (.cse41 (and .cse22 .cse23 .cse25 .cse48 .cse35 .cse49 .cse46)) (.cse4 (< |old(~q_free~0)| 1)) (.cse21 (= 0 |old(~c_dr_st~0)|)) (.cse7 (not (= |old(~p_dw_st~0)| 0))) (.cse10 (< 1 |old(~q_free~0)|)) (.cse11 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse12 (< |old(~p_num_write~0)| .cse47)) (.cse13 (not .cse3)) (.cse31 (= 1 |old(~q_req_up~0)|)) (.cse14 (< .cse47 |old(~p_num_write~0)|)) (.cse30 (< ~q_write_ev~0 2)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse46)) (.cse19 (not (= |old(~q_free~0)| 0))) (.cse15 (not (= ~q_read_ev~0 2))) (.cse42 (not (= 1 |old(~p_num_write~0)|))) (.cse17 (not (= |old(~p_dw_st~0)| 2))) (.cse9 (not (= 0 |old(~c_num_read~0)|))) (.cse18 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse1 .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 (= 0 ~q_write_ev~0) .cse18 .cse19 .cse6) (or .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse21 .cse7 .cse8 .cse9 .cse10 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse11) (or .cse12 .cse30 .cse0 .cse1 .cse13 .cse19 .cse31 .cse14 .cse8 .cse17) (or (let ((.cse32 (+ ~c_num_read~0 1))) (and (<= .cse32 ~p_num_write~0) (<= ~p_num_write~0 .cse32))) .cse12 .cse0 .cse1 .cse13 .cse14 .cse15 .cse30 .cse19 .cse31 .cse21 .cse7 .cse8) (or .cse3 .cse0 .cse1 .cse19 .cse6 .cse5) (or .cse30 .cse0 .cse1 .cse13 .cse19 .cse31 .cse21 .cse15 .cse17) (or .cse30 .cse0 .cse1 .cse13 .cse19 .cse31 .cse21 .cse8 .cse17) (or .cse30 .cse0 .cse1 .cse19 .cse6 .cse31 .cse15 .cse5 .cse7 .cse8) (or (and .cse33 .cse23 .cse24 .cse34 .cse25 .cse35 .cse36 .cse37) .cse30 .cse0 .cse1 .cse13 .cse19 .cse31 .cse21 .cse15 .cse7 .cse8) (or .cse30 .cse38 .cse0 .cse4 .cse1 .cse13 .cse6 .cse17 .cse10 .cse39 .cse11 .cse18) (or .cse1 .cse0 .cse13 .cse17 .cse38 .cse30 .cse4 .cse31 .cse21 .cse8 .cse10 .cse39 .cse11) (or .cse1 .cse0 .cse15 .cse17 .cse40 .cse41 .cse19 .cse31 .cse42 .cse8 .cse9) (or .cse20 .cse3 .cse0 .cse1 .cse19 .cse21) (or (and .cse43 (and .cse36 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse33 .cse28 .cse34 .cse25 .cse26) .cse5) (= 1 ~p_dw_pc~0)) (or .cse16 (or .cse1 .cse0 .cse13 .cse15 .cse38 .cse30 .cse4 .cse6 .cse31 .cse7 .cse10 .cse39 .cse11))) (or .cse1 .cse0 .cse13 .cse15 .cse17 .cse38 .cse30 .cse4 .cse31 .cse21 .cse10 .cse39 .cse11) (or .cse1 .cse0 .cse44 .cse15 .cse2 .cse40 .cse41 .cse18 (and .cse43 .cse5 .cse26 .cse36 .cse24 .cse34 .cse25 .cse27 .cse37 .cse28 .cse29) .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse43 .cse26 .cse36 .cse22 .cse24 .cse25 .cse27 .cse37 .cse28 .cse45 .cse29)) (or .cse1 .cse0 .cse15 .cse44 .cse2 .cse40 .cse41 .cse3 .cse4 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse30 .cse0 .cse1 .cse13 .cse19 .cse31 .cse14 .cse15 .cse17) (or .cse30 .cse0 .cse1 .cse19 .cse15 .cse42 .cse8 .cse17 .cse9 (and .cse35 .cse22 .cse23 .cse25) .cse18)))) [2018-11-18 16:00:23,625 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2018-11-18 16:00:23,625 INFO L425 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2018-11-18 16:00:23,625 INFO L425 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-18 16:00:23,626 INFO L421 ceAbstractionStarter]: At program point L330(line 330) the Hoare annotation is: (let ((.cse22 (= 1 |old(~c_dr_pc~0)|)) (.cse53 (= ~p_dw_st~0 0)) (.cse18 (= 0 ~p_num_write~0)) (.cse29 (= |old(~p_dw_pc~0)| 1)) (.cse60 (+ |old(~c_num_read~0)| 1)) (.cse61 (+ ~c_num_read~0 1)) (.cse8 (= 2 ~c_dr_st~0)) (.cse36 (= ~c_num_read~0 1)) (.cse14 (= ~c_num_read~0 0)) (.cse28 (= 1 ~p_num_write~0)) (.cse10 (not (= ~c_dr_pc~0 1))) (.cse25 (= ~q_free~0 0)) (.cse59 (= ~p_dw_i~0 1)) (.cse62 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse50 (<= ~p_num_write~0 ~c_num_read~0)) (.cse47 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse57 (not (= 0 ~c_dr_st~0))) (.cse11 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse35 (= 1 ~c_dr_pc~0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 1 ~q_free~0)) (.cse51 (<= ~c_num_read~0 ~p_num_write~0)) (.cse26 (= 2 ~p_dw_st~0)) (.cse15 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse16 (<= ~q_free~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse44 (and .cse50 .cse47 .cse57 .cse11 .cse35 .cse13 .cse9 .cse51 .cse26 .cse15 .cse16 .cse17)) (.cse42 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse43 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse34 (not .cse62)) (.cse19 (and .cse10 .cse57 .cse13 (= 2 ~q_read_ev~0) .cse25 .cse62 .cse59)) (.cse54 (and .cse10 .cse11 .cse13 .cse14 .cse25 .cse26 .cse15 .cse28)) (.cse20 (< 0 |old(~q_req_up~0)|)) (.cse56 (not (= 1 |old(~p_num_write~0)|))) (.cse55 (and .cse11 .cse8 .cse35 .cse13 .cse36 .cse9 .cse26 .cse16 .cse28 .cse17)) (.cse27 (not (= 0 eval_~tmp___1~0))) (.cse46 (<= .cse61 ~p_num_write~0)) (.cse24 (= 1 ~p_dw_pc~0)) (.cse48 (<= ~p_num_write~0 .cse61)) (.cse45 (< |old(~p_num_write~0)| .cse60)) (.cse49 (< .cse60 |old(~p_num_write~0)|)) (.cse52 (not .cse29)) (.cse58 (and .cse25 .cse10 .cse57 .cse59 .cse13)) (.cse37 (and .cse10 .cse57 .cse11 .cse53 .cse13 .cse9 .cse14 .cse16 .cse17 .cse18)) (.cse39 (and .cse47 .cse57 .cse11 .cse35 .cse13 .cse25 .cse26 .cse15)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse33 (not (= 0 |old(~p_num_write~0)|))) (.cse23 (< |old(~q_free~0)| 1)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse30 (not (= 0 |old(~c_num_read~0)|))) (.cse31 (< 1 |old(~q_free~0)|)) (.cse32 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse59)) (.cse40 (not .cse22)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse41 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse38 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse12 (= 0 ~p_dw_st~0)) (.cse21 (= eval_~tmp___1~0 1))) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse2 .cse19 .cse20 (and .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse22 .cse23 (and .cse8 .cse13 .cse24 .cse14 .cse25 .cse26 .cse27 .cse28) .cse29 .cse30 .cse31 (and .cse10 .cse21 .cse13 .cse24 .cse14 .cse25 .cse26 .cse28) .cse32 .cse1 .cse6 .cse33 .cse34 (and .cse8 .cse35 .cse13 .cse36 .cse24 .cse9 .cse26 .cse16 .cse27 .cse28 .cse17) .cse37 .cse38)) (or .cse39 .cse0 .cse1 .cse2 .cse40 .cse3 .cse5 .cse41 .cse29 .cse7) (or .cse2 .cse1 .cse40 .cse6 .cse7 .cse42 .cse0 .cse23 .cse5 .cse41 .cse31 .cse43 .cse32 .cse44) (or .cse45 .cse0 .cse1 .cse2 .cse40 .cse3 .cse5 (and .cse46 .cse47 .cse11 .cse35 .cse13 .cse25 .cse26 .cse15 .cse48) .cse49 .cse29 .cse7 (and .cse50 .cse47 .cse11 .cse8 .cse35 .cse13 .cse9 .cse51 .cse26 .cse16 .cse17)) (or (and (and .cse50 .cse47 .cse8 .cse35 .cse13 .cse9 .cse51 .cse26 .cse15 .cse16 .cse17) .cse24) .cse52 (or .cse0 .cse42 .cse1 .cse23 .cse2 .cse40 .cse4 .cse7 .cse31 .cse43 .cse32 .cse20)) (or .cse45 .cse1 .cse2 .cse40 (and .cse46 .cse48) .cse49 .cse6 .cse0 .cse3 .cse5 .cse41 .cse38 .cse29) (or .cse45 .cse2 .cse1 .cse40 .cse49 .cse6 .cse52 .cse7 (= 0 ~q_write_ev~0) .cse20 (and .cse46 .cse47 .cse8 .cse35 .cse13 .cse24 .cse25 .cse26 .cse15 .cse48) .cse3 .cse4) (or .cse2 .cse1 .cse40 .cse7 .cse42 .cse0 .cse23 .cse8 .cse4 .cse5 .cse29 .cse31 .cse43 .cse32) (or (and .cse46 .cse8 .cse35 .cse13 .cse24 .cse25 .cse26 .cse27 .cse48) (or .cse52 (or .cse2 .cse1 .cse40 .cse6 .cse42 .cse0 .cse23 .cse4 .cse5 .cse38 .cse31 .cse43 .cse32)) (and (and .cse50 .cse47 .cse53 .cse8 .cse35 .cse13 .cse9 .cse51 .cse15 .cse16 .cse17) .cse24)) (or .cse22 .cse1 .cse2 .cse3 .cse4 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse38 .cse29 .cse8) (or .cse2 .cse1 .cse40 .cse44 .cse7 .cse42 .cse0 .cse23 .cse5 .cse41 .cse29 .cse31 .cse43 .cse32) (or .cse2 .cse1 .cse40 .cse6 .cse7 .cse42 .cse0 .cse23 .cse8 .cse4 .cse5 .cse31 .cse43 .cse32) (or .cse2 .cse1 .cse6 .cse54 .cse7 .cse34 .cse19 .cse22 .cse3 .cse5 .cse55 .cse56 .cse29 .cse30) (or .cse1 .cse2 .cse6 .cse54 .cse7 .cse20 .cse22 .cse0 .cse3 .cse56 .cse29 .cse30 .cse55 (and .cse25 .cse10 .cse57 .cse13)) (or .cse58 .cse22 .cse1 .cse2 .cse3 .cse41) (or (and .cse50 .cse47 .cse8 .cse35 .cse13 .cse24 .cse9 .cse51 .cse26 .cse16 .cse27 .cse17) (and .cse46 .cse47 .cse35 .cse13 .cse24 .cse25 .cse26 .cse15 .cse48) (or .cse45 .cse0 .cse1 .cse2 .cse40 .cse3 .cse5 .cse49 .cse6 .cse52 .cse7)) (or .cse1 .cse2 .cse33 .cse58 .cse22 .cse23 .cse41 .cse37 .cse38 .cse29 .cse30 .cse31 .cse32) (or .cse0 .cse1 .cse2 .cse40 .cse39 .cse3 .cse5 .cse41 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse29 .cse7) (or .cse1 .cse2 .cse33 .cse22 .cse23 .cse4 .cse8 .cse38 .cse29 .cse30 .cse31 .cse32) (or .cse0 .cse1 .cse2 .cse40 .cse3 .cse5 (and .cse47 .cse57 .cse35 .cse13 .cse25 .cse26 .cse15) .cse41 (and .cse47 .cse57 .cse11 .cse53 .cse35 .cse13 .cse25 .cse15) .cse6 .cse38 .cse29)))) [2018-11-18 16:00:23,626 INFO L421 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse13 (= 1 |old(~c_dr_pc~0)|)) (.cse16 (= |old(~p_dw_pc~0)| 1)) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 0 ~c_dr_st~0))) (.cse5 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_num_read~0 0)) (.cse21 (= ~q_free~0 0)) (.cse22 (= 2 ~p_dw_st~0)) (.cse8 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse23 (= 1 ~p_num_write~0)) (.cse42 (+ |old(~c_num_read~0)| 1)) (.cse43 (+ ~c_num_read~0 1))) (let ((.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse12 (< 0 |old(~q_req_up~0)|)) (.cse2 (= eval_~tmp___1~0 1)) (.cse36 (<= .cse43 ~p_num_write~0)) (.cse37 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse38 (= 1 ~c_dr_pc~0)) (.cse39 (<= ~p_num_write~0 .cse43)) (.cse20 (= 1 ~p_dw_pc~0)) (.cse26 (< |old(~p_num_write~0)| .cse42)) (.cse27 (< .cse42 |old(~p_num_write~0)|)) (.cse25 (= 0 |old(~c_dr_st~0)|)) (.cse40 (and .cse4 .cse3 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse23)) (.cse29 (not (= |old(~p_dw_st~0)| 2))) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse24 (not (= |old(~q_free~0)| 0))) (.cse41 (not (= 1 |old(~p_num_write~0)|))) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse28 (not .cse16)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse34 (not .cse13)) (.cse9 (not (= ~q_read_ev~0 2))) (.cse33 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse31 (< ~q_write_ev~0 2)) (.cse14 (< |old(~q_free~0)| 1)) (.cse30 (not (= 2 |old(~c_dr_st~0)|))) (.cse32 (= 1 |old(~q_req_up~0)|)) (.cse15 (not (= |old(~p_dw_st~0)| 0))) (.cse18 (< 1 |old(~q_free~0)|)) (.cse35 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse19 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (<= 1 ~q_free~0) .cse4 .cse5 (= 0 ~p_dw_st~0) .cse6 .cse7 .cse8 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse4 .cse2 .cse3 .cse6 .cse20 .cse7 .cse21 .cse22 .cse23)) (or .cse13 .cse1 .cse0 .cse24 .cse25) (or .cse26 .cse0 .cse1 .cse27 .cse9 .cse28 .cse29 (= 0 ~q_write_ev~0) .cse12 .cse24 .cse30) (or .cse31 .cse1 .cse0 .cse24 .cse32 .cse25 .cse9 .cse15 .cse16) (or .cse31 .cse33 .cse1 .cse14 .cse0 .cse34 .cse30 .cse29 .cse18 .cse35 .cse19 .cse12) (or .cse0 .cse1 .cse34 .cse29 .cse33 .cse31 .cse14 .cse32 .cse25 .cse16 .cse18 .cse35 .cse19) (or .cse31 .cse1 .cse0 .cse24 .cse32 .cse25 .cse9 .cse29) (or .cse26 .cse31 .cse1 .cse0 .cse34 .cse24 .cse32 .cse27 (and .cse36 .cse37 .cse3 .cse5 .cse38 .cse6 .cse21 .cse22 .cse8 .cse39) .cse16 .cse29) (or .cse13 .cse1 .cse14 .cse0 .cse25 .cse15 .cse16 .cse17 .cse18 .cse10 .cse19) (or .cse13 .cse31 .cse1 .cse0 .cse24 .cse9 .cse40 .cse41 .cse16 .cse29 .cse17 .cse12) (or (and .cse2 (and .cse36 .cse37 .cse3 .cse38 .cse6 .cse21 .cse22 .cse8 .cse39) .cse20) (or .cse26 .cse31 .cse1 .cse0 .cse34 .cse24 .cse32 .cse27 .cse9 .cse28 .cse29)) (or .cse0 .cse1 .cse34 .cse9 .cse29 .cse33 .cse31 .cse14 .cse32 .cse25 .cse18 .cse35 .cse19) (or .cse31 .cse1 .cse0 .cse24 .cse32 .cse25 .cse16 .cse29) (or .cse0 .cse1 .cse40 .cse9 .cse29 .cse11 .cse13 .cse24 .cse32 .cse41 .cse16 .cse17) (or .cse28 (or .cse0 .cse1 .cse34 .cse9 .cse33 .cse31 .cse14 .cse30 .cse32 .cse15 .cse18 .cse35 .cse19))))) [2018-11-18 16:00:23,627 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-18 16:00:23,627 INFO L428 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2018-11-18 16:00:23,627 INFO L425 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-18 16:00:23,628 INFO L428 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2018-11-18 16:00:23,628 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2018-11-18 16:00:23,628 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2018-11-18 16:00:23,630 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2018-11-18 16:00:23,631 INFO L428 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2018-11-18 16:00:23,631 INFO L421 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse19 (= 1 ~c_dr_pc~0))) (let ((.cse10 (not .cse19)) (.cse23 (not (= ~q_read_ev~0 2))) (.cse29 (+ ~c_num_read~0 1))) (let ((.cse18 (not (= 0 ~p_num_write~0))) (.cse9 (not (= ~p_dw_st~0 0))) (.cse6 (< ~q_write_ev~0 2)) (.cse5 (< ~p_num_write~0 ~c_num_read~0)) (.cse7 (< ~q_free~0 1)) (.cse15 (= 0 ~c_dr_st~0)) (.cse11 (< 1 ~q_free~0)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~q_read_ev~0 1))) (.cse27 (< ~p_num_write~0 .cse29)) (.cse28 (< .cse29 ~p_num_write~0)) (.cse3 (not (= 1 ~p_dw_pc~0))) (.cse4 (< 0 ~q_req_up~0)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse22 (or .cse10 .cse23)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse14 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse25 (not (= ~p_dw_st~0 2))) (.cse24 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse20 (not (= ~q_free~0 0))) (.cse21 (= 1 ~q_req_up~0)) (.cse26 (not (= 1 ~p_num_write~0))) (.cse16 (= ~p_dw_pc~0 1)) (.cse17 (not (= 0 ~c_num_read~0)))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse2 .cse7 .cse1 .cse15 .cse9 .cse16 .cse17 .cse14 .cse11 .cse18 .cse19 .cse13) (or .cse6 .cse2 .cse1 .cse20 .cse21 .cse15 .cse22 .cse9 .cse16 .cse14) (or .cse14 .cse1 .cse2 .cse23 .cse18 .cse24 .cse4 .cse19 .cse7 .cse9 .cse16 .cse17 .cse11 .cse13) (or .cse1 .cse2 .cse14 .cse25 .cse5 .cse6 .cse7 .cse21 .cse15 .cse10 .cse16 .cse11 .cse12 .cse13) (or .cse6 .cse2 .cse1 .cse20 .cse14 .cse26 .cse16 .cse25 .cse17 .cse23 .cse4) (or (or .cse6 (or (or .cse5 .cse2 .cse7 .cse1 .cse8 .cse10 .cse11 .cse12 .cse13) .cse25) .cse4) .cse14) (or .cse6 .cse2 .cse1 .cse20 .cse21 .cse15 .cse16 .cse25 .cse14) (or .cse27 .cse6 .cse2 .cse1 .cse20 .cse21 .cse28 .cse14 .cse10 .cse16 .cse25) (or .cse1 .cse2 .cse25 .cse5 .cse6 .cse7 .cse21 .cse14 .cse22 .cse15 .cse11 .cse12 .cse13) (or .cse14 .cse2 .cse1 .cse20 .cse15 .cse19) (or .cse6 .cse2 .cse1 .cse20 .cse21 .cse15 .cse22 .cse14 .cse25) (or (or .cse6 .cse21 (or (or .cse5 .cse2 .cse7 .cse1 .cse15 .cse10 .cse11 .cse12 .cse13) .cse25)) .cse0 .cse14) (or .cse27 .cse1 .cse2 .cse28 .cse25 (= 0 ~q_write_ev~0) .cse3 .cse4 (= 1 ~q_write_ev~0) .cse20 .cse8 .cse22 .cse14) (or .cse1 .cse2 .cse14 .cse23 .cse25 .cse24 .cse20 .cse21 .cse26 .cse16 .cse17))))) [2018-11-18 16:00:23,631 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2018-11-18 16:00:23,631 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-18 16:00:23,631 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2018-11-18 16:00:23,631 INFO L425 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2018-11-18 16:00:23,631 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2018-11-18 16:00:23,631 INFO L421 ceAbstractionStarter]: At program point update_channelsENTRY(lines 208 222) the Hoare annotation is: (let ((.cse16 (= 1 ~c_dr_pc~0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse18 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse20 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse34 (+ ~c_num_read~0 1)) (.cse33 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse32 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse13 (not (= 0 ~p_num_write~0))) (.cse28 (and .cse33 .cse32)) (.cse0 (< ~p_num_write~0 .cse34)) (.cse25 (and .cse18 .cse32 .cse20)) (.cse8 (< .cse34 ~p_num_write~0)) (.cse26 (not .cse9)) (.cse15 (< 0 |old(~q_req_up~0)|)) (.cse19 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse14 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse29 (not (= 1 ~p_num_write~0))) (.cse22 (not (= 0 ~c_num_read~0))) (.cse5 (not (= ~q_free~0 0))) (.cse21 (not (= ~p_dw_st~0 0))) (.cse12 (not (= |old(~q_read_ev~0)| 2))) (.cse6 (= 1 |old(~q_req_up~0)|)) (.cse11 (= 0 ~c_dr_st~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse4 (not .cse16)) (.cse10 (not (= ~p_dw_st~0 2))) (.cse7 (and .cse33 .cse18 .cse32)) (.cse1 (< |old(~q_write_ev~0)| 2)) (.cse30 (< ~p_num_write~0 ~c_num_read~0)) (.cse17 (< ~q_free~0 1)) (.cse27 (not (= 2 ~c_dr_st~0))) (.cse23 (< 1 ~q_free~0)) (.cse31 (< ~c_num_read~0 ~p_num_write~0)) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse7 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse9 .cse10) (or .cse3 .cse2 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse18 .cse19 .cse20) .cse21 .cse9 .cse22 .cse23 .cse24) (or .cse0 .cse2 .cse3 .cse4 .cse8 .cse25 .cse12 .cse26 .cse10 .cse1 .cse5 .cse27) (or .cse16 .cse2 .cse17 .cse3 .cse11 .cse28 .cse21 .cse9 .cse22 .cse23 .cse13 .cse24) (or .cse16 .cse2 .cse3 .cse5 .cse11 .cse28) (or .cse0 .cse3 .cse2 .cse4 .cse25 .cse8 .cse12 .cse26 .cse10 (= 0 |old(~q_write_ev~0)|) .cse15 .cse5 .cse27) (or .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse29 .cse9 .cse10 .cse22 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6 .cse11 .cse12 .cse10) (or (and .cse18 (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse20) (or .cse1 .cse30 .cse2 .cse17 .cse3 .cse4 .cse27 .cse10 .cse23 .cse31 .cse24 .cse15)) (or (and (and .cse18 .cse32) .cse20) (or .cse1 .cse30 .cse2 .cse17 .cse3 .cse4 .cse27 .cse12 .cse10 .cse23 .cse31 .cse24)) (or .cse3 .cse2 .cse12 (and .cse18 .cse32 .cse19) .cse10 .cse14 .cse5 .cse6 .cse29 .cse9 .cse22) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse12 .cse21 .cse9) (or .cse3 .cse2 .cse4 .cse7 .cse10 .cse30 .cse1 .cse17 .cse6 .cse11 .cse9 .cse23 .cse31 .cse24) (or .cse3 .cse2 .cse4 .cse12 .cse10 .cse30 .cse1 .cse17 .cse6 .cse11 .cse23 .cse31 .cse24 .cse7) (or .cse2 .cse3 .cse4 .cse10 .cse7 .cse1 .cse30 .cse17 .cse27 .cse9 .cse23 .cse31 .cse24)))) [2018-11-18 16:00:23,633 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2018-11-18 16:00:23,633 INFO L421 ceAbstractionStarter]: At program point L214(line 214) the Hoare annotation is: (let ((.cse13 (= 1 ~c_dr_pc~0)) (.cse29 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse28 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse30 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse31 (+ ~c_num_read~0 1))) (let ((.cse12 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse0 (< ~p_num_write~0 .cse31)) (.cse4 (< .cse31 ~p_num_write~0)) (.cse6 (not .cse16)) (.cse11 (not (= 0 ~p_num_write~0))) (.cse27 (and .cse28 .cse30)) (.cse26 (and (and .cse29 .cse30) (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse10 (not (= 2 ~c_dr_st~0))) (.cse25 (not (= 1 ~p_num_write~0))) (.cse17 (not (= 0 ~c_num_read~0))) (.cse8 (< 0 |old(~q_req_up~0)|)) (.cse9 (not (= ~q_free~0 0))) (.cse5 (not (= |old(~q_read_ev~0)| 2))) (.cse15 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not .cse13)) (.cse7 (not (= ~p_dw_st~0 2))) (.cse22 (< ~p_num_write~0 ~c_num_read~0)) (.cse20 (< |old(~q_write_ev~0)| 2)) (.cse14 (< ~q_free~0 1)) (.cse21 (= 1 |old(~q_req_up~0)|)) (.cse23 (= 0 ~c_dr_st~0)) (.cse18 (< 1 ~q_free~0)) (.cse24 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 |old(~q_write_ev~0)|) .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse5 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse2 .cse1 .cse3 .cse9 .cse21 .cse4 .cse16 .cse7) (or .cse1 .cse2 .cse3 .cse5 .cse7 .cse22 .cse20 .cse14 .cse21 .cse23 .cse18 .cse24 .cse19) (or .cse1 .cse2 .cse5 .cse7 .cse12 .cse9 .cse21 .cse25 .cse16 .cse17) (or .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse20 .cse9 .cse10) (or .cse13 .cse2 .cse14 .cse1 .cse23 .cse27 .cse15 .cse16 .cse17 .cse18 .cse11 .cse19) (or .cse13 .cse2 .cse1 .cse9 .cse23 .cse27) (or .cse2 .cse1 .cse3 .cse7 .cse20 .cse22 .cse14 .cse10 (and .cse28 .cse29 .cse30) .cse16 .cse18 .cse24 .cse19) (or .cse20 .cse2 .cse1 .cse3 .cse9 .cse21 .cse23 .cse5 .cse7) (or .cse20 .cse22 .cse2 .cse14 .cse1 .cse3 .cse10 .cse7 .cse18 .cse24 .cse19 .cse8) (or .cse26 (or .cse20 .cse22 .cse2 .cse14 .cse1 .cse3 .cse10 .cse5 .cse7 .cse18 .cse24 .cse19)) (or .cse20 .cse2 .cse1 .cse9 .cse5 .cse25 .cse16 .cse7 .cse17 .cse8) (or .cse20 .cse2 .cse1 .cse3 .cse9 .cse21 .cse23 .cse16 .cse7) (or .cse20 .cse2 .cse1 .cse3 .cse9 .cse21 .cse23 .cse5 .cse15 .cse16) (or .cse1 .cse2 .cse3 .cse7 .cse22 .cse20 .cse14 .cse21 .cse23 .cse16 .cse18 .cse24 .cse19)))) [2018-11-18 16:00:23,635 INFO L425 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2018-11-18 16:00:23,635 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 261 278) the Hoare annotation is: (let ((.cse27 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse29 (+ ~c_num_read~0 1))) (let ((.cse23 (not (= 0 ~p_num_write~0))) (.cse22 (not (= ~p_dw_st~0 0))) (.cse19 (< ~p_num_write~0 .cse29)) (.cse20 (< .cse29 ~p_num_write~0)) (.cse26 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse28 (not (= 2 ~c_dr_st~0))) (.cse18 (< 0 ~q_req_up~0)) (.cse2 (not .cse21)) (.cse5 (< ~p_num_write~0 ~c_num_read~0)) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse7 (< ~q_free~0 1)) (.cse9 (= 0 ~c_dr_st~0)) (.cse11 (< 1 ~q_free~0)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse27)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse15 (not (= |old(~q_read_ev~0)| 2))) (.cse4 (not (= ~p_dw_st~0 2))) (.cse24 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse25 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse14 (not (= ~q_free~0 0))) (.cse8 (= 1 ~q_req_up~0)) (.cse16 (not (= 1 ~p_num_write~0))) (.cse10 (= ~p_dw_pc~0 1)) (.cse17 (not (= 0 ~c_num_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse6 .cse1 .cse0 .cse14 .cse15 .cse3 .cse16 .cse10 .cse4 .cse17 .cse18) (or .cse3 .cse6 .cse1 .cse0 .cse14 .cse8 .cse9 .cse10 .cse4) (or .cse19 .cse6 .cse1 .cse0 .cse2 .cse14 .cse8 .cse3 .cse20 .cse10 .cse4) (or .cse21 .cse1 .cse7 .cse0 .cse9 .cse3 .cse22 .cse10 .cse17 .cse11 .cse23 .cse13) (or .cse21 .cse1 .cse0 .cse14 .cse9 .cse3) (or .cse0 .cse1 .cse15 .cse23 .cse24 .cse18 .cse21 .cse7 .cse22 .cse10 .cse17 .cse11 (and .cse25 .cse26) .cse13) (or .cse6 .cse1 .cse0 .cse14 .cse8 .cse9 .cse3 .cse15 .cse22 .cse10) (or .cse19 .cse1 .cse0 .cse20 .cse15 (not .cse10) .cse4 .cse18 (and .cse27 .cse26) .cse14 .cse28) (or .cse6 .cse1 .cse0 .cse3 .cse14 .cse8 .cse9 .cse15 .cse4) (or (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse26) (or .cse6 .cse5 .cse1 .cse7 .cse0 .cse2 .cse28 .cse4 .cse11 .cse12 .cse13 .cse18)) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse3) (or .cse0 .cse1 .cse15 .cse4 .cse24 (and .cse27 .cse25) .cse14 .cse8 .cse16 .cse10 .cse17)))) [2018-11-18 16:00:23,637 INFO L425 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2018-11-18 16:00:23,637 INFO L425 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2018-11-18 16:00:23,637 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2018-11-18 16:00:23,637 INFO L421 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse22 (+ ~c_num_read~0 1))) (let ((.cse21 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse8 (= ~c_num_read~0 0)) (.cse9 (= 1 ~p_num_write~0)) (.cse16 (<= ~q_req_up~0 0)) (.cse5 (not (= ~q_req_up~0 1))) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= 1 ~c_dr_pc~0)) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (<= .cse22 ~p_num_write~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse18 (= 2 ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~q_read_ev~0)) (.cse19 (= 1 ~p_dw_pc~0)) (.cse0 (= ~q_free~0 0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse20 (<= ~p_num_write~0 .cse22))) (or (not (= ~p_dw_i~0 1)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse6 .cse7 .cse8 .cse0 .cse1 .cse4 .cse9 .cse5 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse0 .cse2 .cse6 .cse7) .cse1 .cse3 .cse5) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse12 .cse13 .cse1 .cse4 .cse14 .cse15 .cse5) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse16 .cse17 .cse18 (not (= 0 ~q_write_ev~0)) .cse6 .cse7 .cse19 .cse0 .cse1 .cse20) (and .cse10 .cse3 .cse18 .cse11 .cse6 .cse7 .cse12 .cse13 .cse1 .cse14 .cse15) (not (= |old(~q_read_ev~0)| 2)) (and .cse21 .cse2 (= ~p_dw_st~0 0) .cse6 .cse12 .cse8 .cse4 .cse14 .cse15 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse10 .cse16 .cse3 .cse18 .cse11 .cse6 .cse12 .cse13 .cse1 .cse14 .cse15) (and .cse2 .cse3 (= 0 ~p_dw_st~0) .cse6 .cse7 .cse0 .cse4 .cse5) (and .cse0 .cse21 .cse2 .cse6) (< |old(~q_free~0)| 1) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse7 .cse12 .cse13 .cse1 .cse14 .cse15 .cse5) (and (and .cse8 .cse0 .cse4 .cse9 .cse6 .cse7) .cse16 .cse1 .cse3) (and .cse0 .cse17 .cse1 .cse3 .cse4 .cse20 .cse5 .cse11 .cse6) (not (= 0 |old(~p_num_write~0)|)) (and .cse10 .cse3 .cse18 .cse11 .cse6 .cse12 .cse13 .cse1 .cse4 .cse14 .cse15) (and .cse17 .cse3 .cse18 .cse6 .cse7 .cse19 .cse0 .cse1 .cse20) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-18 16:00:23,641 INFO L425 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-11-18 16:00:23,641 INFO L421 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse25 (+ ~c_num_read~0 1))) (let ((.cse20 (= 2 ~c_dr_st~0)) (.cse21 (= 1 ~p_dw_pc~0)) (.cse22 (not (= ~c_dr_pc~0 1))) (.cse24 (= 0 ~p_dw_st~0)) (.cse13 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse23 (= 0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse15 (<= 1 ~q_free~0)) (.cse16 (<= ~c_num_read~0 ~p_num_write~0)) (.cse17 (<= ~q_free~0 1)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_num_read~0 0)) (.cse12 (= 1 ~p_num_write~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse3 (= ~q_free~0 0)) (.cse4 (<= .cse25 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (<= ~p_num_write~0 .cse25)) (.cse2 (not (= ~q_req_up~0 1))) (.cse6 (= 1 ~c_dr_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse3 .cse0 .cse9 .cse1 .cse10 .cse2 .cse7) (and .cse7 .cse8 .cse11 .cse3 .cse0 .cse10 .cse12 .cse2 .cse13) (and (and .cse3 .cse9 .cse7 .cse8) .cse0 .cse1 .cse2) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse14 .cse9 .cse1 .cse6 .cse7 .cse15 .cse16 .cse0 .cse10 .cse17 .cse18 .cse2) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse19 .cse4 .cse20 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 .cse21 .cse3 .cse0 .cse5) (not (= |old(~q_read_ev~0)| 2)) (and .cse22 .cse9 (= ~p_dw_st~0 0) .cse7 .cse15 .cse11 .cse10 .cse17 .cse18 .cse23) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse14 .cse19 .cse1 .cse20 .cse6 .cse7 .cse15 .cse16 .cse0 .cse17 .cse18) (and (and .cse14 .cse1 .cse24 .cse20 .cse6 .cse7 .cse8 .cse15 .cse16 .cse17 .cse18 .cse2) .cse21) (and .cse9 .cse1 .cse24 .cse7 .cse8 .cse3 .cse10 .cse2) (and .cse3 .cse22 .cse9 .cse7) (and .cse15 .cse22 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse24 .cse7 .cse11 (= |old(~q_req_up~0)| ~q_req_up~0) .cse17 .cse18 .cse13 .cse23) (< |old(~q_free~0)| 1) (and .cse14 .cse9 .cse1 .cse6 .cse7 .cse8 .cse15 .cse16 .cse0 .cse17 .cse18 .cse2) (and (and .cse11 .cse3 .cse10 .cse12 .cse7 .cse8) .cse19 .cse0 .cse1) (and .cse3 .cse4 .cse0 .cse1 .cse10 .cse5 .cse2 .cse6 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-18 16:00:23,642 INFO L425 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-18 16:00:23,642 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2018-11-18 16:00:23,642 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 431) no Hoare annotation was computed. [2018-11-18 16:00:23,642 INFO L421 ceAbstractionStarter]: At program point L409-2(lines 406 431) the Hoare annotation is: (let ((.cse25 (+ ~c_num_read~0 1))) (let ((.cse20 (= 2 ~c_dr_st~0)) (.cse21 (= 1 ~p_dw_pc~0)) (.cse22 (not (= ~c_dr_pc~0 1))) (.cse24 (= 0 ~p_dw_st~0)) (.cse13 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse23 (= 0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse15 (<= 1 ~q_free~0)) (.cse16 (<= ~c_num_read~0 ~p_num_write~0)) (.cse17 (<= ~q_free~0 1)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_num_read~0 0)) (.cse12 (= 1 ~p_num_write~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse3 (= ~q_free~0 0)) (.cse4 (<= .cse25 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (<= ~p_num_write~0 .cse25)) (.cse2 (not (= ~q_req_up~0 1))) (.cse6 (= 1 ~c_dr_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse3 .cse0 .cse9 .cse1 .cse10 .cse2 .cse7) (and .cse7 .cse8 .cse11 .cse3 .cse0 .cse10 .cse12 .cse2 .cse13) (and (and .cse3 .cse9 .cse7 .cse8) .cse0 .cse1 .cse2) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse14 .cse9 .cse1 .cse6 .cse7 .cse15 .cse16 .cse0 .cse10 .cse17 .cse18 .cse2) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse19 .cse4 .cse20 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 .cse21 .cse3 .cse0 .cse5) (not (= |old(~q_read_ev~0)| 2)) (and .cse22 .cse9 (= ~p_dw_st~0 0) .cse7 .cse15 .cse11 .cse10 .cse17 .cse18 .cse23) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse14 .cse19 .cse1 .cse20 .cse6 .cse7 .cse15 .cse16 .cse0 .cse17 .cse18) (and (and .cse14 .cse1 .cse24 .cse20 .cse6 .cse7 .cse8 .cse15 .cse16 .cse17 .cse18 .cse2) .cse21) (and .cse9 .cse1 .cse24 .cse7 .cse8 .cse3 .cse10 .cse2) (and .cse3 .cse22 .cse9 .cse7) (and .cse15 .cse22 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse24 .cse7 .cse11 (= |old(~q_req_up~0)| ~q_req_up~0) .cse17 .cse18 .cse13 .cse23) (< |old(~q_free~0)| 1) (and .cse14 .cse9 .cse1 .cse6 .cse7 .cse8 .cse15 .cse16 .cse0 .cse17 .cse18 .cse2) (and (and .cse11 .cse3 .cse10 .cse12 .cse7 .cse8) .cse19 .cse0 .cse1) (and .cse3 .cse4 .cse0 .cse1 .cse10 .cse5 .cse2 .cse6 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-18 16:00:23,644 INFO L421 ceAbstractionStarter]: At program point L405(line 405) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (<= 1 ~q_free~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= 0 ~p_dw_st~0) .cse3 .cse4 (= |old(~q_req_up~0)| ~q_req_up~0) .cse5 .cse6 (= ~q_read_ev~0 ~q_write_ev~0) .cse7) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and .cse1 .cse2 (= ~p_dw_st~0 0) (= 2 ~c_dr_st~0) .cse3 .cse0 .cse4 .cse5 .cse6 .cse7) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-11-18 16:00:23,644 INFO L421 ceAbstractionStarter]: At program point L403(line 403) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse2 (= ~p_dw_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 1 ~q_free~0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (<= ~q_free~0 1)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= 0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and .cse0 .cse1 .cse2 (= 2 ~c_dr_st~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |old(~q_req_up~0)| ~q_req_up~0) .cse6 .cse7 (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse8) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-11-18 16:00:23,645 INFO L428 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2018-11-18 16:00:23,645 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-11-18 16:00:23,645 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-18 16:00:23,645 INFO L421 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse24 (+ ~c_num_read~0 1))) (let ((.cse21 (= ~p_dw_st~0 0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 1)) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (<= 1 ~q_free~0)) (.cse14 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~q_free~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (<= .cse24 ~p_num_write~0)) (.cse8 (<= ~p_num_write~0 .cse24)) (.cse2 (= 1 ~c_dr_pc~0)) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse11 (not (= ~q_req_up~0 1))) (.cse22 (= ~c_num_read~0 0)) (.cse6 (= ~q_free~0 0)) (.cse15 (not (= ~p_dw_pc~0 1))) (.cse23 (= 1 ~p_num_write~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 2 ~q_read_ev~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse10 (<= 2 ~q_write_ev~0))) (or (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 1 ~q_write_ev~0)) (and (and .cse6 .cse9 .cse3 .cse4) .cse7 .cse10 .cse11) (and .cse12 .cse9 .cse10 .cse2 .cse3 .cse13 .cse14 .cse7 .cse15 .cse16 .cse17 .cse11) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse18 (and .cse12 .cse9 .cse10 .cse2 .cse3 .cse13 .cse14 .cse7 .cse16 .cse17 .cse11)) (and .cse0 .cse1 .cse19 (not (= 0 ~q_write_ev~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse9 .cse21 .cse3 .cse13 .cse22 .cse15 .cse16 .cse17 (= 0 ~p_num_write~0)) (and .cse12 .cse0 .cse10 .cse19 .cse2 .cse3 .cse13 .cse14 .cse7 .cse16 .cse17) (and (and (and .cse12 .cse10 .cse21 .cse19 .cse2 .cse3 .cse13 .cse14 .cse16 .cse17 .cse11) .cse5) .cse18) (and .cse6 .cse20 .cse9 .cse3) (< |old(~q_free~0)| 1) (and .cse12 .cse9 .cse10 .cse2 .cse3 .cse4 .cse13 .cse14 .cse7 .cse16 .cse17 .cse11) (and .cse6 .cse1 .cse7 .cse10 .cse15 .cse8 .cse11 .cse2 .cse3) (not (= |old(~p_dw_st~0)| 0)) (not (= ~p_dw_i~0 1)) (< 0 |old(~q_req_up~0)|) (and .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse3) (and .cse3 .cse4 .cse22 .cse6 .cse7 .cse15 .cse23 .cse11 (= ~q_read_ev~0 ~q_write_ev~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse9 .cse10 (= 0 ~p_dw_st~0) .cse3 .cse4 .cse6 .cse15 .cse11) (and (and .cse22 .cse6 .cse15 .cse23 .cse3 .cse4) .cse0 .cse7 .cse10) (not (= 0 |old(~p_num_write~0)|))))) [2018-11-18 16:00:23,645 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 395 437) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-18 16:00:23,647 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-18 16:00:23,647 INFO L421 ceAbstractionStarter]: At program point L404(line 404) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (<= 1 ~q_free~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= 0 ~p_dw_st~0) .cse3 .cse4 (= |old(~q_req_up~0)| ~q_req_up~0) .cse5 .cse6 (= ~q_read_ev~0 ~q_write_ev~0) .cse7) (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and .cse1 .cse2 (= ~p_dw_st~0 0) (= 2 ~c_dr_st~0) .cse3 .cse0 .cse4 .cse5 .cse6 .cse7) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-11-18 16:00:23,647 INFO L421 ceAbstractionStarter]: At program point L402(line 402) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-18 16:00:23,647 INFO L421 ceAbstractionStarter]: At program point L402-1(line 402) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-18 16:00:23,647 INFO L421 ceAbstractionStarter]: At program point L423(line 423) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse19 (= 2 ~c_dr_st~0)) (.cse20 (= 1 ~p_dw_pc~0)) (.cse22 (= 0 ~p_dw_st~0)) (.cse21 (not (= ~c_dr_pc~0 1))) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse14 (<= 1 ~q_free~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~q_free~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_num_read~0 0)) (.cse12 (= 1 ~p_num_write~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse18 (<= ~q_req_up~0 0)) (.cse3 (= ~q_free~0 0)) (.cse4 (<= .cse23 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (<= ~p_num_write~0 .cse23)) (.cse2 (not (= ~q_req_up~0 1))) (.cse6 (= 1 ~c_dr_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse3 .cse0 .cse9 .cse1 .cse10 .cse2 .cse7) (and .cse7 .cse8 .cse11 .cse3 .cse0 .cse10 .cse12 .cse2 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse3 .cse9 .cse7 .cse8) .cse0 .cse1 .cse2) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse13 .cse9 .cse1 .cse6 .cse7 .cse14 .cse15 .cse0 .cse10 .cse16 .cse17 .cse2) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse18 .cse4 .cse19 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 .cse20 .cse3 .cse0 .cse5) (not (= |old(~q_read_ev~0)| 2)) (and .cse21 .cse9 (= ~p_dw_st~0 0) .cse7 .cse14 .cse11 .cse10 .cse16 .cse17 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse13 .cse18 .cse1 .cse19 .cse6 .cse7 .cse14 .cse15 .cse0 .cse16 .cse17) (and (and .cse13 .cse1 .cse22 .cse19 .cse6 .cse7 .cse8 .cse14 .cse15 .cse16 .cse17 .cse2) .cse20) (and .cse9 .cse1 .cse22 .cse7 .cse8 .cse3 .cse10 .cse2) (and .cse3 .cse21 .cse9 .cse7) (< |old(~q_free~0)| 1) (and .cse13 .cse9 .cse1 .cse6 .cse7 .cse8 .cse14 .cse15 .cse0 .cse16 .cse17 .cse2) (and (and .cse11 .cse3 .cse10 .cse12 .cse7 .cse8) .cse18 .cse0 .cse1) (and .cse3 .cse4 .cse0 .cse1 .cse10 .cse5 .cse2 .cse6 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-18 16:00:23,648 INFO L421 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse18 (= 2 ~c_dr_st~0)) (.cse16 (not (= ~c_dr_pc~0 1))) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~c_num_read~0 0)) (.cse9 (= 1 ~p_num_write~0)) (.cse7 (= 2 ~q_read_ev~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse0 (= ~q_free~0 0)) (.cse19 (<= .cse21 ~p_num_write~0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse20 (<= ~p_num_write~0 .cse21)) (.cse5 (not (= ~q_req_up~0 1))) (.cse11 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse6 .cse7 .cse8 .cse0 .cse1 .cse4 .cse9 .cse5 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse0 .cse2 .cse6 .cse7) .cse1 .cse3 .cse5) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse12 .cse13 .cse1 .cse4 .cse14 .cse15 .cse5) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse16 .cse2 (= ~p_dw_st~0 0) .cse6 .cse12 .cse8 .cse4 .cse14 .cse15 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse10 .cse17 .cse3 .cse18 .cse11 .cse6 .cse12 .cse13 .cse1 .cse14 .cse15) (and .cse2 .cse3 (= 0 ~p_dw_st~0) .cse6 .cse7 .cse0 .cse4 .cse5) (and .cse17 .cse19 .cse18 .cse6 .cse7 (= 1 ~p_dw_pc~0) .cse0 .cse1 .cse20) (and .cse0 .cse16 .cse2 .cse6) (< |old(~q_free~0)| 1) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse7 .cse12 .cse13 .cse1 .cse14 .cse15 .cse5) (and (and .cse8 .cse0 .cse4 .cse9 .cse6 .cse7) .cse17 .cse1 .cse3) (and .cse0 .cse19 .cse1 .cse3 .cse4 .cse20 .cse5 .cse11 .cse6) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-18 16:00:23,650 INFO L421 ceAbstractionStarter]: At program point L421-1(line 421) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse18 (= 2 ~c_dr_st~0)) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~c_num_read~0 0)) (.cse9 (= 1 ~p_num_write~0)) (.cse7 (= 2 ~q_read_ev~0)) (.cse16 (<= ~q_req_up~0 0)) (.cse0 (= ~q_free~0 0)) (.cse17 (<= .cse21 ~p_num_write~0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse19 (<= ~p_num_write~0 .cse21)) (.cse5 (not (= ~q_req_up~0 1))) (.cse11 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse6 .cse7 .cse8 .cse0 .cse1 .cse4 .cse9 .cse5 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse0 .cse2 .cse6 .cse7) .cse1 .cse3 .cse5) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse12 .cse13 .cse1 .cse4 .cse14 .cse15 .cse5) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse16 .cse17 .cse18 (not (= 0 ~q_write_ev~0)) .cse6 .cse7 (= 1 ~p_dw_pc~0) .cse0 .cse1 .cse19) (not (= |old(~q_read_ev~0)| 2)) (and .cse20 .cse2 (= ~p_dw_st~0 0) .cse6 .cse12 .cse8 .cse4 .cse14 .cse15 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse10 .cse16 .cse3 .cse18 .cse11 .cse6 .cse12 .cse13 .cse1 .cse14 .cse15) (and .cse2 .cse3 (= 0 ~p_dw_st~0) .cse6 .cse7 .cse0 .cse4 .cse5) (and .cse0 .cse20 .cse2 .cse6) (< |old(~q_free~0)| 1) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse7 .cse12 .cse13 .cse1 .cse14 .cse15 .cse5) (and (and .cse8 .cse0 .cse4 .cse9 .cse6 .cse7) .cse16 .cse1 .cse3) (and .cse0 .cse17 .cse1 .cse3 .cse4 .cse19 .cse5 .cse11 .cse6) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-18 16:00:23,650 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:00:23,650 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~c_num_read~0 0) (<= ~q_req_up~0 0) (= ~q_free~0 0) (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~q_read_ev~0 ~q_write_ev~0) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) [2018-11-18 16:00:23,651 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:00:23,651 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:00:23,651 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2018-11-18 16:00:23,651 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2018-11-18 16:00:23,651 INFO L425 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2018-11-18 16:00:23,651 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-18 16:00:23,651 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-18 16:00:23,651 INFO L428 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2018-11-18 16:00:23,651 INFO L421 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse26 (+ ~c_num_read~0 1)) (.cse21 (= 1 ~c_dr_pc~0))) (let ((.cse5 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (not (= 1 ~p_num_write~0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse20 (not (= 0 ~p_num_write~0))) (.cse12 (< ~p_num_write~0 ~c_num_read~0)) (.cse13 (< ~q_free~0 1)) (.cse16 (< 1 ~q_free~0)) (.cse17 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (not (= ~p_dw_st~0 0))) (.cse23 (= 0 ~c_dr_st~0)) (.cse11 (< ~q_write_ev~0 2)) (.cse14 (not .cse21)) (.cse7 (= 1 ~q_req_up~0)) (.cse24 (< ~p_num_write~0 .cse26)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse25 (< .cse26 ~p_num_write~0)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse9 (= ~p_dw_pc~0 1)) (.cse3 (not (= ~p_dw_st~0 2))) (.cse19 (< 0 ~q_req_up~0)) (.cse6 (not (= ~q_free~0 0))) (.cse15 (not (= 2 ~c_dr_st~0))) (.cse4 (= 0 is_do_write_p_triggered_~__retres1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (= ~q_read_ev~0 1) (or .cse11 .cse12 .cse1 .cse13 .cse0 .cse14 .cse15 .cse3 .cse16 .cse17 .cse18 .cse19) .cse4) (or .cse0 .cse1 .cse2 .cse20 .cse5 .cse19 .cse21 .cse13 .cse4 .cse22 .cse9 .cse10 .cse16 .cse18) (or .cse11 .cse1 .cse0 .cse6 .cse7 .cse23 .cse4 .cse2 .cse3) (or .cse0 .cse1 .cse14 .cse3 .cse4 .cse12 .cse11 .cse13 .cse7 .cse23 .cse9 .cse16 .cse17 .cse18) (or .cse11 .cse1 .cse0 .cse4 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 .cse19) (or .cse21 .cse1 .cse0 .cse6 .cse23 .cse4 (and (= 1 ~p_dw_pc~0) (not (= 0 ~q_read_ev~0)))) (or .cse21 .cse1 .cse13 .cse0 .cse4 .cse23 .cse22 .cse9 .cse10 .cse16 .cse20 .cse18) (or .cse21 .cse1 .cse0 .cse6 .cse23 .cse2 .cse4) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse12 .cse11 .cse13 .cse7 .cse23 .cse4 .cse16 .cse17 .cse18) (or .cse4 .cse11 .cse1 .cse0 .cse6 .cse7 .cse23 .cse2 .cse22 .cse9) (or .cse11 .cse1 .cse0 .cse6 .cse7 .cse4 .cse23 .cse9 .cse3) (or .cse24 .cse11 .cse1 .cse0 .cse4 .cse14 .cse6 .cse7 .cse25 .cse9 .cse3) (or .cse24 .cse0 .cse1 .cse25 .cse2 (not .cse9) .cse3 (= 0 ~q_write_ev~0) .cse19 .cse6 .cse15 .cse4)))) [2018-11-18 16:00:23,652 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2018-11-18 16:00:23,652 INFO L425 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2018-11-18 16:00:23,652 INFO L425 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2018-11-18 16:00:23,652 INFO L425 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2018-11-18 16:00:23,652 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 201) no Hoare annotation was computed. [2018-11-18 16:00:23,652 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2018-11-18 16:00:23,652 INFO L421 ceAbstractionStarter]: At program point L193(line 193) the Hoare annotation is: (let ((.cse17 (= 1 |old(~c_dr_pc~0)|)) (.cse18 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~p_dw_pc~0 1))) (let ((.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse14 (= 1 |old(~q_req_up~0)|)) (.cse5 (not (= 1 ~p_num_write~0))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse16 (< 0 |old(~q_req_up~0)|)) (.cse10 (< ~q_write_ev~0 2)) (.cse8 (not .cse13)) (.cse11 (< ~p_num_write~0 .cse18)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse12 (not .cse17)) (.cse4 (not (= ~q_read_ev~0 2))) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse15 (< .cse18 ~p_num_write~0)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~p_dw_st~0 2)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 (or .cse11 (or .cse0 .cse1 .cse12 .cse13) .cse2 .cse14 .cse15 .cse3 .cse6)) (or .cse1 .cse0 .cse4 (not (= 0 ~p_num_write~0)) .cse9 .cse16 .cse17 (< |old(~q_free~0)| 1) .cse3 (not (= ~p_dw_st~0 0)) .cse13 .cse7 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse1 .cse0 .cse4 .cse6 .cse9 .cse2 .cse14 .cse3 .cse5 .cse7) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse16) (or .cse10 .cse8 (or .cse11 (or .cse0 .cse1 (or .cse12 .cse4)) .cse2 .cse15 .cse3 .cse6))))) [2018-11-18 16:00:23,654 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2018-11-18 16:00:23,654 INFO L421 ceAbstractionStarter]: At program point do_read_cENTRY(lines 155 207) the Hoare annotation is: (let ((.cse21 (not (= ~c_dr_pc~0 1))) (.cse22 (= ~c_num_read~0 0)) (.cse20 (not (= 0 ~c_dr_st~0))) (.cse24 (= ~q_free~0 0)) (.cse23 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse26 (+ |old(~c_num_read~0)| 1)) (.cse18 (= ~p_dw_pc~0 1))) (let ((.cse9 (not .cse18)) (.cse12 (< ~q_write_ev~0 2)) (.cse14 (< ~p_num_write~0 .cse26)) (.cse15 (not .cse0)) (.cse16 (< .cse26 ~p_num_write~0)) (.cse13 (let ((.cse25 (+ ~c_num_read~0 1))) (and (<= .cse25 ~p_num_write~0) .cse20 (= 1 ~c_dr_pc~0) .cse24 .cse23 (<= ~p_num_write~0 .cse25)))) (.cse17 (< 0 |old(~q_req_up~0)|)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse10 (and .cse21 .cse20 .cse22 .cse24 .cse23)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse7 (not (= ~p_dw_st~0 2))) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse19 (= 1 |old(~q_req_up~0)|)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11) (or .cse12 .cse9 .cse13 (or .cse14 (or .cse1 .cse2 (or .cse15 .cse5)) .cse3 .cse16 .cse4 .cse7)) (or .cse1 .cse2 .cse5 .cse7 .cse17 .cse0 .cse12 .cse3 .cse4 .cse10 .cse6 .cse18 .cse8) (or .cse12 (or .cse14 (or .cse1 .cse2 .cse15 .cse18) .cse3 .cse19 .cse16 .cse4 .cse7) .cse13) (or .cse2 .cse1 .cse5 (not (= 0 ~p_num_write~0)) .cse11 (and .cse20 (<= 1 ~q_free~0) .cse21 .cse22 .cse23 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0)) .cse17 .cse0 (< |old(~q_free~0)| 1) .cse4 (not (= ~p_dw_st~0 0)) .cse18 .cse8 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse2 .cse1 .cse10 .cse5 .cse7 .cse11 .cse0 .cse3 .cse19 .cse4 .cse6 .cse8)))) [2018-11-18 16:00:23,654 INFO L425 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2018-11-18 16:00:23,654 INFO L421 ceAbstractionStarter]: At program point L202(lines 155 207) the Hoare annotation is: (let ((.cse24 (= 1 |old(~c_dr_pc~0)|)) (.cse26 (+ |old(~c_num_read~0)| 1)) (.cse5 (= ~p_dw_pc~0 1)) (.cse17 (= 2 ~c_dr_st~0)) (.cse20 (= 1 ~c_dr_pc~0)) (.cse18 (= ~c_num_read~0 1)) (.cse19 (<= 1 ~q_free~0)) (.cse21 (<= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse16 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse7 (= 1 |old(~q_req_up~0)|)) (.cse23 (< 0 |old(~q_req_up~0)|)) (.cse13 (not (= 1 ~p_num_write~0))) (.cse14 (not (= 0 |old(~c_num_read~0)|))) (.cse25 (and .cse17 .cse20 .cse18 .cse19 .cse21 .cse22)) (.cse0 (< ~q_write_ev~0 2)) (.cse11 (and (<= ~p_num_write~0 ~c_num_read~0) .cse17 .cse20 .cse19 (<= ~c_num_read~0 ~p_num_write~0) .cse21 .cse22)) (.cse15 (not .cse5)) (.cse1 (< ~p_num_write~0 .cse26)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse4 (not .cse24)) (.cse12 (not (= ~q_read_ev~0 2))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse8 (< .cse26 ~p_num_write~0)) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse10 (not (= ~p_dw_st~0 2)))) (and (or .cse0 (or .cse1 (or .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or (or .cse2 .cse3 .cse6 .cse9 .cse12 .cse13 .cse10 .cse14) .cse15 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)) (or .cse3 .cse2 (and .cse17 .cse19 .cse20 (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) .cse21 .cse22) .cse12 (not (= 0 ~p_num_write~0)) .cse16 .cse23 .cse24 (< |old(~q_free~0)| 1) .cse9 (not (= ~p_dw_st~0 0)) .cse5 .cse14 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse3 .cse2 .cse12 .cse10 .cse16 .cse6 .cse7 .cse9 .cse25 .cse13 .cse14) (or .cse2 .cse3 .cse12 .cse10 .cse23 .cse0 .cse6 .cse9 .cse13 .cse5 .cse14 .cse25) (or .cse0 .cse11 .cse15 (or .cse1 (or .cse2 .cse3 (or .cse4 .cse12)) .cse6 .cse8 .cse9 .cse10))))) [2018-11-18 16:00:23,656 INFO L421 ceAbstractionStarter]: At program point L198(line 198) the Hoare annotation is: (let ((.cse17 (= 1 |old(~c_dr_pc~0)|)) (.cse18 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~p_dw_pc~0 1))) (let ((.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse14 (= 1 |old(~q_req_up~0)|)) (.cse5 (not (= 1 ~p_num_write~0))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse16 (< 0 |old(~q_req_up~0)|)) (.cse10 (< ~q_write_ev~0 2)) (.cse8 (not .cse13)) (.cse11 (< ~p_num_write~0 .cse18)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse12 (not .cse17)) (.cse4 (not (= ~q_read_ev~0 2))) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse15 (< .cse18 ~p_num_write~0)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~p_dw_st~0 2)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 (or .cse11 (or .cse0 .cse1 .cse12 .cse13) .cse2 .cse14 .cse15 .cse3 .cse6)) (or .cse1 .cse0 .cse4 (not (= 0 ~p_num_write~0)) .cse9 .cse16 .cse17 (< |old(~q_free~0)| 1) .cse3 (not (= ~p_dw_st~0 0)) .cse13 .cse7 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse1 .cse0 .cse4 .cse6 .cse9 .cse2 .cse14 .cse3 .cse5 .cse7) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse16) (or .cse10 .cse8 (or .cse11 (or .cse0 .cse1 (or .cse12 .cse4)) .cse2 .cse15 .cse3 .cse6))))) [2018-11-18 16:00:23,656 INFO L421 ceAbstractionStarter]: At program point L198-1(lines 158 206) the Hoare annotation is: (let ((.cse26 (= 1 |old(~c_dr_pc~0)|)) (.cse27 (+ |old(~c_num_read~0)| 1)) (.cse22 (= ~c_num_read~0 0)) (.cse23 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse20 (not (= 0 ~c_dr_st~0))) (.cse21 (<= 1 ~q_free~0)) (.cse24 (<= ~q_free~0 1)) (.cse25 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse2 (and .cse20 (= ~c_num_read~0 1) .cse21 .cse24 .cse25)) (.cse10 (not (= 1 ~p_num_write~0))) (.cse13 (not .cse11)) (.cse6 (and .cse20 .cse22 (= ~q_free~0 0) .cse23)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse18 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (< 0 |old(~q_req_up~0)|)) (.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (< ~q_write_ev~0 2)) (.cse14 (< ~p_num_write~0 .cse27)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse15 (not .cse26)) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse19 (= 1 |old(~q_req_up~0)|)) (.cse16 (< .cse27 ~p_num_write~0)) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse4 (not (= ~p_dw_st~0 2))) (.cse17 (and (<= ~p_num_write~0 ~c_num_read~0) .cse20 .cse21 (<= ~c_num_read~0 ~p_num_write~0) .cse24 .cse25))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse7 .cse13 (or .cse14 (or .cse0 .cse1 (or .cse15 .cse3)) .cse8 .cse16 .cse9 .cse4) .cse17) (or .cse6 .cse1 .cse0 .cse3 .cse4 .cse18 .cse8 .cse2 .cse19 .cse9 .cse10 .cse12) (or .cse2 (or .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse4 .cse12) .cse13 .cse6 .cse18) (or .cse1 .cse0 .cse3 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (not (= 0 ~p_num_write~0)) .cse18 .cse5 .cse26 (< |old(~q_free~0)| 1) .cse9 (not (= ~p_dw_st~0 0)) .cse11 .cse12 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse7 (or .cse14 (or .cse0 .cse1 .cse15 .cse11) .cse8 .cse19 .cse16 .cse9 .cse4) .cse17)))) [2018-11-18 16:00:23,659 INFO L421 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse18 (= ~p_dw_pc~0 1)) (.cse5 (= 1 |old(~c_dr_pc~0)|)) (.cse20 (+ |old(~c_num_read~0)| 1))) (let ((.cse14 (< ~p_num_write~0 .cse20)) (.cse15 (not .cse5)) (.cse7 (= 1 |old(~q_req_up~0)|)) (.cse16 (< .cse20 ~p_num_write~0)) (.cse13 (let ((.cse19 (+ ~c_num_read~0 1))) (and (<= .cse19 ~p_num_write~0) (not (= 0 ~c_dr_st~0)) (= 1 ~c_dr_pc~0) (= ~q_free~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~p_num_write~0 .cse19)))) (.cse12 (not .cse18)) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse8 (= 0 |old(~c_dr_st~0)|)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse9 (not (= 1 ~p_num_write~0))) (.cse3 (not (= ~p_dw_st~0 2))) (.cse10 (not (= 0 |old(~c_num_read~0)|))) (.cse17 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse13 (or .cse14 (or .cse1 .cse0 (or .cse15 .cse2)) .cse6 .cse16 .cse8 .cse3)) (or .cse0 .cse1 .cse2 (not (= 0 ~p_num_write~0)) .cse4 .cse17 .cse5 (< |old(~q_free~0)| 1) .cse8 (not (= ~p_dw_st~0 0)) .cse18 .cse10 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse11 (or .cse14 (or .cse1 .cse0 .cse15 .cse18) .cse6 .cse7 .cse16 .cse8 .cse3) .cse13) (or (or .cse5 .cse1 .cse0 .cse6 .cse8 .cse2 .cse9 .cse3 .cse10) .cse12 .cse4) (or .cse5 .cse11 .cse1 .cse0 .cse6 .cse8 .cse2 .cse9 .cse18 .cse3 .cse10 .cse17)))) [2018-11-18 16:00:23,659 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2018-11-18 16:00:23,659 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2018-11-18 16:00:23,659 INFO L421 ceAbstractionStarter]: At program point init_modelENTRY(lines 438 454) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (not (= ~p_dw_i~0 1)) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= ~q_buf_0~0 ~p_last_write~0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= ~p_dw_st~0 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (< 0 ~q_req_up~0)) [2018-11-18 16:00:23,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:00:23 BoogieIcfgContainer [2018-11-18 16:00:23,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:00:23,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:00:23,716 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:00:23,716 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:00:23,716 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:59:01" (3/4) ... [2018-11-18 16:00:23,719 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:00:23,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-18 16:00:23,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-18 16:00:23,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-18 16:00:23,725 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-18 16:00:23,725 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-18 16:00:23,725 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-18 16:00:23,731 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-18 16:00:23,732 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 16:00:23,751 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(p_dw_i == 1) || (((2 == p_dw_st && 2 <= q_write_ev) && !(q_req_up == 1)) && ((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || ((((((q_free == 0 && 2 == p_dw_st) && !(0 == c_dr_st)) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && !(q_req_up == 1)) && p_last_write == q_buf_0)) || ((((((((p_last_write == q_buf_0 && 2 == q_read_ev) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(p_dw_pc == 1)) && 1 == p_num_write) && !(q_req_up == 1)) && q_read_ev == q_write_ev)) || ((((((q_free == 0 && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 == p_dw_st) && 2 <= q_write_ev) && !(q_req_up == 1))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 2 == c_dr_st) && !(0 == q_write_ev)) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || !(\old(q_read_ev) == 2)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(q_read_ev) == \old(q_write_ev))) || ((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 2 <= q_write_ev) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write)) || ((((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && 0 == p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1)) && 1 == p_dw_pc)) || (((((((!(0 == c_dr_st) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && !(p_dw_pc == 1)) && !(q_req_up == 1))) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((((((((((1 <= q_free && !(c_dr_pc == 1)) && p_dw_pc == \old(p_dw_pc)) && q_read_ev == \old(q_read_ev)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && q_read_ev == q_write_ev) && 0 == p_num_write)) || \old(q_free) < 1) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || ((((((((c_num_read == 0 && q_free == 0) && !(p_dw_pc == 1)) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_req_up <= 0) && 2 == p_dw_st) && 2 <= q_write_ev)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 == p_dw_st) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && p_num_write <= c_num_read + 1) && !(q_req_up == 1)) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0) [2018-11-18 16:00:23,752 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) && ((((((((((((((((((((((((((((1 <= q_free && !(c_dr_pc == 1)) && p_dw_pc == \old(p_dw_pc)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write) || !(p_dw_i == 1)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || ((((((((((tmp___1 == 1 && 2 == c_dr_st) && 1 <= q_free) && p_dw_pc == \old(p_dw_pc)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || (((((((2 == c_dr_st && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && 1 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || (((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((((((2 == c_dr_st && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 == p_dw_pc) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && 1 == p_num_write) && c_last_read == p_last_write)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0))) && ((((((((((((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 1 == p_dw_pc) || !(\old(p_dw_pc) == 1)) || ((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) || !(\old(p_dw_pc) == 1) || (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 1 == p_dw_pc))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && c_last_read == p_last_write) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || (((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) [2018-11-18 16:00:23,752 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) && ((((((((((((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((((((((((((2 == c_dr_st && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || (((((((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 1 == p_dw_pc) || !(\old(p_dw_pc) == 1)) || ((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && ((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || !(\old(p_dw_pc) == 1) || (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || (((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) [2018-11-18 16:00:23,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && 1 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && 0 == p_num_write)) || !(0 == \old(p_num_write))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((1 <= q_free && !(0 == p_dw_st)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(q_req_up) == q_req_up) && q_free <= 1) && 0 == p_num_write)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_write))) && ((((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_write)) || (((((((1 <= q_free && !(0 == p_dw_st)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write))) && (((((((((((((1 == p_num_write || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || c_last_read == p_last_write) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || \old(q_free) < 1) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((q_free == 0 && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && !(p_dw_pc == 1)) && p_last_write == q_buf_0)) || (((((q_free == 0 && 1 == \old(p_dw_pc)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1))) && (((q_write_ev < 2 || (((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && q_free == 0) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1)) || !(\old(p_dw_pc) == 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((((((\old(p_dw_st) == 0 || (((((p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1) [2018-11-18 16:00:23,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == c_dr_st || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) || ((q_free == 0 && 1 == p_num_write) && p_last_write == q_buf_0)) && ((((((((((((p_last_write == q_buf_0 && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read))) && ((((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((p_num_write == \old(p_num_write) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || !(1 == \old(p_dw_pc)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((q_free == 0 && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0)) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || ((((p_last_write == q_buf_0 && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(c_last_read == \old(p_last_write))) [2018-11-18 16:00:23,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && (p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) || q_write_ev < 2) || !(\old(p_dw_pc) == 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up) && 0 == p_num_write))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || (((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((q_free == 0 && 1 == \old(p_dw_pc)) && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && ((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && ((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) [2018-11-18 16:00:23,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) && (((q_write_ev < 2 || !(p_dw_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up) || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read)))) && ((((((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || ((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(p_dw_pc == 1)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == q_write_ev))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || (((((!(0 == c_dr_st) && 1 <= q_free) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) [2018-11-18 16:00:23,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || ((((((2 == c_dr_st && 1 <= q_free) && 1 == c_dr_pc) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(1 == p_num_write)) || !(0 == \old(c_num_read)))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && (((q_write_ev < 2 || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) || !(p_dw_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) [2018-11-18 16:00:23,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) && (((q_write_ev < 2 || !(p_dw_pc == 1)) || (((((c_num_read + 1 <= p_num_write && !(0 == c_dr_st)) && 1 == c_dr_pc) && q_free == 0) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((c_num_read + 1 <= p_num_write && !(0 == c_dr_st)) && 1 == c_dr_pc) && q_free == 0) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && ((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev))) && (((((((((((1 == \old(c_dr_pc) || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || 0 < \old(q_req_up)) [2018-11-18 16:00:23,799 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6ab63f11-a244-4e22-bed1-e7cc8f369ab7/bin-2019/uautomizer/witness.graphml [2018-11-18 16:00:23,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:00:23,800 INFO L168 Benchmark]: Toolchain (without parser) took 83315.74 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 958.5 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-18 16:00:23,800 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:00:23,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.47 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 942.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:00:23,800 INFO L168 Benchmark]: Boogie Preprocessor took 67.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:00:23,800 INFO L168 Benchmark]: RCFGBuilder took 401.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:00:23,801 INFO L168 Benchmark]: TraceAbstraction took 82563.85 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.2 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-18 16:00:23,801 INFO L168 Benchmark]: Witness Printer took 83.22 ms. Allocated memory is still 4.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:00:23,802 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.47 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 942.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 401.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 82563.85 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.2 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 83.22 ms. Allocated memory is still 4.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 158]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) && (((q_write_ev < 2 || !(p_dw_pc == 1)) || (((((c_num_read + 1 <= p_num_write && !(0 == c_dr_st)) && 1 == c_dr_pc) && q_free == 0) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((c_num_read + 1 <= p_num_write && !(0 == c_dr_st)) && 1 == c_dr_pc) && q_free == 0) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && ((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev))) && (((((((((((1 == \old(c_dr_pc) || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || 0 < \old(q_req_up)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((((((0 == c_dr_st || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) || ((q_free == 0 && 1 == p_num_write) && p_last_write == q_buf_0)) && ((((((((((((p_last_write == q_buf_0 && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read))) && ((((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((p_num_write == \old(p_num_write) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || !(1 == \old(p_dw_pc)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((q_free == 0 && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0)) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || ((((p_last_write == q_buf_0 && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(c_last_read == \old(p_last_write))) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && 1 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && 0 == p_num_write)) || !(0 == \old(p_num_write))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((1 <= q_free && !(0 == p_dw_st)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(q_req_up) == q_req_up) && q_free <= 1) && 0 == p_num_write)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_write))) && ((((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_write)) || (((((((1 <= q_free && !(0 == p_dw_st)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write))) && (((((((((((((1 == p_num_write || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || c_last_read == p_last_write) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || \old(q_free) < 1) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((q_free == 0 && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && !(p_dw_pc == 1)) && p_last_write == q_buf_0)) || (((((q_free == 0 && 1 == \old(p_dw_pc)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1))) && (((q_write_ev < 2 || (((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && q_free == 0) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1)) || !(\old(p_dw_pc) == 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((((((\old(p_dw_st) == 0 || (((((p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) && ((((((((((((((((((((((((((((1 <= q_free && !(c_dr_pc == 1)) && p_dw_pc == \old(p_dw_pc)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write) || !(p_dw_i == 1)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || ((((((((((tmp___1 == 1 && 2 == c_dr_st) && 1 <= q_free) && p_dw_pc == \old(p_dw_pc)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || (((((((2 == c_dr_st && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && 1 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || (((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((((((2 == c_dr_st && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 == p_dw_pc) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && 1 == p_num_write) && c_last_read == p_last_write)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0))) && ((((((((((((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 1 == p_dw_pc) || !(\old(p_dw_pc) == 1)) || ((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) || !(\old(p_dw_pc) == 1) || (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 1 == p_dw_pc))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && c_last_read == p_last_write) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || (((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 == __retres1) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || 1 == q_req_up) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == c_num_read)) && ((q_read_ev == 1 || ((((((((((q_write_ev < 2 || p_num_write < c_num_read) || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(p_dw_st == 2)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) || 0 < q_req_up) || 0 == __retres1)) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < q_req_up) || 1 == c_dr_pc) || q_free < 1) || 0 == __retres1) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || 0 == __retres1) || !(q_read_ev == 2)) || !(p_dw_st == 2))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(p_dw_st == 2)) || 0 == __retres1) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || 1 == q_req_up) || 0 == c_dr_st) || p_dw_pc == 1) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && ((((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || !(q_free == 0)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == c_num_read)) || 0 < q_req_up)) && ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || 0 == __retres1) || (1 == p_dw_pc && !(0 == q_read_ev)))) && (((((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(0 == p_num_write)) || !(c_last_read == p_last_write))) && ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || !(q_read_ev == 2)) || 0 == __retres1)) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || 1 == q_req_up) || 0 == c_dr_st) || 0 == __retres1) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && (((((((((0 == __retres1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || p_dw_pc == 1)) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == __retres1) || 0 == c_dr_st) || p_dw_pc == 1) || !(p_dw_st == 2))) && ((((((((((p_num_write < c_num_read + 1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || !(1 == c_dr_pc)) || !(q_free == 0)) || 1 == q_req_up) || c_num_read + 1 < p_num_write) || p_dw_pc == 1) || !(p_dw_st == 2))) && (((((((((((p_num_write < c_num_read + 1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || c_num_read + 1 < p_num_write) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || 0 == q_write_ev) || 0 < q_req_up) || !(q_free == 0)) || !(2 == c_dr_st)) || 0 == __retres1) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || ((((((2 == c_dr_st && 1 <= q_free) && 1 == c_dr_pc) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(1 == p_num_write)) || !(0 == \old(c_num_read)))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && (((q_write_ev < 2 || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) || !(p_dw_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(p_dw_i == 1) || (((2 == p_dw_st && 2 <= q_write_ev) && !(q_req_up == 1)) && ((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || ((((((q_free == 0 && 2 == p_dw_st) && !(0 == c_dr_st)) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && !(q_req_up == 1)) && p_last_write == q_buf_0)) || ((((((((p_last_write == q_buf_0 && 2 == q_read_ev) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(p_dw_pc == 1)) && 1 == p_num_write) && !(q_req_up == 1)) && q_read_ev == q_write_ev)) || ((((((q_free == 0 && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 == p_dw_st) && 2 <= q_write_ev) && !(q_req_up == 1))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 2 == c_dr_st) && !(0 == q_write_ev)) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || !(\old(q_read_ev) == 2)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(q_read_ev) == \old(q_write_ev))) || ((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 2 <= q_write_ev) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write)) || ((((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && 0 == p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1)) && 1 == p_dw_pc)) || (((((((!(0 == c_dr_st) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && !(p_dw_pc == 1)) && !(q_req_up == 1))) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((((((((((1 <= q_free && !(c_dr_pc == 1)) && p_dw_pc == \old(p_dw_pc)) && q_read_ev == \old(q_read_ev)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && q_read_ev == q_write_ev) && 0 == p_num_write)) || \old(q_free) < 1) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || ((((((((c_num_read == 0 && q_free == 0) && !(p_dw_pc == 1)) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_req_up <= 0) && 2 == p_dw_st) && 2 <= q_write_ev)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 == p_dw_st) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && p_num_write <= c_num_read + 1) && !(q_req_up == 1)) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && (p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) || q_write_ev < 2) || !(\old(p_dw_pc) == 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up) && 0 == p_num_write))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || (((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((q_free == 0 && 1 == \old(p_dw_pc)) && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && ((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && ((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) && ((((((((((((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((((((((((((2 == c_dr_st && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || (((((((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 1 == p_dw_pc) || !(\old(p_dw_pc) == 1)) || ((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && ((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || !(\old(p_dw_pc) == 1) || (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || (((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: ((((((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 0)) && (((((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 1 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(0 == p_num_write)) || !(c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || 1 == __retres1) || p_dw_pc == 1)) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(0 == c_dr_st)) || 1 == c_dr_pc) || !(q_free == 0)) || __retres1 == 1) || !(1 == p_num_write)) || !(0 == c_num_read))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < q_req_up) || 1 == c_dr_pc) || q_free < 1) || !(p_dw_st == 0)) || 1 == __retres1) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || 1 == __retres1) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < q_req_up) || q_free < 1) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && (__retres1 == 1 || !(p_dw_pc == 1) || (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || 1 == q_req_up) || !(p_dw_st == 0)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && (((q_req_up <= 0 && !(0 == c_dr_st)) || __retres1 == 1) || (((((((((p_num_write < c_num_read + 1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_free == 0)) || 1 == q_req_up) || c_num_read + 1 < p_num_write) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) && (((q_write_ev < 2 || !(p_dw_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up) || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read)))) && ((((((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || ((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(p_dw_pc == 1)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == q_write_ev))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || (((((!(0 == c_dr_st) && 1 <= q_free) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((((((((((((((!(q_read_ev == 1) || (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == p_dw_pc)) || 0 < q_req_up) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || !(1 == c_dr_pc)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) || 0 == __retres1) && (((((((((((!(q_buf_0 == p_last_write) || q_free < 1) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 0 == __retres1) || 1 < q_free) || !(0 == p_num_write)) || 1 == c_dr_pc) || !(c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || p_dw_pc == 1) || 0 == __retres1)) && (((((((((((((0 == __retres1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < q_req_up) || 1 == c_dr_pc) || q_free < 1) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || 0 == __retres1) || !(p_dw_st == 2)) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || 1 == q_req_up) || 0 == c_dr_st) || !(1 == c_dr_pc)) || p_dw_pc == 1) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && ((((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == c_num_read)) || !(q_read_ev == 2)) || 0 < q_req_up)) && (((q_write_ev < 2 || ((((((((p_num_write < c_num_read || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || !(2 == c_dr_st)) || !(1 == c_dr_pc)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) || !(p_dw_st == 2)) || 0 < q_req_up) || 0 == __retres1)) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || p_dw_pc == 1) || !(p_dw_st == 2)) || 0 == __retres1)) && ((((((((((p_num_write < c_num_read + 1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || c_num_read + 1 < p_num_write) || 0 == __retres1) || !(1 == c_dr_pc)) || p_dw_pc == 1) || !(p_dw_st == 2))) && ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(p_dw_st == 2)) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || 1 == q_req_up) || 0 == __retres1) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == c_dr_st) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && (((((0 == __retres1 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || 1 == c_dr_pc)) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == __retres1) || !(p_dw_st == 2))) && ((((q_write_ev < 2 || 1 == q_req_up) || ((((((((p_num_write < c_num_read || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(1 == c_dr_pc)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) || !(p_dw_st == 2)) || !(q_read_ev == 1)) || 0 == __retres1)) && ((((((((((((p_num_write < c_num_read + 1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || c_num_read + 1 < p_num_write) || !(p_dw_st == 2)) || 0 == q_write_ev) || !(1 == p_dw_pc)) || 0 < q_req_up) || 1 == q_write_ev) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == __retres1)) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || 0 == __retres1) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || 1 == q_req_up) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == c_num_read)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 143 locations, 1 error locations. SAFE Result, 82.4s OverallTime, 20 OverallIterations, 8 TraceHistogramMax, 15.6s AutomataDifference, 0.0s DeadEndRemovalTime, 56.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 4173 SDtfs, 8503 SDslu, 6073 SDs, 0 SdLazy, 9233 SolverSat, 2954 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1783 GetRequests, 1596 SyntacticMatches, 14 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26785occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 11704 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 45872 PreInvPairs, 53302 NumberOfFragments, 25377 HoareAnnotationTreeSize, 45872 FomulaSimplifications, 365926 FormulaSimplificationTreeSizeReduction, 8.1s HoareSimplificationTime, 56 FomulaSimplificationsInter, 410801 FormulaSimplificationTreeSizeReductionInter, 48.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 4100 NumberOfCodeBlocks, 4100 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4073 ConstructedInterpolants, 0 QuantifiedInterpolants, 1160662 SizeOfPredicates, 11 NumberOfNonLiveVariables, 6996 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 2491/2573 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...