./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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-635dfa2 [2018-12-01 08:20:22,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 08:20:22,447 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 08:20:22,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 08:20:22,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 08:20:22,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 08:20:22,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 08:20:22,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 08:20:22,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 08:20:22,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 08:20:22,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 08:20:22,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 08:20:22,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 08:20:22,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 08:20:22,462 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 08:20:22,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 08:20:22,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 08:20:22,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 08:20:22,465 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 08:20:22,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 08:20:22,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 08:20:22,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 08:20:22,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 08:20:22,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 08:20:22,468 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 08:20:22,468 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 08:20:22,469 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 08:20:22,469 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 08:20:22,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 08:20:22,470 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 08:20:22,470 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 08:20:22,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 08:20:22,471 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 08:20:22,471 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 08:20:22,471 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 08:20:22,472 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 08:20:22,472 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 08:20:22,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 08:20:22,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 08:20:22,483 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 08:20:22,483 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 08:20:22,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 08:20:22,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 08:20:22,484 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 08:20:22,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 08:20:22,484 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 08:20:22,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 08:20:22,484 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 08:20:22,484 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 08:20:22,485 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 08:20:22,485 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 08:20:22,485 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 08:20:22,485 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 08:20:22,485 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 08:20:22,485 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 08:20:22,486 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 08:20:22,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 08:20:22,486 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 08:20:22,486 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 08:20:22,486 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 08:20:22,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 08:20:22,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 08:20:22,487 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 08:20:22,487 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 08:20:22,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 08:20:22,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 08:20:22,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 08:20:22,487 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_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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-12-01 08:20:22,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 08:20:22,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 08:20:22,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 08:20:22,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 08:20:22,520 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 08:20:22,521 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-01 08:20:22,553 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/bin-2019/uautomizer/data/685170fce/345648392fa84f5ea637835a3637a1eb/FLAG8f0c85579 [2018-12-01 08:20:23,001 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 08:20:23,001 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-01 08:20:23,006 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/bin-2019/uautomizer/data/685170fce/345648392fa84f5ea637835a3637a1eb/FLAG8f0c85579 [2018-12-01 08:20:23,015 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/bin-2019/uautomizer/data/685170fce/345648392fa84f5ea637835a3637a1eb [2018-12-01 08:20:23,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 08:20:23,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 08:20:23,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 08:20:23,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 08:20:23,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 08:20:23,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537737cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23, skipping insertion in model container [2018-12-01 08:20:23,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 08:20:23,041 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 08:20:23,140 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 08:20:23,143 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 08:20:23,164 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 08:20:23,173 INFO L195 MainTranslator]: Completed translation [2018-12-01 08:20:23,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23 WrapperNode [2018-12-01 08:20:23,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 08:20:23,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 08:20:23,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 08:20:23,174 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 08:20:23,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 08:20:23,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 08:20:23,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 08:20:23,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 08:20:23,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (1/1) ... [2018-12-01 08:20:23,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 08:20:23,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 08:20:23,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 08:20:23,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 08:20:23,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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-12-01 08:20:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-01 08:20:23,269 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-01 08:20:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-01 08:20:23,269 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-01 08:20:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-12-01 08:20:23,269 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-12-01 08:20:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-01 08:20:23,269 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-01 08:20:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-01 08:20:23,269 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-01 08:20:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 08:20:23,269 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 08:20:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-12-01 08:20:23,270 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-12-01 08:20:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-01 08:20:23,270 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-01 08:20:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 08:20:23,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 08:20:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-01 08:20:23,270 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-01 08:20:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-01 08:20:23,270 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-01 08:20:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-12-01 08:20:23,270 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-12-01 08:20:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-01 08:20:23,270 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-01 08:20:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-01 08:20:23,270 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-01 08:20:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-01 08:20:23,271 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-01 08:20:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 08:20:23,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 08:20:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-12-01 08:20:23,271 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-12-01 08:20:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-12-01 08:20:23,271 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-12-01 08:20:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-01 08:20:23,271 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-01 08:20:23,473 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 08:20:23,473 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-01 08:20:23,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:20:23 BoogieIcfgContainer [2018-12-01 08:20:23,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 08:20:23,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 08:20:23,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 08:20:23,476 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 08:20:23,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 08:20:23" (1/3) ... [2018-12-01 08:20:23,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369319fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 08:20:23, skipping insertion in model container [2018-12-01 08:20:23,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:20:23" (2/3) ... [2018-12-01 08:20:23,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369319fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 08:20:23, skipping insertion in model container [2018-12-01 08:20:23,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:20:23" (3/3) ... [2018-12-01 08:20:23,478 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-01 08:20:23,484 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 08:20:23,489 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 08:20:23,498 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 08:20:23,516 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 08:20:23,517 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 08:20:23,517 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 08:20:23,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 08:20:23,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 08:20:23,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 08:20:23,517 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 08:20:23,517 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 08:20:23,517 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 08:20:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-12-01 08:20:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 08:20:23,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:23,535 INFO L402 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] [2018-12-01 08:20:23,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:23,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash 11439179, now seen corresponding path program 1 times [2018-12-01 08:20:23,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:23,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:23,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:23,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:23,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:23,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:23,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 08:20:23,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 08:20:23,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 08:20:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:20:23,711 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 5 states. [2018-12-01 08:20:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:24,069 INFO L93 Difference]: Finished difference Result 379 states and 545 transitions. [2018-12-01 08:20:24,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 08:20:24,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-01 08:20:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:24,081 INFO L225 Difference]: With dead ends: 379 [2018-12-01 08:20:24,081 INFO L226 Difference]: Without dead ends: 252 [2018-12-01 08:20:24,084 INFO L631 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-12-01 08:20:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-12-01 08:20:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2018-12-01 08:20:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-01 08:20:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2018-12-01 08:20:24,133 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2018-12-01 08:20:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:24,134 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2018-12-01 08:20:24,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 08:20:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2018-12-01 08:20:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 08:20:24,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:24,136 INFO L402 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] [2018-12-01 08:20:24,136 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:24,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:24,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1438317323, now seen corresponding path program 1 times [2018-12-01 08:20:24,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:24,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:24,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:24,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:24,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:20:24,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:20:24,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:20:24,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:20:24,213 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2018-12-01 08:20:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:24,682 INFO L93 Difference]: Finished difference Result 628 states and 843 transitions. [2018-12-01 08:20:24,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 08:20:24,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-01 08:20:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:24,686 INFO L225 Difference]: With dead ends: 628 [2018-12-01 08:20:24,686 INFO L226 Difference]: Without dead ends: 422 [2018-12-01 08:20:24,688 INFO L631 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-12-01 08:20:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-12-01 08:20:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2018-12-01 08:20:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-01 08:20:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-12-01 08:20:24,720 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2018-12-01 08:20:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:24,721 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-12-01 08:20:24,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:20:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-12-01 08:20:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 08:20:24,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:24,723 INFO L402 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] [2018-12-01 08:20:24,724 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:24,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:24,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1469864563, now seen corresponding path program 1 times [2018-12-01 08:20:24,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:24,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:24,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:24,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:24,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:24,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:24,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:20:24,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:20:24,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:20:24,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:20:24,789 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2018-12-01 08:20:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:24,816 INFO L93 Difference]: Finished difference Result 685 states and 908 transitions. [2018-12-01 08:20:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 08:20:24,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-01 08:20:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:24,818 INFO L225 Difference]: With dead ends: 685 [2018-12-01 08:20:24,819 INFO L226 Difference]: Without dead ends: 369 [2018-12-01 08:20:24,820 INFO L631 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-12-01 08:20:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-01 08:20:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2018-12-01 08:20:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-01 08:20:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2018-12-01 08:20:24,834 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2018-12-01 08:20:24,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:24,835 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2018-12-01 08:20:24,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:20:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2018-12-01 08:20:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 08:20:24,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:24,836 INFO L402 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] [2018-12-01 08:20:24,836 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:24,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1221718069, now seen corresponding path program 1 times [2018-12-01 08:20:24,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:24,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:24,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:24,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:24,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:24,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:24,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 08:20:24,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 08:20:24,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 08:20:24,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 08:20:24,872 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2018-12-01 08:20:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:24,963 INFO L93 Difference]: Finished difference Result 991 states and 1319 transitions. [2018-12-01 08:20:24,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 08:20:24,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-01 08:20:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:24,966 INFO L225 Difference]: With dead ends: 991 [2018-12-01 08:20:24,967 INFO L226 Difference]: Without dead ends: 670 [2018-12-01 08:20:24,968 INFO L631 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-12-01 08:20:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-01 08:20:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-12-01 08:20:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-12-01 08:20:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2018-12-01 08:20:25,006 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2018-12-01 08:20:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:25,006 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2018-12-01 08:20:25,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 08:20:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2018-12-01 08:20:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 08:20:25,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:25,008 INFO L402 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] [2018-12-01 08:20:25,008 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:25,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2116320844, now seen corresponding path program 1 times [2018-12-01 08:20:25,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:25,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:25,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:25,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:25,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:25,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:25,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:20:25,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:20:25,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:20:25,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:20:25,053 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2018-12-01 08:20:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:25,111 INFO L93 Difference]: Finished difference Result 1280 states and 1639 transitions. [2018-12-01 08:20:25,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 08:20:25,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-01 08:20:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:25,114 INFO L225 Difference]: With dead ends: 1280 [2018-12-01 08:20:25,115 INFO L226 Difference]: Without dead ends: 672 [2018-12-01 08:20:25,116 INFO L631 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-12-01 08:20:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-12-01 08:20:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2018-12-01 08:20:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-12-01 08:20:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2018-12-01 08:20:25,151 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2018-12-01 08:20:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:25,151 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2018-12-01 08:20:25,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:20:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2018-12-01 08:20:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 08:20:25,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:25,153 INFO L402 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] [2018-12-01 08:20:25,153 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:25,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2043934286, now seen corresponding path program 1 times [2018-12-01 08:20:25,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:25,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:25,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:25,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:25,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:25,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:25,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:20:25,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:20:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:20:25,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:20:25,210 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2018-12-01 08:20:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:25,681 INFO L93 Difference]: Finished difference Result 1359 states and 1714 transitions. [2018-12-01 08:20:25,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 08:20:25,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-01 08:20:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:25,685 INFO L225 Difference]: With dead ends: 1359 [2018-12-01 08:20:25,685 INFO L226 Difference]: Without dead ends: 831 [2018-12-01 08:20:25,686 INFO L631 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-12-01 08:20:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-01 08:20:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2018-12-01 08:20:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-12-01 08:20:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2018-12-01 08:20:25,720 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2018-12-01 08:20:25,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:25,720 INFO L480 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2018-12-01 08:20:25,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:20:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2018-12-01 08:20:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 08:20:25,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:25,721 INFO L402 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] [2018-12-01 08:20:25,721 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:25,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1534461196, now seen corresponding path program 1 times [2018-12-01 08:20:25,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:25,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:25,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:25,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:25,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:25,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:25,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 08:20:25,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 08:20:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 08:20:25,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 08:20:25,742 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2018-12-01 08:20:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:25,798 INFO L93 Difference]: Finished difference Result 1887 states and 2417 transitions. [2018-12-01 08:20:25,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 08:20:25,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-12-01 08:20:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:25,804 INFO L225 Difference]: With dead ends: 1887 [2018-12-01 08:20:25,804 INFO L226 Difference]: Without dead ends: 1276 [2018-12-01 08:20:25,806 INFO L631 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-12-01 08:20:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-12-01 08:20:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2018-12-01 08:20:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-12-01 08:20:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2018-12-01 08:20:25,859 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2018-12-01 08:20:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:25,859 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2018-12-01 08:20:25,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 08:20:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2018-12-01 08:20:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-01 08:20:25,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:25,861 INFO L402 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] [2018-12-01 08:20:25,861 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:25,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:25,861 INFO L82 PathProgramCache]: Analyzing trace with hash -578263435, now seen corresponding path program 1 times [2018-12-01 08:20:25,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:25,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:25,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:25,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:25,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:25,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:25,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 08:20:25,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 08:20:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 08:20:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:20:25,918 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2018-12-01 08:20:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:26,046 INFO L93 Difference]: Finished difference Result 3564 states and 4733 transitions. [2018-12-01 08:20:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 08:20:26,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-12-01 08:20:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:26,053 INFO L225 Difference]: With dead ends: 3564 [2018-12-01 08:20:26,053 INFO L226 Difference]: Without dead ends: 2309 [2018-12-01 08:20:26,056 INFO L631 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-12-01 08:20:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-12-01 08:20:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2018-12-01 08:20:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-12-01 08:20:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2018-12-01 08:20:26,136 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2018-12-01 08:20:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:26,136 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2018-12-01 08:20:26,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 08:20:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2018-12-01 08:20:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-01 08:20:26,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:26,138 INFO L402 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] [2018-12-01 08:20:26,138 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:26,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1713093210, now seen corresponding path program 1 times [2018-12-01 08:20:26,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:26,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:26,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:26,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:26,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:26,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:26,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 08:20:26,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 08:20:26,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 08:20:26,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:20:26,187 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 5 states. [2018-12-01 08:20:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:26,672 INFO L93 Difference]: Finished difference Result 6956 states and 9741 transitions. [2018-12-01 08:20:26,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 08:20:26,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-12-01 08:20:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:26,694 INFO L225 Difference]: With dead ends: 6956 [2018-12-01 08:20:26,694 INFO L226 Difference]: Without dead ends: 4830 [2018-12-01 08:20:26,704 INFO L631 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-12-01 08:20:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2018-12-01 08:20:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4685. [2018-12-01 08:20:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4685 states. [2018-12-01 08:20:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2018-12-01 08:20:26,880 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 87 [2018-12-01 08:20:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:26,880 INFO L480 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2018-12-01 08:20:26,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 08:20:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2018-12-01 08:20:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-01 08:20:26,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:26,882 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 08:20:26,882 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:26,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1838635891, now seen corresponding path program 1 times [2018-12-01 08:20:26,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:26,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:26,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:26,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:26,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 08:20:26,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:26,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 08:20:26,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 08:20:26,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 08:20:26,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 08:20:26,901 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand 4 states. [2018-12-01 08:20:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:27,072 INFO L93 Difference]: Finished difference Result 9202 states and 12339 transitions. [2018-12-01 08:20:27,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 08:20:27,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-01 08:20:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:27,086 INFO L225 Difference]: With dead ends: 9202 [2018-12-01 08:20:27,086 INFO L226 Difference]: Without dead ends: 4574 [2018-12-01 08:20:27,095 INFO L631 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-12-01 08:20:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2018-12-01 08:20:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2018-12-01 08:20:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4574 states. [2018-12-01 08:20:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6130 transitions. [2018-12-01 08:20:27,237 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6130 transitions. Word has length 88 [2018-12-01 08:20:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:27,238 INFO L480 AbstractCegarLoop]: Abstraction has 4574 states and 6130 transitions. [2018-12-01 08:20:27,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 08:20:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6130 transitions. [2018-12-01 08:20:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-01 08:20:27,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:27,238 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 08:20:27,239 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:27,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:27,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1488980751, now seen corresponding path program 1 times [2018-12-01 08:20:27,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:27,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:27,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:27,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:27,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:27,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:27,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 08:20:27,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 08:20:27,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 08:20:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 08:20:27,270 INFO L87 Difference]: Start difference. First operand 4574 states and 6130 transitions. Second operand 4 states. [2018-12-01 08:20:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:27,605 INFO L93 Difference]: Finished difference Result 6044 states and 8116 transitions. [2018-12-01 08:20:27,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 08:20:27,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-01 08:20:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:27,629 INFO L225 Difference]: With dead ends: 6044 [2018-12-01 08:20:27,629 INFO L226 Difference]: Without dead ends: 6041 [2018-12-01 08:20:27,632 INFO L631 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-12-01 08:20:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2018-12-01 08:20:27,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 5872. [2018-12-01 08:20:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2018-12-01 08:20:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 7872 transitions. [2018-12-01 08:20:27,862 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 7872 transitions. Word has length 88 [2018-12-01 08:20:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:27,862 INFO L480 AbstractCegarLoop]: Abstraction has 5872 states and 7872 transitions. [2018-12-01 08:20:27,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 08:20:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 7872 transitions. [2018-12-01 08:20:27,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 08:20:27,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:27,863 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 08:20:27,863 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:27,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:27,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1085920016, now seen corresponding path program 1 times [2018-12-01 08:20:27,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:27,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:27,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:27,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:27,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:27,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 08:20:27,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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-12-01 08:20:27,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:27,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:20:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:28,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 08:20:28,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-12-01 08:20:28,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 08:20:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 08:20:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-01 08:20:28,084 INFO L87 Difference]: Start difference. First operand 5872 states and 7872 transitions. Second operand 11 states. [2018-12-01 08:20:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:29,990 INFO L93 Difference]: Finished difference Result 15758 states and 23867 transitions. [2018-12-01 08:20:29,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 08:20:29,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2018-12-01 08:20:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:30,053 INFO L225 Difference]: With dead ends: 15758 [2018-12-01 08:20:30,053 INFO L226 Difference]: Without dead ends: 15755 [2018-12-01 08:20:30,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 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-12-01 08:20:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15755 states. [2018-12-01 08:20:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15755 to 15192. [2018-12-01 08:20:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15192 states. [2018-12-01 08:20:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15192 states to 15192 states and 22734 transitions. [2018-12-01 08:20:30,787 INFO L78 Accepts]: Start accepts. Automaton has 15192 states and 22734 transitions. Word has length 89 [2018-12-01 08:20:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:30,787 INFO L480 AbstractCegarLoop]: Abstraction has 15192 states and 22734 transitions. [2018-12-01 08:20:30,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 08:20:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 15192 states and 22734 transitions. [2018-12-01 08:20:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-01 08:20:30,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:30,788 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 08:20:30,788 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:30,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2042764433, now seen corresponding path program 2 times [2018-12-01 08:20:30,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:30,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:30,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:20:30,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:30,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 08:20:30,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 08:20:30,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 08:20:30,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 08:20:30,817 INFO L87 Difference]: Start difference. First operand 15192 states and 22734 transitions. Second operand 3 states. [2018-12-01 08:20:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:31,209 INFO L93 Difference]: Finished difference Result 24841 states and 38821 transitions. [2018-12-01 08:20:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 08:20:31,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-01 08:20:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:31,237 INFO L225 Difference]: With dead ends: 24841 [2018-12-01 08:20:31,237 INFO L226 Difference]: Without dead ends: 10372 [2018-12-01 08:20:31,289 INFO L631 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-12-01 08:20:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10372 states. [2018-12-01 08:20:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10372 to 10116. [2018-12-01 08:20:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10116 states. [2018-12-01 08:20:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10116 states to 10116 states and 14383 transitions. [2018-12-01 08:20:31,744 INFO L78 Accepts]: Start accepts. Automaton has 10116 states and 14383 transitions. Word has length 92 [2018-12-01 08:20:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:31,744 INFO L480 AbstractCegarLoop]: Abstraction has 10116 states and 14383 transitions. [2018-12-01 08:20:31,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 08:20:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 10116 states and 14383 transitions. [2018-12-01 08:20:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 08:20:31,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:31,746 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 08:20:31,746 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:31,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash -131765010, now seen corresponding path program 1 times [2018-12-01 08:20:31,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:31,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:31,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:20:31,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 08:20:31,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:20:31,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 08:20:31,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 08:20:31,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 08:20:31,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 08:20:31,785 INFO L87 Difference]: Start difference. First operand 10116 states and 14383 transitions. Second operand 7 states. [2018-12-01 08:20:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:33,423 INFO L93 Difference]: Finished difference Result 35655 states and 58048 transitions. [2018-12-01 08:20:33,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 08:20:33,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-01 08:20:33,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:33,495 INFO L225 Difference]: With dead ends: 35655 [2018-12-01 08:20:33,495 INFO L226 Difference]: Without dead ends: 19845 [2018-12-01 08:20:33,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-12-01 08:20:33,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19845 states. [2018-12-01 08:20:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19845 to 18429. [2018-12-01 08:20:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18429 states. [2018-12-01 08:20:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18429 states to 18429 states and 25148 transitions. [2018-12-01 08:20:34,349 INFO L78 Accepts]: Start accepts. Automaton has 18429 states and 25148 transitions. Word has length 100 [2018-12-01 08:20:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:34,350 INFO L480 AbstractCegarLoop]: Abstraction has 18429 states and 25148 transitions. [2018-12-01 08:20:34,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 08:20:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 18429 states and 25148 transitions. [2018-12-01 08:20:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-01 08:20:34,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:34,351 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-01 08:20:34,351 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:34,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 193904721, now seen corresponding path program 1 times [2018-12-01 08:20:34,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:34,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:34,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-01 08:20:34,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 08:20:34,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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-12-01 08:20:34,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:34,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:20:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 08:20:34,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 08:20:34,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-01 08:20:34,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 08:20:34,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 08:20:34,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-01 08:20:34,485 INFO L87 Difference]: Start difference. First operand 18429 states and 25148 transitions. Second operand 9 states. [2018-12-01 08:20:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:35,810 INFO L93 Difference]: Finished difference Result 32556 states and 45174 transitions. [2018-12-01 08:20:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 08:20:35,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-12-01 08:20:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:35,842 INFO L225 Difference]: With dead ends: 32556 [2018-12-01 08:20:35,842 INFO L226 Difference]: Without dead ends: 15096 [2018-12-01 08:20:35,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 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-12-01 08:20:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15096 states. [2018-12-01 08:20:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15096 to 14338. [2018-12-01 08:20:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14338 states. [2018-12-01 08:20:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14338 states to 14338 states and 17118 transitions. [2018-12-01 08:20:36,340 INFO L78 Accepts]: Start accepts. Automaton has 14338 states and 17118 transitions. Word has length 110 [2018-12-01 08:20:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:36,341 INFO L480 AbstractCegarLoop]: Abstraction has 14338 states and 17118 transitions. [2018-12-01 08:20:36,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 08:20:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 14338 states and 17118 transitions. [2018-12-01 08:20:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-01 08:20:36,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:36,345 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 08:20:36,345 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:36,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:36,345 INFO L82 PathProgramCache]: Analyzing trace with hash 716240703, now seen corresponding path program 1 times [2018-12-01 08:20:36,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:36,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:36,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:36,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:36,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-01 08:20:36,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 08:20:36,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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-12-01 08:20:36,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:36,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:20:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-01 08:20:36,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 08:20:36,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-12-01 08:20:36,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 08:20:36,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 08:20:36,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-01 08:20:36,536 INFO L87 Difference]: Start difference. First operand 14338 states and 17118 transitions. Second operand 8 states. [2018-12-01 08:20:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:37,453 INFO L93 Difference]: Finished difference Result 31805 states and 38553 transitions. [2018-12-01 08:20:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 08:20:37,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2018-12-01 08:20:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:37,488 INFO L225 Difference]: With dead ends: 31805 [2018-12-01 08:20:37,488 INFO L226 Difference]: Without dead ends: 17865 [2018-12-01 08:20:37,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-01 08:20:37,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17865 states. [2018-12-01 08:20:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17865 to 17655. [2018-12-01 08:20:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17655 states. [2018-12-01 08:20:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17655 states to 17655 states and 21178 transitions. [2018-12-01 08:20:38,103 INFO L78 Accepts]: Start accepts. Automaton has 17655 states and 21178 transitions. Word has length 174 [2018-12-01 08:20:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:38,103 INFO L480 AbstractCegarLoop]: Abstraction has 17655 states and 21178 transitions. [2018-12-01 08:20:38,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 08:20:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 17655 states and 21178 transitions. [2018-12-01 08:20:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-01 08:20:38,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:38,106 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 08:20:38,106 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:38,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash 745588165, now seen corresponding path program 1 times [2018-12-01 08:20:38,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:38,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:38,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-01 08:20:38,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 08:20:38,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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-12-01 08:20:38,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:38,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:20:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 08:20:38,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 08:20:38,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-12-01 08:20:38,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 08:20:38,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 08:20:38,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-01 08:20:38,368 INFO L87 Difference]: Start difference. First operand 17655 states and 21178 transitions. Second operand 11 states. [2018-12-01 08:20:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:40,046 INFO L93 Difference]: Finished difference Result 53069 states and 65336 transitions. [2018-12-01 08:20:40,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-01 08:20:40,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-12-01 08:20:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:40,117 INFO L225 Difference]: With dead ends: 53069 [2018-12-01 08:20:40,117 INFO L226 Difference]: Without dead ends: 30556 [2018-12-01 08:20:40,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 203 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-12-01 08:20:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30556 states. [2018-12-01 08:20:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30556 to 25958. [2018-12-01 08:20:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25958 states. [2018-12-01 08:20:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25958 states to 25958 states and 30391 transitions. [2018-12-01 08:20:41,186 INFO L78 Accepts]: Start accepts. Automaton has 25958 states and 30391 transitions. Word has length 189 [2018-12-01 08:20:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:41,186 INFO L480 AbstractCegarLoop]: Abstraction has 25958 states and 30391 transitions. [2018-12-01 08:20:41,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 08:20:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 25958 states and 30391 transitions. [2018-12-01 08:20:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-12-01 08:20:41,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:41,192 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 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, 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-12-01 08:20:41,192 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:41,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:41,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1840638283, now seen corresponding path program 1 times [2018-12-01 08:20:41,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:41,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:41,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:41,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:41,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-01 08:20:41,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 08:20:41,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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-12-01 08:20:41,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:41,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:20:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-01 08:20:41,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 08:20:41,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-01 08:20:41,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 08:20:41,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 08:20:41,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-01 08:20:41,404 INFO L87 Difference]: Start difference. First operand 25958 states and 30391 transitions. Second operand 9 states. [2018-12-01 08:20:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:41,917 INFO L93 Difference]: Finished difference Result 35458 states and 42245 transitions. [2018-12-01 08:20:41,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 08:20:41,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 273 [2018-12-01 08:20:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:41,938 INFO L225 Difference]: With dead ends: 35458 [2018-12-01 08:20:41,938 INFO L226 Difference]: Without dead ends: 9549 [2018-12-01 08:20:41,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-12-01 08:20:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9549 states. [2018-12-01 08:20:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9549 to 7057. [2018-12-01 08:20:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7057 states. [2018-12-01 08:20:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 8031 transitions. [2018-12-01 08:20:42,308 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 8031 transitions. Word has length 273 [2018-12-01 08:20:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:42,308 INFO L480 AbstractCegarLoop]: Abstraction has 7057 states and 8031 transitions. [2018-12-01 08:20:42,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 08:20:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 8031 transitions. [2018-12-01 08:20:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-01 08:20:42,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:42,311 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 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, 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-12-01 08:20:42,311 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:42,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash 823377233, now seen corresponding path program 1 times [2018-12-01 08:20:42,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:42,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:42,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:42,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:42,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-12-01 08:20:42,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 08:20:42,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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-12-01 08:20:42,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:42,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:20:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 277 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-01 08:20:42,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 08:20:42,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-01 08:20:42,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 08:20:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 08:20:42,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-01 08:20:42,521 INFO L87 Difference]: Start difference. First operand 7057 states and 8031 transitions. Second operand 8 states. [2018-12-01 08:20:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:43,038 INFO L93 Difference]: Finished difference Result 10866 states and 12477 transitions. [2018-12-01 08:20:43,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 08:20:43,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 293 [2018-12-01 08:20:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:43,046 INFO L225 Difference]: With dead ends: 10866 [2018-12-01 08:20:43,046 INFO L226 Difference]: Without dead ends: 4167 [2018-12-01 08:20:43,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 296 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-12-01 08:20:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2018-12-01 08:20:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4001. [2018-12-01 08:20:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4001 states. [2018-12-01 08:20:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 4553 transitions. [2018-12-01 08:20:43,222 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 4553 transitions. Word has length 293 [2018-12-01 08:20:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:43,222 INFO L480 AbstractCegarLoop]: Abstraction has 4001 states and 4553 transitions. [2018-12-01 08:20:43,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 08:20:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 4553 transitions. [2018-12-01 08:20:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-01 08:20:43,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:20:43,224 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 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, 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-12-01 08:20:43,225 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:20:43,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:20:43,225 INFO L82 PathProgramCache]: Analyzing trace with hash 585639202, now seen corresponding path program 1 times [2018-12-01 08:20:43,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:20:43,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:20:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:43,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:20:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-12-01 08:20:43,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 08:20:43,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/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-12-01 08:20:43,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:20:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:20:43,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:20:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-12-01 08:20:43,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 08:20:43,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-12-01 08:20:43,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:20:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:20:43,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:20:43,459 INFO L87 Difference]: Start difference. First operand 4001 states and 4553 transitions. Second operand 6 states. [2018-12-01 08:20:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:20:43,768 INFO L93 Difference]: Finished difference Result 4633 states and 5251 transitions. [2018-12-01 08:20:43,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 08:20:43,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 294 [2018-12-01 08:20:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:20:43,770 INFO L225 Difference]: With dead ends: 4633 [2018-12-01 08:20:43,770 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 08:20:43,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 295 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-12-01 08:20:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 08:20:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 08:20:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 08:20:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 08:20:43,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 294 [2018-12-01 08:20:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:20:43,777 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 08:20:43,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:20:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 08:20:43,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 08:20:43,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 08:20:43,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:43,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:43,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:43,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:43,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,315 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 267 [2018-12-01 08:20:44,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:44,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:45,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:46,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:46,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:46,058 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 273 [2018-12-01 08:20:47,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,187 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 245 [2018-12-01 08:20:47,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,415 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 241 [2018-12-01 08:20:47,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:47,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,196 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 252 [2018-12-01 08:20:48,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:48,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:49,950 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 272 [2018-12-01 08:20:50,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,964 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 272 [2018-12-01 08:20:50,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:50,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 08:20:51,812 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 85 [2018-12-01 08:20:53,000 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 273 DAG size of output: 105 [2018-12-01 08:20:54,289 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 233 DAG size of output: 98 [2018-12-01 08:21:01,259 WARN L180 SmtUtils]: Spent 6.96 s on a formula simplification. DAG size of input: 429 DAG size of output: 162 [2018-12-01 08:21:06,089 WARN L180 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 393 DAG size of output: 112 [2018-12-01 08:21:06,365 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 1 [2018-12-01 08:21:07,801 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 290 DAG size of output: 124 [2018-12-01 08:21:10,956 WARN L180 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 477 DAG size of output: 95 [2018-12-01 08:21:11,385 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2018-12-01 08:21:14,419 WARN L180 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 279 DAG size of output: 109 [2018-12-01 08:21:14,609 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 1 [2018-12-01 08:21:14,800 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 1 [2018-12-01 08:21:16,293 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 379 DAG size of output: 99 [2018-12-01 08:21:17,498 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 378 DAG size of output: 91 [2018-12-01 08:21:17,655 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 374 DAG size of output: 1 [2018-12-01 08:21:19,406 WARN L180 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 248 DAG size of output: 104 [2018-12-01 08:21:21,323 WARN L180 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 253 DAG size of output: 82 [2018-12-01 08:21:21,432 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2018-12-01 08:21:23,751 WARN L180 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 258 DAG size of output: 92 [2018-12-01 08:21:25,487 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 255 DAG size of output: 101 [2018-12-01 08:21:27,513 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 251 DAG size of output: 99 [2018-12-01 08:21:29,279 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 379 DAG size of output: 99 [2018-12-01 08:21:32,623 WARN L180 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 386 DAG size of output: 152 [2018-12-01 08:21:34,473 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 261 DAG size of output: 104 [2018-12-01 08:21:35,882 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 495 DAG size of output: 80 [2018-12-01 08:21:39,048 WARN L180 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 434 DAG size of output: 108 [2018-12-01 08:21:43,418 WARN L180 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 429 DAG size of output: 162 [2018-12-01 08:21:43,643 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 492 DAG size of output: 1 [2018-12-01 08:21:44,868 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 276 DAG size of output: 109 [2018-12-01 08:21:45,498 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 491 DAG size of output: 1 [2018-12-01 08:21:47,905 WARN L180 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 422 DAG size of output: 147 [2018-12-01 08:21:49,498 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 309 DAG size of output: 94 [2018-12-01 08:21:52,427 WARN L180 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 387 DAG size of output: 88 [2018-12-01 08:21:52,906 WARN L180 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 91 [2018-12-01 08:21:54,065 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 276 DAG size of output: 109 [2018-12-01 08:21:59,385 WARN L180 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 304 DAG size of output: 138 [2018-12-01 08:22:00,312 WARN L180 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 89 [2018-12-01 08:22:00,800 WARN L180 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 94 [2018-12-01 08:22:02,325 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 405 DAG size of output: 101 [2018-12-01 08:22:02,532 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2018-12-01 08:22:03,322 WARN L180 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 91 [2018-12-01 08:22:03,462 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2018-12-01 08:22:03,465 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-12-01 08:22:03,465 INFO L448 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-12-01 08:22:03,466 INFO L448 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2018-12-01 08:22:03,466 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-12-01 08:22:03,466 INFO L444 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-12-01 08:22:03,467 INFO L444 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))) (.cse28 (= 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))) (.cse25 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= |old(~p_dw_st~0)| 0))) (.cse26 (= 2 ~c_dr_st~0)) (.cse32 (and .cse16 .cse28 .cse12)) (.cse31 (and .cse16 .cse12)) (.cse29 (< ~p_num_write~0 ~c_num_read~0)) (.cse15 (< ~q_free~0 1)) (.cse18 (< 1 ~q_free~0)) (.cse30 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse21 (and .cse28 .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 .cse0 .cse1 .cse15 .cse2 .cse25 .cse26 .cse5 .cse13 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse1 .cse22 .cse19 .cse27 .cse24 .cse0 .cse15 .cse5 (and (= 0 ~p_dw_st~0) .cse28) .cse13 .cse17 .cse18 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse25 .cse26) (or (and (and .cse6 .cse26) (= ~q_read_ev~0 1)) (or .cse8 .cse29 .cse1 .cse15 .cse2 .cse9 .cse25 .cse14 .cse18 .cse30 .cse20 .cse24) (and .cse26 .cse12)) (or (and .cse16 .cse6 .cse28) .cse8 .cse1 .cse2 .cse3 .cse10 .cse4 .cse22 .cse5 .cse13) (or .cse8 .cse1 .cse2 .cse3 .cse25 .cse10 .cse22 .cse26 .cse14) (or .cse8 .cse1 .cse2 .cse3 .cse25 .cse10 .cse26 .cse13 .cse14) (or .cse8 .cse1 .cse2 .cse31 .cse9 .cse3 .cse10 .cse4 .cse13 .cse14) (or .cse2 .cse1 .cse9 .cse22 .cse14 .cse29 .cse8 .cse15 .cse26 .cse25 .cse10 .cse18 .cse30 .cse20) (or .cse7 .cse2 .cse1 .cse9 .cse11 .cse22 (not .cse13) .cse14 (= 0 ~q_write_ev~0) .cse24 .cse3 .cse25 (and .cse26 .cse28 .cse12)) (or .cse1 .cse2 .cse22 .cse19 .cse28 .cse0 .cse15 .cse4 .cse5 .cse13 .cse17 .cse18 .cse20) (or .cse2 .cse1 .cse9 .cse26 .cse14 .cse29 .cse8 .cse15 .cse25 .cse10 .cse13 .cse18 .cse30 .cse20) (or .cse8 .cse1 .cse2 .cse3 .cse25 .cse10 .cse22 .cse5 .cse26 .cse13) (or .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse4 .cse22 .cse14 .cse32) (or .cse2 .cse1 .cse9 .cse32 .cse22 .cse14 .cse29 .cse8 .cse15 .cse10 .cse4 .cse18 .cse30 .cse20) (or .cse31 .cse2 .cse1 .cse9 .cse14 .cse29 .cse8 .cse15 .cse10 .cse4 .cse13 .cse18 .cse30 .cse20) (or .cse2 .cse1 .cse22 .cse14 .cse27 .cse3 .cse10 .cse21 .cse23 .cse13 .cse17) (or .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse11 .cse22 .cse13 .cse14 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse28)))) [2018-12-01 08:22:03,468 INFO L444 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-12-01 08:22:03,468 INFO L448 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2018-12-01 08:22:03,468 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2018-12-01 08:22:03,468 INFO L444 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 .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-12-01 08:22:03,468 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2018-12-01 08:22:03,469 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2018-12-01 08:22:03,469 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2018-12-01 08:22:03,469 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2018-12-01 08:22:03,469 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2018-12-01 08:22:03,469 INFO L444 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-12-01 08:22:03,469 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-12-01 08:22:03,469 INFO L448 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2018-12-01 08:22:03,469 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2018-12-01 08:22:03,470 INFO L448 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2018-12-01 08:22:03,470 INFO L448 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2018-12-01 08:22:03,470 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2018-12-01 08:22:03,470 INFO L448 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2018-12-01 08:22:03,471 INFO L444 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-12-01 08:22:03,471 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2018-12-01 08:22:03,471 INFO L444 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-12-01 08:22:03,471 INFO L448 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2018-12-01 08:22:03,471 INFO L448 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2018-12-01 08:22:03,471 INFO L444 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-12-01 08:22:03,472 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-01 08:22:03,472 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2018-12-01 08:22:03,472 INFO L444 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-12-01 08:22:03,472 INFO L444 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-12-01 08:22:03,472 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2018-12-01 08:22:03,473 INFO L444 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-12-01 08:22:03,473 INFO L444 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-12-01 08:22:03,474 INFO L444 ceAbstractionStarter]: At program point L129-1(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-12-01 08:22:03,474 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2018-12-01 08:22:03,474 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2018-12-01 08:22:03,475 INFO L444 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-12-01 08:22:03,475 INFO L448 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2018-12-01 08:22:03,475 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-12-01 08:22:03,475 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-01 08:22:03,475 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-12-01 08:22:03,475 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-12-01 08:22:03,475 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-01 08:22:03,475 INFO L444 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-12-01 08:22:03,476 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 08:22:03,476 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-12-01 08:22:03,476 INFO L451 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2018-12-01 08:22:03,476 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-12-01 08:22:03,476 INFO L451 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2018-12-01 08:22:03,476 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2018-12-01 08:22:03,476 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2018-12-01 08:22:03,476 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2018-12-01 08:22:03,477 INFO L444 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-12-01 08:22:03,477 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2018-12-01 08:22:03,477 INFO L448 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2018-12-01 08:22:03,478 INFO L444 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse45 (= 1 |old(~c_dr_pc~0)|)) (.cse54 (= ~p_dw_st~0 0)) (.cse12 (= |old(~p_dw_pc~0)| 1)) (.cse56 (+ ~c_num_read~0 1)) (.cse57 (+ |old(~c_num_read~0)| 1)) (.cse8 (= 2 ~c_dr_st~0)) (.cse44 (= ~c_num_read~0 1)) (.cse38 (= ~c_num_read~0 0)) (.cse39 (= 1 ~p_num_write~0)) (.cse52 (not (= ~c_dr_pc~0 1))) (.cse26 (= ~q_free~0 0)) (.cse55 (= ~p_dw_i~0 1)) (.cse58 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse14 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse24 (not (= 0 ~c_dr_st~0))) (.cse25 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse15 (= 1 ~c_dr_pc~0)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (<= 1 ~q_free~0)) (.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (= 2 ~p_dw_st~0)) (.cse27 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse21 (<= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse37 (and .cse13 .cse14 .cse24 .cse25 .cse15 .cse16 .cse18 .cse19 .cse20 .cse27 .cse21 .cse22)) (.cse41 (not .cse58)) (.cse42 (and .cse52 .cse24 .cse16 (= 2 ~q_read_ev~0) .cse26 .cse58 .cse55)) (.cse49 (and .cse52 .cse25 .cse16 .cse38 .cse26 .cse20 .cse27 .cse39)) (.cse51 (not (= 1 |old(~p_num_write~0)|))) (.cse50 (and .cse25 .cse8 .cse15 .cse16 .cse44 .cse18 .cse20 .cse21 .cse39 .cse22)) (.cse29 (< |old(~p_num_write~0)| .cse57)) (.cse30 (< .cse57 |old(~p_num_write~0)|)) (.cse43 (< 0 |old(~q_req_up~0)|)) (.cse23 (<= .cse56 ~p_num_write~0)) (.cse17 (= 1 ~p_dw_pc~0)) (.cse28 (<= ~p_num_write~0 .cse56)) (.cse31 (not .cse12)) (.cse32 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse35 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse53 (and .cse26 .cse52 .cse24 .cse55 .cse16)) (.cse46 (and .cse52 .cse24 .cse25 .cse54 .cse16 .cse18 .cse38 .cse21 .cse22 (= 0 ~p_num_write~0))) (.cse9 (and .cse14 .cse24 .cse25 .cse15 .cse16 .cse26 .cse20 .cse27)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse40 (not (= 0 |old(~p_num_write~0)|))) (.cse33 (< |old(~q_free~0)| 1)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse48 (not (= 0 |old(~c_num_read~0)|))) (.cse34 (< 1 |old(~q_free~0)|)) (.cse36 (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 .cse45)) (.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))) (.cse47 (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 (and .cse13 .cse14 .cse8 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse14 .cse24 .cse25 .cse15 .cse16 .cse26 .cse20 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse30 .cse6 .cse31 .cse7)) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse32 .cse0 .cse33 .cse5 .cse11 .cse34 .cse35 .cse36 .cse37) (or (and .cse8 .cse16 .cse17 .cse38 .cse26 .cse20 .cse39) .cse2 .cse1 .cse6 .cse40 .cse41 .cse42 .cse43 (and .cse8 .cse44 .cse18 .cse15 .cse16 .cse17 .cse20 .cse21 .cse39 .cse22) .cse45 .cse33 .cse46 .cse47 .cse12 .cse48 .cse34 .cse36) (or .cse29 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 (and .cse23 .cse14 .cse25 .cse15 .cse16 .cse26 .cse20 .cse27 .cse28) .cse30 .cse12 .cse7 (and .cse13 .cse14 .cse25 .cse8 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22)) (or (and (and .cse13 .cse14 .cse8 .cse15 .cse16 .cse18 .cse19 .cse20 .cse27 .cse21 .cse22) .cse17) .cse31 (or .cse0 .cse32 .cse1 .cse33 .cse2 .cse10 .cse4 .cse7 .cse34 .cse35 .cse36 .cse43)) (or .cse29 .cse1 .cse2 .cse10 (and .cse23 .cse28) .cse30 .cse6 .cse0 .cse3 .cse5 .cse11 .cse47 .cse12) (or .cse2 .cse1 .cse10 .cse7 .cse32 .cse0 .cse33 .cse8 .cse4 .cse5 .cse12 .cse34 .cse35 .cse36) (or .cse45 .cse1 .cse2 .cse3 .cse4 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse47 .cse12 .cse8) (or .cse2 .cse1 .cse10 .cse37 .cse7 .cse32 .cse0 .cse33 .cse5 .cse11 .cse12 .cse34 .cse35 .cse36) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse32 .cse0 .cse33 .cse8 .cse4 .cse5 .cse34 .cse35 .cse36) (or .cse2 .cse1 .cse6 .cse49 .cse7 .cse41 .cse42 .cse45 .cse3 .cse5 .cse50 .cse51 .cse12 .cse48) (or .cse1 .cse2 .cse6 .cse49 .cse7 .cse43 .cse45 .cse0 .cse3 .cse51 .cse12 .cse48 .cse50 (and .cse26 .cse52 .cse24 .cse16)) (or .cse53 .cse45 .cse1 .cse2 .cse3 .cse11) (or .cse29 .cse2 .cse1 .cse10 (and .cse23 .cse14 .cse8 .cse15 .cse16 .cse17 .cse26 .cse20 .cse27 .cse28) .cse30 .cse6 .cse31 .cse7 (= 0 ~q_write_ev~0) .cse43 .cse3 .cse4) (or (and .cse23 .cse8 .cse15 .cse16 .cse17 .cse26 .cse20 .cse28) (or .cse31 (or .cse2 .cse1 .cse10 .cse6 .cse32 .cse0 .cse33 .cse4 .cse5 .cse47 .cse34 .cse35 .cse36))) (or .cse1 .cse2 .cse40 .cse53 .cse45 .cse33 .cse11 .cse46 .cse47 .cse12 .cse48 .cse34 .cse36) (or .cse0 .cse1 .cse2 .cse10 .cse9 .cse3 .cse5 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse12 .cse7) (or .cse1 .cse2 .cse40 .cse45 .cse33 .cse4 .cse8 .cse47 .cse12 .cse48 .cse34 .cse36) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 (and .cse14 .cse24 .cse15 .cse16 .cse26 .cse20 .cse27) .cse11 (and .cse14 .cse24 .cse25 .cse54 .cse15 .cse16 .cse26 .cse27) .cse6 .cse47 .cse12)))) [2018-12-01 08:22:03,478 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2018-12-01 08:22:03,478 INFO L444 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-12-01 08:22:03,479 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2018-12-01 08:22:03,479 INFO L444 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-12-01 08:22:03,479 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2018-12-01 08:22:03,479 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2018-12-01 08:22:03,479 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-12-01 08:22:03,480 INFO L444 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-12-01 08:22:03,480 INFO L444 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-12-01 08:22:03,482 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2018-12-01 08:22:03,482 INFO L444 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-12-01 08:22:03,487 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2018-12-01 08:22:03,487 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-12-01 08:22:03,487 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2018-12-01 08:22:03,487 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2018-12-01 08:22:03,487 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2018-12-01 08:22:03,487 INFO L444 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-12-01 08:22:03,490 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-12-01 08:22:03,491 INFO L444 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-12-01 08:22:03,492 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-01 08:22:03,493 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2018-12-01 08:22:03,493 INFO L444 ceAbstractionStarter]: At program point L409-1(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-12-01 08:22:03,494 INFO L444 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-12-01 08:22:03,495 INFO L444 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-12-01 08:22:03,498 INFO L451 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2018-12-01 08:22:03,499 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-12-01 08:22:03,499 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-12-01 08:22:03,499 INFO L444 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-12-01 08:22:03,499 INFO L444 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-12-01 08:22:03,499 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-01 08:22:03,500 INFO L444 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-12-01 08:22:03,500 INFO L444 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-12-01 08:22:03,500 INFO L444 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-12-01 08:22:03,500 INFO L444 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-12-01 08:22:03,501 INFO L444 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-12-01 08:22:03,502 INFO L444 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-12-01 08:22:03,504 INFO L444 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-12-01 08:22:03,505 INFO L448 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2018-12-01 08:22:03,505 INFO L448 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2018-12-01 08:22:03,505 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2018-12-01 08:22:03,505 INFO L444 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-12-01 08:22:03,506 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2018-12-01 08:22:03,507 INFO L444 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-12-01 08:22:03,507 INFO L448 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2018-12-01 08:22:03,507 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 08:22:03,507 INFO L444 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-12-01 08:22:03,507 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 08:22:03,507 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 08:22:03,507 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2018-12-01 08:22:03,507 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2018-12-01 08:22:03,507 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2018-12-01 08:22:03,507 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2018-12-01 08:22:03,507 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2018-12-01 08:22:03,509 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2018-12-01 08:22:03,509 INFO L444 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse26 (+ ~c_num_read~0 1)) (.cse13 (= 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))) (.cse11 (not (= 0 ~p_num_write~0))) (.cse21 (< ~p_num_write~0 ~c_num_read~0)) (.cse14 (< ~q_free~0 1)) (.cse16 (< 1 ~q_free~0)) (.cse22 (< ~c_num_read~0 ~p_num_write~0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (not (= ~p_dw_st~0 0))) (.cse19 (= 0 ~c_dr_st~0)) (.cse18 (< ~q_write_ev~0 2)) (.cse20 (not .cse13)) (.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))) (.cse12 (< 0 ~q_req_up~0)) (.cse6 (not (= ~q_free~0 0))) (.cse23 (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 .cse0 .cse1 .cse2 .cse11 .cse5 .cse12 .cse13 .cse14 .cse4 .cse15 .cse9 .cse10 .cse16 .cse17) (or .cse18 .cse1 .cse0 .cse6 .cse7 .cse19 .cse4 .cse2 .cse3) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse21 .cse18 .cse14 .cse7 .cse19 .cse9 .cse16 .cse22 .cse17) (or .cse18 .cse1 .cse0 .cse4 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 .cse12) (or .cse13 .cse1 .cse0 .cse6 .cse19 .cse4 (and (= 1 ~p_dw_pc~0) (not (= 0 ~q_read_ev~0)))) (or .cse4 (= ~q_read_ev~0 1) (or .cse18 .cse21 .cse1 .cse14 .cse0 .cse20 .cse23 .cse3 .cse16 .cse22 .cse17 .cse12)) (or .cse13 .cse1 .cse14 .cse0 .cse4 .cse19 .cse15 .cse9 .cse10 .cse16 .cse11 .cse17) (or .cse13 .cse1 .cse0 .cse6 .cse19 .cse2 .cse4) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse21 .cse18 .cse14 .cse7 .cse19 .cse4 .cse16 .cse22 .cse17) (or .cse4 .cse18 .cse1 .cse0 .cse6 .cse7 .cse19 .cse2 .cse15 .cse9) (or .cse18 .cse1 .cse0 .cse6 .cse7 .cse4 .cse19 .cse9 .cse3) (or .cse24 .cse18 .cse1 .cse0 .cse4 .cse20 .cse6 .cse7 .cse25 .cse9 .cse3) (or .cse24 .cse0 .cse1 .cse25 .cse2 (not .cse9) .cse3 (= 0 ~q_write_ev~0) .cse12 .cse6 .cse23 .cse4)))) [2018-12-01 08:22:03,509 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2018-12-01 08:22:03,509 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2018-12-01 08:22:03,509 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2018-12-01 08:22:03,509 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2018-12-01 08:22:03,509 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2018-12-01 08:22:03,509 INFO L444 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-12-01 08:22:03,510 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2018-12-01 08:22:03,510 INFO L444 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-12-01 08:22:03,510 INFO L448 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2018-12-01 08:22:03,511 INFO L444 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-12-01 08:22:03,512 INFO L444 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-12-01 08:22:03,512 INFO L444 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-12-01 08:22:03,514 INFO L444 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-12-01 08:22:03,514 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2018-12-01 08:22:03,514 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2018-12-01 08:22:03,514 INFO L444 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-12-01 08:22:03,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 08:22:03 BoogieIcfgContainer [2018-12-01 08:22:03,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 08:22:03,567 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 08:22:03,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 08:22:03,567 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 08:22:03,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:20:23" (3/4) ... [2018-12-01 08:22:03,570 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-01 08:22:03,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-01 08:22:03,576 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-01 08:22:03,576 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-12-01 08:22:03,576 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-12-01 08:22:03,576 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-01 08:22:03,581 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-01 08:22:03,582 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-01 08:22:03,601 WARN L221 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-12-01 08:22:03,602 WARN L221 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-12-01 08:22:03,602 WARN L221 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_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) || (((((((((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))) && (((((((((((((!(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)))) && ((((((((((((!(\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-12-01 08:22:03,603 WARN L221 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-12-01 08:22:03,603 WARN L221 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-12-01 08:22:03,603 WARN L221 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-12-01 08:22:03,603 WARN L221 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-12-01 08:22:03,603 WARN L221 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-12-01 08:22:03,603 WARN L221 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-12-01 08:22:03,632 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1544f1b0-cae6-4b48-8a34-4e6aefb90f71/bin-2019/uautomizer/witness.graphml [2018-12-01 08:22:03,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 08:22:03,633 INFO L168 Benchmark]: Toolchain (without parser) took 100615.92 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.6 GB). Free memory was 954.4 MB in the beginning and 896.2 MB in the end (delta: 58.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-01 08:22:03,633 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:22:03,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.78 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-01 08:22:03,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.60 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 08:22:03,634 INFO L168 Benchmark]: Boogie Preprocessor took 49.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-01 08:22:03,634 INFO L168 Benchmark]: RCFGBuilder took 236.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-01 08:22:03,634 INFO L168 Benchmark]: TraceAbstraction took 100092.67 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 896.2 MB in the end (delta: 172.5 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-12-01 08:22:03,634 INFO L168 Benchmark]: Witness Printer took 65.25 ms. Allocated memory is still 3.6 GB. Free memory is still 896.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:22:03,635 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.78 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.60 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100092.67 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 896.2 MB in the end (delta: 172.5 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 65.25 ms. Allocated memory is still 3.6 GB. Free memory is still 896.2 MB. 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: 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)) && (((((((((((((!(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)))) && ((0 == __retres1 || 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)) && (((((((((((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_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) || (((((((((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))) && (((((((((((((!(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)))) && ((((((((((((!(\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: 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: 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))) && ((!(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 19 procedures, 130 locations, 1 error locations. SAFE Result, 100.0s OverallTime, 20 OverallIterations, 8 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 79.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 4057 SDtfs, 8110 SDslu, 5784 SDs, 0 SdLazy, 8851 SolverSat, 2891 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1717 GetRequests, 1530 SyntacticMatches, 14 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25958occurred 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: 5.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 11131 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 45872 PreInvPairs, 53302 NumberOfFragments, 25370 HoareAnnotationTreeSize, 45872 FomulaSimplifications, 365496 FormulaSimplificationTreeSizeReduction, 7.5s HoareSimplificationTime, 56 FomulaSimplificationsInter, 410516 FormulaSimplificationTreeSizeReductionInter, 71.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3924 NumberOfCodeBlocks, 3924 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3897 ConstructedInterpolants, 0 QuantifiedInterpolants, 1060277 SizeOfPredicates, 11 NumberOfNonLiveVariables, 6930 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 2347/2427 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...