./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/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_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/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-aa41828 [2018-11-23 08:14:39,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:14:39,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:14:39,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:14:39,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:14:39,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:14:39,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:14:39,207 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:14:39,208 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:14:39,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:14:39,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:14:39,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:14:39,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:14:39,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:14:39,211 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:14:39,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:14:39,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:14:39,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:14:39,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:14:39,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:14:39,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:14:39,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:14:39,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:14:39,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:14:39,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:14:39,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:14:39,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:14:39,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:14:39,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:14:39,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:14:39,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:14:39,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:14:39,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:14:39,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:14:39,223 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:14:39,223 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:14:39,223 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 08:14:39,230 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:14:39,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:14:39,231 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:14:39,231 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:14:39,232 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:14:39,232 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:14:39,232 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:14:39,232 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:14:39,232 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:14:39,232 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:14:39,232 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:14:39,233 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:14:39,233 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:14:39,233 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:14:39,233 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:14:39,233 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:14:39,233 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:14:39,233 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:14:39,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:14:39,234 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:14:39,234 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:14:39,234 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:14:39,234 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:14:39,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:14:39,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:14:39,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:14:39,235 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:14:39,235 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:14:39,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:14:39,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:14:39,235 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_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d321e3b1b642bcfc9c94c4888bd187898cb1af58 [2018-11-23 08:14:39,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:14:39,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:14:39,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:14:39,271 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:14:39,272 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:14:39,272 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-23 08:14:39,317 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/data/72a5fe048/87848fc7a3a14f739f5a521e52361ac3/FLAG0c8f6ddb6 [2018-11-23 08:14:39,729 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:14:39,730 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-23 08:14:39,736 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/data/72a5fe048/87848fc7a3a14f739f5a521e52361ac3/FLAG0c8f6ddb6 [2018-11-23 08:14:39,746 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/data/72a5fe048/87848fc7a3a14f739f5a521e52361ac3 [2018-11-23 08:14:39,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:14:39,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:14:39,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:14:39,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:14:39,755 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:14:39,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:39,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e4096d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39, skipping insertion in model container [2018-11-23 08:14:39,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:39,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:14:39,785 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:14:39,913 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:14:39,916 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:14:39,941 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:14:39,951 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:14:39,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39 WrapperNode [2018-11-23 08:14:39,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:14:39,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:14:39,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:14:39,952 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:14:39,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:39,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:39,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:14:39,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:14:39,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:14:39,965 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:14:40,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:40,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:40,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:40,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:40,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:40,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:40,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (1/1) ... [2018-11-23 08:14:40,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:14:40,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:14:40,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:14:40,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:14:40,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:14:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-23 08:14:40,052 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-23 08:14:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-23 08:14:40,052 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-23 08:14:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-11-23 08:14:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-11-23 08:14:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-23 08:14:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-23 08:14:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-23 08:14:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-23 08:14:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:14:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:14:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-23 08:14:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-23 08:14:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-23 08:14:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-23 08:14:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:14:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:14:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-23 08:14:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-23 08:14:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-23 08:14:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-23 08:14:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-23 08:14:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-23 08:14:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-23 08:14:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-23 08:14:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-23 08:14:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-23 08:14:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-23 08:14:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-23 08:14:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:14:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:14:40,055 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-23 08:14:40,055 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-23 08:14:40,055 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-23 08:14:40,055 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-23 08:14:40,055 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-23 08:14:40,055 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-23 08:14:40,361 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:14:40,361 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 08:14:40,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:14:40 BoogieIcfgContainer [2018-11-23 08:14:40,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:14:40,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:14:40,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:14:40,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:14:40,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:14:39" (1/3) ... [2018-11-23 08:14:40,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c16829f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:14:40, skipping insertion in model container [2018-11-23 08:14:40,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:39" (2/3) ... [2018-11-23 08:14:40,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c16829f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:14:40, skipping insertion in model container [2018-11-23 08:14:40,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:14:40" (3/3) ... [2018-11-23 08:14:40,366 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-23 08:14:40,372 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:14:40,377 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:14:40,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:14:40,407 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:14:40,408 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:14:40,408 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:14:40,408 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:14:40,408 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:14:40,408 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:14:40,408 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:14:40,408 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:14:40,408 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:14:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-11-23 08:14:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 08:14:40,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:40,431 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-11-23 08:14:40,432 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:40,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash 11439179, now seen corresponding path program 1 times [2018-11-23 08:14:40,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:40,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:40,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:40,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:40,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:40,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:14:40,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:14:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:14:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:14:40,640 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 5 states. [2018-11-23 08:14:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:41,108 INFO L93 Difference]: Finished difference Result 379 states and 545 transitions. [2018-11-23 08:14:41,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:14:41,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-11-23 08:14:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:41,120 INFO L225 Difference]: With dead ends: 379 [2018-11-23 08:14:41,120 INFO L226 Difference]: Without dead ends: 252 [2018-11-23 08:14:41,123 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-11-23 08:14:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-23 08:14:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2018-11-23 08:14:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-23 08:14:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2018-11-23 08:14:41,173 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2018-11-23 08:14:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:41,174 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2018-11-23 08:14:41,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:14:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2018-11-23 08:14:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 08:14:41,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:41,176 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-11-23 08:14:41,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:41,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:41,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1438317323, now seen corresponding path program 1 times [2018-11-23 08:14:41,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:41,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:41,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:41,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:41,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:41,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:41,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:14:41,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:14:41,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:14:41,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:14:41,274 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2018-11-23 08:14:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:41,789 INFO L93 Difference]: Finished difference Result 628 states and 843 transitions. [2018-11-23 08:14:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:14:41,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-23 08:14:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:41,792 INFO L225 Difference]: With dead ends: 628 [2018-11-23 08:14:41,792 INFO L226 Difference]: Without dead ends: 422 [2018-11-23 08:14:41,793 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-11-23 08:14:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-11-23 08:14:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2018-11-23 08:14:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-23 08:14:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-11-23 08:14:41,833 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2018-11-23 08:14:41,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:41,834 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-11-23 08:14:41,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:14:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-11-23 08:14:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 08:14:41,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:41,837 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-11-23 08:14:41,837 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:41,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:41,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1469864563, now seen corresponding path program 1 times [2018-11-23 08:14:41,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:41,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:41,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:41,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:41,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:14:41,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:14:41,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:14:41,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:14:41,903 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2018-11-23 08:14:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:41,945 INFO L93 Difference]: Finished difference Result 685 states and 908 transitions. [2018-11-23 08:14:41,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:14:41,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-23 08:14:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:41,947 INFO L225 Difference]: With dead ends: 685 [2018-11-23 08:14:41,948 INFO L226 Difference]: Without dead ends: 369 [2018-11-23 08:14:41,949 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-11-23 08:14:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-23 08:14:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2018-11-23 08:14:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-23 08:14:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2018-11-23 08:14:41,976 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2018-11-23 08:14:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:41,976 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2018-11-23 08:14:41,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:14:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2018-11-23 08:14:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 08:14:41,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:41,980 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-11-23 08:14:41,980 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:41,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1221718069, now seen corresponding path program 1 times [2018-11-23 08:14:41,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:41,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:41,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:42,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:42,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 08:14:42,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:14:42,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:14:42,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:14:42,040 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2018-11-23 08:14:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:42,146 INFO L93 Difference]: Finished difference Result 991 states and 1319 transitions. [2018-11-23 08:14:42,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:14:42,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 08:14:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:42,151 INFO L225 Difference]: With dead ends: 991 [2018-11-23 08:14:42,151 INFO L226 Difference]: Without dead ends: 670 [2018-11-23 08:14:42,152 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-11-23 08:14:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-23 08:14:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-11-23 08:14:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-23 08:14:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2018-11-23 08:14:42,182 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2018-11-23 08:14:42,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:42,183 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2018-11-23 08:14:42,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:14:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2018-11-23 08:14:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 08:14:42,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:42,185 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-11-23 08:14:42,185 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:42,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2116320844, now seen corresponding path program 1 times [2018-11-23 08:14:42,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:42,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:42,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:42,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:42,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:14:42,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:14:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:14:42,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:14:42,233 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2018-11-23 08:14:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:42,291 INFO L93 Difference]: Finished difference Result 1280 states and 1639 transitions. [2018-11-23 08:14:42,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:14:42,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-23 08:14:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:42,295 INFO L225 Difference]: With dead ends: 1280 [2018-11-23 08:14:42,295 INFO L226 Difference]: Without dead ends: 672 [2018-11-23 08:14:42,298 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-11-23 08:14:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-11-23 08:14:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2018-11-23 08:14:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-11-23 08:14:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2018-11-23 08:14:42,333 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2018-11-23 08:14:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:42,334 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2018-11-23 08:14:42,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:14:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2018-11-23 08:14:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 08:14:42,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:42,335 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-11-23 08:14:42,335 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:42,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:42,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2043934286, now seen corresponding path program 1 times [2018-11-23 08:14:42,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:42,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:42,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:42,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:42,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:42,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:42,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:14:42,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:14:42,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:14:42,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:14:42,409 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2018-11-23 08:14:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:43,010 INFO L93 Difference]: Finished difference Result 1359 states and 1714 transitions. [2018-11-23 08:14:43,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 08:14:43,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-23 08:14:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:43,014 INFO L225 Difference]: With dead ends: 1359 [2018-11-23 08:14:43,014 INFO L226 Difference]: Without dead ends: 831 [2018-11-23 08:14:43,015 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-11-23 08:14:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-11-23 08:14:43,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2018-11-23 08:14:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-11-23 08:14:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2018-11-23 08:14:43,054 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2018-11-23 08:14:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:43,055 INFO L480 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2018-11-23 08:14:43,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:14:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2018-11-23 08:14:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 08:14:43,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:43,056 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-11-23 08:14:43,056 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:43,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1534461196, now seen corresponding path program 1 times [2018-11-23 08:14:43,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:43,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:43,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:43,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:43,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:14:43,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:14:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:14:43,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:14:43,104 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2018-11-23 08:14:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:43,178 INFO L93 Difference]: Finished difference Result 1887 states and 2417 transitions. [2018-11-23 08:14:43,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:14:43,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-11-23 08:14:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:43,183 INFO L225 Difference]: With dead ends: 1887 [2018-11-23 08:14:43,183 INFO L226 Difference]: Without dead ends: 1276 [2018-11-23 08:14:43,185 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-11-23 08:14:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-11-23 08:14:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2018-11-23 08:14:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-11-23 08:14:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2018-11-23 08:14:43,247 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2018-11-23 08:14:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:43,247 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2018-11-23 08:14:43,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:14:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2018-11-23 08:14:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 08:14:43,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:43,249 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-11-23 08:14:43,249 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:43,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash -578263435, now seen corresponding path program 1 times [2018-11-23 08:14:43,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:43,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:43,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:43,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:43,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:43,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:43,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:14:43,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:14:43,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:14:43,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:14:43,324 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2018-11-23 08:14:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:43,460 INFO L93 Difference]: Finished difference Result 3564 states and 4733 transitions. [2018-11-23 08:14:43,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:14:43,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-23 08:14:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:43,470 INFO L225 Difference]: With dead ends: 3564 [2018-11-23 08:14:43,470 INFO L226 Difference]: Without dead ends: 2309 [2018-11-23 08:14:43,474 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-11-23 08:14:43,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-11-23 08:14:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2018-11-23 08:14:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-11-23 08:14:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2018-11-23 08:14:43,605 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2018-11-23 08:14:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:43,606 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2018-11-23 08:14:43,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:14:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2018-11-23 08:14:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 08:14:43,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:43,608 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-11-23 08:14:43,608 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:43,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1713093210, now seen corresponding path program 1 times [2018-11-23 08:14:43,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:43,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:43,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:43,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:43,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:43,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:43,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:14:43,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:14:43,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:14:43,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:14:43,679 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 5 states. [2018-11-23 08:14:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:44,311 INFO L93 Difference]: Finished difference Result 6956 states and 9741 transitions. [2018-11-23 08:14:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:14:44,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-11-23 08:14:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:44,333 INFO L225 Difference]: With dead ends: 6956 [2018-11-23 08:14:44,333 INFO L226 Difference]: Without dead ends: 4830 [2018-11-23 08:14:44,343 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-11-23 08:14:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2018-11-23 08:14:44,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4685. [2018-11-23 08:14:44,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4685 states. [2018-11-23 08:14:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2018-11-23 08:14:44,641 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 87 [2018-11-23 08:14:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:44,642 INFO L480 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2018-11-23 08:14:44,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:14:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2018-11-23 08:14:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 08:14:44,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:44,644 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-11-23 08:14:44,644 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:44,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1488980751, now seen corresponding path program 1 times [2018-11-23 08:14:44,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:44,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:44,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:44,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:44,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 08:14:44,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:14:44,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:14:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:14:44,699 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand 4 states. [2018-11-23 08:14:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:45,040 INFO L93 Difference]: Finished difference Result 6313 states and 8477 transitions. [2018-11-23 08:14:45,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:14:45,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-23 08:14:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:45,067 INFO L225 Difference]: With dead ends: 6313 [2018-11-23 08:14:45,067 INFO L226 Difference]: Without dead ends: 6310 [2018-11-23 08:14:45,071 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-11-23 08:14:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6310 states. [2018-11-23 08:14:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6310 to 6141. [2018-11-23 08:14:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6141 states. [2018-11-23 08:14:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 8233 transitions. [2018-11-23 08:14:45,459 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 8233 transitions. Word has length 88 [2018-11-23 08:14:45,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:45,459 INFO L480 AbstractCegarLoop]: Abstraction has 6141 states and 8233 transitions. [2018-11-23 08:14:45,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:14:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 8233 transitions. [2018-11-23 08:14:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 08:14:45,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:45,463 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-11-23 08:14:45,463 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:45,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1085920016, now seen corresponding path program 1 times [2018-11-23 08:14:45,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:45,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:45,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:45,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:45,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:45,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:14:45,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:14:45,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:45,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:14:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:45,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:14:45,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-23 08:14:45,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 08:14:45,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 08:14:45,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:14:45,755 INFO L87 Difference]: Start difference. First operand 6141 states and 8233 transitions. Second operand 11 states. [2018-11-23 08:14:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:47,732 INFO L93 Difference]: Finished difference Result 16290 states and 24602 transitions. [2018-11-23 08:14:47,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 08:14:47,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2018-11-23 08:14:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:47,795 INFO L225 Difference]: With dead ends: 16290 [2018-11-23 08:14:47,795 INFO L226 Difference]: Without dead ends: 16287 [2018-11-23 08:14:47,802 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-11-23 08:14:47,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16287 states. [2018-11-23 08:14:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16287 to 15709. [2018-11-23 08:14:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15709 states. [2018-11-23 08:14:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15709 states to 15709 states and 23454 transitions. [2018-11-23 08:14:48,889 INFO L78 Accepts]: Start accepts. Automaton has 15709 states and 23454 transitions. Word has length 89 [2018-11-23 08:14:48,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:48,890 INFO L480 AbstractCegarLoop]: Abstraction has 15709 states and 23454 transitions. [2018-11-23 08:14:48,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 08:14:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 15709 states and 23454 transitions. [2018-11-23 08:14:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 08:14:48,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:48,892 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-11-23 08:14:48,892 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:48,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:48,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2042764433, now seen corresponding path program 2 times [2018-11-23 08:14:48,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:48,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:48,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:48,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:48,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:14:48,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:48,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:14:48,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:14:48,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:14:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:14:48,945 INFO L87 Difference]: Start difference. First operand 15709 states and 23454 transitions. Second operand 3 states. [2018-11-23 08:14:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:49,677 INFO L93 Difference]: Finished difference Result 25358 states and 39589 transitions. [2018-11-23 08:14:49,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:14:49,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-11-23 08:14:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:49,721 INFO L225 Difference]: With dead ends: 25358 [2018-11-23 08:14:49,722 INFO L226 Difference]: Without dead ends: 10889 [2018-11-23 08:14:49,795 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-11-23 08:14:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10889 states. [2018-11-23 08:14:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10889 to 10633. [2018-11-23 08:14:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10633 states. [2018-11-23 08:14:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 15091 transitions. [2018-11-23 08:14:50,440 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 15091 transitions. Word has length 92 [2018-11-23 08:14:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:50,440 INFO L480 AbstractCegarLoop]: Abstraction has 10633 states and 15091 transitions. [2018-11-23 08:14:50,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:14:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 15091 transitions. [2018-11-23 08:14:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 08:14:50,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:50,444 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-11-23 08:14:50,444 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:50,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:50,444 INFO L82 PathProgramCache]: Analyzing trace with hash -131765010, now seen corresponding path program 1 times [2018-11-23 08:14:50,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:50,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:50,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:14:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 08:14:50,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:14:50,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 08:14:50,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:14:50,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:14:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:14:50,523 INFO L87 Difference]: Start difference. First operand 10633 states and 15091 transitions. Second operand 7 states. [2018-11-23 08:14:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:52,284 INFO L93 Difference]: Finished difference Result 37495 states and 60800 transitions. [2018-11-23 08:14:52,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 08:14:52,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-11-23 08:14:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:52,366 INFO L225 Difference]: With dead ends: 37495 [2018-11-23 08:14:52,367 INFO L226 Difference]: Without dead ends: 20714 [2018-11-23 08:14:52,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-11-23 08:14:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20714 states. [2018-11-23 08:14:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20714 to 19278. [2018-11-23 08:14:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19278 states. [2018-11-23 08:14:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19278 states to 19278 states and 26280 transitions. [2018-11-23 08:14:53,425 INFO L78 Accepts]: Start accepts. Automaton has 19278 states and 26280 transitions. Word has length 100 [2018-11-23 08:14:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:53,426 INFO L480 AbstractCegarLoop]: Abstraction has 19278 states and 26280 transitions. [2018-11-23 08:14:53,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:14:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 19278 states and 26280 transitions. [2018-11-23 08:14:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 08:14:53,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:53,429 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-11-23 08:14:53,429 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:53,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:53,429 INFO L82 PathProgramCache]: Analyzing trace with hash 193904721, now seen corresponding path program 1 times [2018-11-23 08:14:53,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:53,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:53,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:53,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:53,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 08:14:53,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:14:53,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:14:53,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:53,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:14:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 08:14:53,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:14:53,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-23 08:14:53,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:14:53,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:14:53,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:14:53,648 INFO L87 Difference]: Start difference. First operand 19278 states and 26280 transitions. Second operand 9 states. [2018-11-23 08:14:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:55,398 INFO L93 Difference]: Finished difference Result 34337 states and 47464 transitions. [2018-11-23 08:14:55,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 08:14:55,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-11-23 08:14:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:55,446 INFO L225 Difference]: With dead ends: 34337 [2018-11-23 08:14:55,446 INFO L226 Difference]: Without dead ends: 15965 [2018-11-23 08:14:55,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-11-23 08:14:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15965 states. [2018-11-23 08:14:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15965 to 15187. [2018-11-23 08:14:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15187 states. [2018-11-23 08:14:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15187 states to 15187 states and 18085 transitions. [2018-11-23 08:14:56,142 INFO L78 Accepts]: Start accepts. Automaton has 15187 states and 18085 transitions. Word has length 110 [2018-11-23 08:14:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:56,143 INFO L480 AbstractCegarLoop]: Abstraction has 15187 states and 18085 transitions. [2018-11-23 08:14:56,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:14:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 15187 states and 18085 transitions. [2018-11-23 08:14:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 08:14:56,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:56,148 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-11-23 08:14:56,148 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:56,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash 716240703, now seen corresponding path program 1 times [2018-11-23 08:14:56,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:56,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:56,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:56,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:56,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 08:14:56,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:14:56,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:14:56,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:56,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:14:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 08:14:56,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:14:56,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-23 08:14:56,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 08:14:56,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 08:14:56,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:14:56,358 INFO L87 Difference]: Start difference. First operand 15187 states and 18085 transitions. Second operand 8 states. [2018-11-23 08:14:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:14:57,320 INFO L93 Difference]: Finished difference Result 32654 states and 39520 transitions. [2018-11-23 08:14:57,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:14:57,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2018-11-23 08:14:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:14:57,373 INFO L225 Difference]: With dead ends: 32654 [2018-11-23 08:14:57,373 INFO L226 Difference]: Without dead ends: 17865 [2018-11-23 08:14:57,392 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-11-23 08:14:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17865 states. [2018-11-23 08:14:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17865 to 17655. [2018-11-23 08:14:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17655 states. [2018-11-23 08:14:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17655 states to 17655 states and 21178 transitions. [2018-11-23 08:14:58,083 INFO L78 Accepts]: Start accepts. Automaton has 17655 states and 21178 transitions. Word has length 174 [2018-11-23 08:14:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:14:58,083 INFO L480 AbstractCegarLoop]: Abstraction has 17655 states and 21178 transitions. [2018-11-23 08:14:58,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 08:14:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 17655 states and 21178 transitions. [2018-11-23 08:14:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-23 08:14:58,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:14:58,087 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-11-23 08:14:58,087 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:14:58,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:14:58,088 INFO L82 PathProgramCache]: Analyzing trace with hash 745588165, now seen corresponding path program 1 times [2018-11-23 08:14:58,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:14:58,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:14:58,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:58,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:58,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:14:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 08:14:58,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:14:58,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:14:58,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:14:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:14:58,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:14:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 08:14:58,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:14:58,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 08:14:58,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 08:14:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 08:14:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:14:58,373 INFO L87 Difference]: Start difference. First operand 17655 states and 21178 transitions. Second operand 11 states. [2018-11-23 08:15:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:15:00,040 INFO L93 Difference]: Finished difference Result 53069 states and 65336 transitions. [2018-11-23 08:15:00,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 08:15:00,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-11-23 08:15:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:15:00,108 INFO L225 Difference]: With dead ends: 53069 [2018-11-23 08:15:00,108 INFO L226 Difference]: Without dead ends: 30556 [2018-11-23 08:15:00,136 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-11-23 08:15:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30556 states. [2018-11-23 08:15:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30556 to 25958. [2018-11-23 08:15:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25958 states. [2018-11-23 08:15:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25958 states to 25958 states and 30391 transitions. [2018-11-23 08:15:01,266 INFO L78 Accepts]: Start accepts. Automaton has 25958 states and 30391 transitions. Word has length 189 [2018-11-23 08:15:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:15:01,267 INFO L480 AbstractCegarLoop]: Abstraction has 25958 states and 30391 transitions. [2018-11-23 08:15:01,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 08:15:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 25958 states and 30391 transitions. [2018-11-23 08:15:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-23 08:15:01,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:15:01,273 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:15:01,273 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:15:01,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:15:01,273 INFO L82 PathProgramCache]: Analyzing trace with hash -622457563, now seen corresponding path program 1 times [2018-11-23 08:15:01,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:15:01,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:15:01,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:15:01,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:15:01,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:15:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:15:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 08:15:01,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:15:01,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:15:01,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:15:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:15:01,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:15:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-23 08:15:01,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:15:01,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-11-23 08:15:01,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 08:15:01,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 08:15:01,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 08:15:01,516 INFO L87 Difference]: Start difference. First operand 25958 states and 30391 transitions. Second operand 12 states. [2018-11-23 08:15:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:15:02,102 INFO L93 Difference]: Finished difference Result 40134 states and 47644 transitions. [2018-11-23 08:15:02,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 08:15:02,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 274 [2018-11-23 08:15:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:15:02,133 INFO L225 Difference]: With dead ends: 40134 [2018-11-23 08:15:02,134 INFO L226 Difference]: Without dead ends: 14225 [2018-11-23 08:15:02,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-23 08:15:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14225 states. [2018-11-23 08:15:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14225 to 11886. [2018-11-23 08:15:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2018-11-23 08:15:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 13870 transitions. [2018-11-23 08:15:02,724 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 13870 transitions. Word has length 274 [2018-11-23 08:15:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:15:02,724 INFO L480 AbstractCegarLoop]: Abstraction has 11886 states and 13870 transitions. [2018-11-23 08:15:02,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 08:15:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 13870 transitions. [2018-11-23 08:15:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-23 08:15:02,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:15:02,729 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-11-23 08:15:02,729 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:15:02,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:15:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash 823377233, now seen corresponding path program 1 times [2018-11-23 08:15:02,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:15:02,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:15:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:15:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:15:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:15:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:15:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-11-23 08:15:02,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:15:02,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:15:02,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:15:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:15:02,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:15:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 277 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-23 08:15:03,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:15:03,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 08:15:03,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 08:15:03,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 08:15:03,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:15:03,018 INFO L87 Difference]: Start difference. First operand 11886 states and 13870 transitions. Second operand 8 states. [2018-11-23 08:15:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:15:03,736 INFO L93 Difference]: Finished difference Result 18360 states and 21485 transitions. [2018-11-23 08:15:03,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 08:15:03,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 293 [2018-11-23 08:15:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:15:03,749 INFO L225 Difference]: With dead ends: 18360 [2018-11-23 08:15:03,749 INFO L226 Difference]: Without dead ends: 7022 [2018-11-23 08:15:03,758 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-11-23 08:15:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2018-11-23 08:15:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 6787. [2018-11-23 08:15:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6787 states. [2018-11-23 08:15:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6787 states to 6787 states and 7840 transitions. [2018-11-23 08:15:04,034 INFO L78 Accepts]: Start accepts. Automaton has 6787 states and 7840 transitions. Word has length 293 [2018-11-23 08:15:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:15:04,035 INFO L480 AbstractCegarLoop]: Abstraction has 6787 states and 7840 transitions. [2018-11-23 08:15:04,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 08:15:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 6787 states and 7840 transitions. [2018-11-23 08:15:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-23 08:15:04,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:15:04,038 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:15:04,038 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:15:04,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:15:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash 938728294, now seen corresponding path program 1 times [2018-11-23 08:15:04,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:15:04,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:15:04,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:15:04,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:15:04,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:15:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:15:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 72 proven. 22 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-11-23 08:15:04,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:15:04,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:15:04,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:15:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:15:04,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:15:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-23 08:15:04,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:15:04,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-23 08:15:04,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:15:04,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:15:04,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:15:04,327 INFO L87 Difference]: Start difference. First operand 6787 states and 7840 transitions. Second operand 4 states. [2018-11-23 08:15:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:15:04,548 INFO L93 Difference]: Finished difference Result 9110 states and 10566 transitions. [2018-11-23 08:15:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:15:04,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2018-11-23 08:15:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:15:04,554 INFO L225 Difference]: With dead ends: 9110 [2018-11-23 08:15:04,555 INFO L226 Difference]: Without dead ends: 4009 [2018-11-23 08:15:04,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:15:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-11-23 08:15:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4001. [2018-11-23 08:15:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4001 states. [2018-11-23 08:15:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 4553 transitions. [2018-11-23 08:15:04,766 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 4553 transitions. Word has length 292 [2018-11-23 08:15:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:15:04,767 INFO L480 AbstractCegarLoop]: Abstraction has 4001 states and 4553 transitions. [2018-11-23 08:15:04,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:15:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 4553 transitions. [2018-11-23 08:15:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-23 08:15:04,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:15:04,770 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-11-23 08:15:04,770 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:15:04,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:15:04,771 INFO L82 PathProgramCache]: Analyzing trace with hash 585639202, now seen corresponding path program 1 times [2018-11-23 08:15:04,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:15:04,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:15:04,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:15:04,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:15:04,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:15:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:15:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-11-23 08:15:04,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:15:04,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:15:04,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:15:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:15:05,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:15:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-23 08:15:05,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:15:05,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-23 08:15:05,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:15:05,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:15:05,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:15:05,064 INFO L87 Difference]: Start difference. First operand 4001 states and 4553 transitions. Second operand 6 states. [2018-11-23 08:15:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:15:05,340 INFO L93 Difference]: Finished difference Result 4633 states and 5251 transitions. [2018-11-23 08:15:05,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:15:05,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 294 [2018-11-23 08:15:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:15:05,341 INFO L225 Difference]: With dead ends: 4633 [2018-11-23 08:15:05,341 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 08:15:05,346 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-11-23 08:15:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 08:15:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 08:15:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 08:15:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 08:15:05,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 294 [2018-11-23 08:15:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:15:05,347 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:15:05,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:15:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 08:15:05,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 08:15:05,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 08:15:05,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:05,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,129 WARN L180 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 412 DAG size of output: 271 [2018-11-23 08:15:06,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:06,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:07,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:08,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:08,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:08,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:08,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:08,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:08,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:08,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:08,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:08,164 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 420 DAG size of output: 277 [2018-11-23 08:15:09,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,334 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 390 DAG size of output: 253 [2018-11-23 08:15:09,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,595 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 249 [2018-11-23 08:15:09,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:09,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,421 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 404 DAG size of output: 260 [2018-11-23 08:15:10,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:10,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:11,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,143 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 413 DAG size of output: 272 [2018-11-23 08:15:12,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:12,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,170 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 413 DAG size of output: 272 [2018-11-23 08:15:13,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:13,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:15:14,005 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 83 [2018-11-23 08:15:15,171 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 275 DAG size of output: 105 [2018-11-23 08:15:15,995 WARN L180 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 91 [2018-11-23 08:15:19,177 WARN L180 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 430 DAG size of output: 165 [2018-11-23 08:15:22,503 WARN L180 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 402 DAG size of output: 110 [2018-11-23 08:15:22,768 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 1 [2018-11-23 08:15:22,890 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2018-11-23 08:15:24,300 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 291 DAG size of output: 123 [2018-11-23 08:15:26,136 WARN L180 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 492 DAG size of output: 94 [2018-11-23 08:15:26,359 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2018-11-23 08:15:27,517 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 281 DAG size of output: 108 [2018-11-23 08:15:27,644 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 1 [2018-11-23 08:15:27,773 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 1 [2018-11-23 08:15:29,212 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 395 DAG size of output: 97 [2018-11-23 08:15:30,366 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 394 DAG size of output: 87 [2018-11-23 08:15:31,474 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 244 DAG size of output: 99 [2018-11-23 08:15:32,055 WARN L180 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 81 [2018-11-23 08:15:32,179 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2018-11-23 08:15:32,770 WARN L180 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 88 [2018-11-23 08:15:33,837 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 261 DAG size of output: 100 [2018-11-23 08:15:34,809 WARN L180 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 98 [2018-11-23 08:15:36,323 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 395 DAG size of output: 97 [2018-11-23 08:15:39,056 WARN L180 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 397 DAG size of output: 153 [2018-11-23 08:15:40,155 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 267 DAG size of output: 104 [2018-11-23 08:15:41,526 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 438 DAG size of output: 103 [2018-11-23 08:15:42,923 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 508 DAG size of output: 77 [2018-11-23 08:15:46,032 WARN L180 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 430 DAG size of output: 165 [2018-11-23 08:15:46,210 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 500 DAG size of output: 1 [2018-11-23 08:15:47,380 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 276 DAG size of output: 107 [2018-11-23 08:15:47,898 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 503 DAG size of output: 1 [2018-11-23 08:15:49,432 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 319 DAG size of output: 96 [2018-11-23 08:15:51,604 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 426 DAG size of output: 145 [2018-11-23 08:15:53,886 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 404 DAG size of output: 85 [2018-11-23 08:15:54,395 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 89 [2018-11-23 08:15:55,565 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 276 DAG size of output: 107 [2018-11-23 08:15:57,652 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 304 DAG size of output: 135 [2018-11-23 08:15:58,275 WARN L180 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 85 [2018-11-23 08:15:58,671 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 93 [2018-11-23 08:16:00,048 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 417 DAG size of output: 100 [2018-11-23 08:16:00,250 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2018-11-23 08:16:00,792 WARN L180 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 89 [2018-11-23 08:16:00,911 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2018-11-23 08:16:00,913 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-11-23 08:16:00,913 INFO L448 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-11-23 08:16:00,913 INFO L448 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2018-11-23 08:16:00,913 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-11-23 08:16:00,914 INFO L444 ceAbstractionStarter]: At program point L303(line 303) the Hoare annotation is: (let ((.cse22 (= 1 ~c_dr_pc~0)) (.cse26 (not (= 0 ~c_dr_st~0))) (.cse30 (+ ~c_num_read~0 1)) (.cse6 (= 2 ~c_dr_st~0)) (.cse14 (= 2 ~p_dw_st~0))) (let ((.cse20 (not (= 0 ~p_num_write~0))) (.cse29 (and .cse6 .cse14)) (.cse18 (< 0 ~q_req_up~0)) (.cse27 (< ~p_num_write~0 .cse30)) (.cse28 (< .cse30 ~p_num_write~0)) (.cse25 (and .cse26 .cse14)) (.cse1 (not .cse22)) (.cse5 (< ~p_num_write~0 ~c_num_read~0)) (.cse7 (< ~q_free~0 1)) (.cse10 (< 1 ~q_free~0)) (.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (not (= |old(~p_dw_st~0)| 2))) (.cse21 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse15 (not (= 1 ~p_num_write~0))) (.cse17 (not (= 0 ~c_num_read~0))) (.cse4 (< ~q_write_ev~0 2)) (.cse9 (= 1 ~q_req_up~0)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse16 (= ~p_dw_pc~0 1)) (.cse24 (= 0 |old(~c_dr_st~0)|)) (.cse23 (not (= |old(~p_dw_st~0)| 0))) (.cse19 (= ~p_dw_st~0 0)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse13 (not (= ~q_free~0 0))) (.cse8 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse4 .cse0 .cse6 .cse13 .cse8 .cse9 .cse2 .cse3) (or .cse14 .cse4 .cse0 .cse13 .cse2 .cse15 .cse16 .cse3 .cse17 .cse18) (or .cse0 .cse19 .cse2 .cse20 .cse21 .cse18 .cse22 .cse7 .cse23 .cse16 .cse17 .cse10 .cse12) (or .cse22 .cse0 .cse7 .cse24 .cse23 .cse16 .cse17 .cse19 .cse10 .cse20 .cse12) (or .cse4 .cse0 .cse13 .cse8 .cse9 .cse2 .cse23 .cse6 .cse16) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 .cse7 .cse9 .cse24 .cse16 .cse10 .cse11 .cse12) (or .cse26 .cse22 .cse0 .cse7 .cse24 .cse16 .cse17 .cse10 .cse20 .cse12) (or .cse27 .cse0 .cse1 .cse28 .cse2 (not .cse16) .cse3 (= 0 ~q_write_ev~0) .cse18 .cse13 .cse29 .cse8) (or .cse6 .cse22 .cse0 .cse7 .cse8 .cse16 .cse17 .cse10 .cse20 .cse12) (or .cse0 .cse14 .cse2 .cse3 .cse20 .cse21 .cse18 .cse22 .cse7 .cse16 .cse17 .cse10 .cse12) (or .cse29 (or .cse4 .cse5 .cse0 .cse7 .cse1 .cse8 .cse3 .cse10 .cse11 .cse12 .cse18)) (or .cse4 .cse0 .cse13 .cse8 .cse9 .cse16 .cse3 .cse6) (or .cse4 .cse0 .cse1 .cse13 .cse9 .cse24 .cse16 .cse3 .cse25) (or .cse27 .cse4 .cse0 .cse1 .cse13 .cse9 .cse14 .cse28 .cse16 .cse3) (or .cse22 .cse0 .cse13 .cse26 .cse24) (or .cse0 .cse1 .cse25 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse24 .cse10 .cse11 .cse12) (or .cse4 .cse0 .cse1 .cse13 .cse9 .cse25 .cse24 .cse2 .cse3) (or .cse0 .cse1 .cse3 .cse6 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse3 .cse21 .cse13 .cse9 .cse14 .cse15 .cse16 .cse17) (or .cse4 .cse0 .cse13 .cse9 .cse24 .cse2 .cse23 .cse16 (and .cse26 .cse19)) (or .cse22 .cse0 .cse13 .cse24 .cse23 .cse19) (or .cse22 .cse0 .cse13 .cse8 .cse6)))) [2018-11-23 08:16:00,914 INFO L444 ceAbstractionStarter]: At program point L305-2(lines 305 309) the Hoare annotation is: (let ((.cse10 (= 1 ~c_dr_pc~0)) (.cse32 (+ ~c_num_read~0 1)) (.cse25 (not (= 0 ~c_dr_st~0))) (.cse15 (= activate_threads_~tmp~1 0)) (.cse27 (= 2 ~p_dw_st~0))) (let ((.cse4 (not (= 1 ~p_num_write~0))) (.cse18 (= 2 ~c_dr_st~0)) (.cse20 (not (= 2 |old(~c_dr_st~0)|))) (.cse26 (= ~p_dw_st~0 0)) (.cse24 (not (= |old(~p_dw_st~0)| 0))) (.cse28 (and .cse25 .cse15 .cse27)) (.cse19 (< ~p_num_write~0 ~c_num_read~0)) (.cse22 (< ~c_num_read~0 ~p_num_write~0)) (.cse30 (< ~p_num_write~0 .cse32)) (.cse31 (< .cse32 ~p_num_write~0)) (.cse0 (< ~q_write_ev~0 2)) (.cse17 (not .cse10)) (.cse2 (not (= ~q_free~0 0))) (.cse21 (= 1 ~q_req_up~0)) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse29 (and .cse25 .cse27)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (and .cse15 .cse27)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse14 (not (= 0 ~p_num_write~0))) (.cse23 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse9 (< 0 ~q_req_up~0)) (.cse11 (< ~q_free~0 1)) (.cse6 (= ~p_dw_pc~0 1)) (.cse8 (not (= 0 ~c_num_read~0))) (.cse13 (< 1 ~q_free~0)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse1 .cse11 .cse12 .cse3 .cse6 .cse8 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse17 .cse3 .cse7 .cse18 .cse0 .cse19 .cse11 .cse20 .cse21 .cse13 .cse22 .cse16) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse6 .cse7 .cse18) (or (and (= 0 ~p_dw_st~0) .cse15) .cse1 .cse3 .cse14 .cse23 .cse9 .cse10 .cse11 .cse24 .cse6 .cse8 .cse13 .cse16) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse3 .cse24 .cse6 .cse18) (or .cse0 .cse1 .cse2 .cse18 .cse20 .cse21 .cse3 .cse7) (or (and .cse25 .cse26 .cse15) .cse0 .cse1 .cse2 .cse21 .cse12 .cse3 .cse24 .cse6) (or (and (and .cse26 .cse18) (= ~q_read_ev~0 1)) (and .cse18 .cse27) (or .cse0 .cse19 .cse1 .cse11 .cse17 .cse20 .cse7 .cse13 .cse22 .cse16 .cse9)) (or .cse0 .cse1 .cse17 .cse2 .cse21 .cse12 .cse3 .cse7 .cse28) (or .cse10 .cse1 .cse18 .cse2 .cse20) (or .cse10 .cse1 .cse2 .cse12 .cse25) (or .cse1 .cse3 .cse7 .cse23 .cse2 .cse21 .cse5 .cse4 .cse6 .cse8) (or .cse10 .cse1 .cse11 .cse12 .cse24 .cse6 .cse8 .cse26 .cse13 .cse14 .cse16) (or .cse10 .cse1 .cse2 .cse12 .cse3 .cse15) (or .cse1 .cse17 .cse7 .cse0 .cse19 .cse11 .cse20 .cse21 .cse6 .cse13 .cse18 .cse22 .cse16) (or .cse10 .cse25 .cse1 .cse11 .cse12 .cse6 .cse8 .cse13 .cse14 .cse16) (or .cse1 .cse17 .cse7 .cse0 .cse19 .cse11 .cse29 .cse21 .cse12 .cse6 .cse13 .cse22 .cse16) (or .cse30 .cse1 .cse17 (and .cse18 .cse15 .cse27) .cse31 .cse3 (not .cse6) .cse7 (= 0 ~q_write_ev~0) .cse9 .cse2 .cse20) (or .cse10 .cse18 .cse1 .cse11 .cse20 .cse6 .cse8 .cse13 .cse14 .cse16) (or .cse30 .cse0 .cse1 .cse17 .cse2 .cse21 .cse31 .cse3 .cse15 .cse6 .cse7) (or .cse10 .cse1 .cse26 .cse2 .cse12 .cse24) (or .cse1 .cse17 .cse28 .cse3 .cse7 .cse0 .cse19 .cse11 .cse21 .cse12 .cse13 .cse22 .cse16) (or .cse30 .cse0 .cse1 .cse17 .cse2 .cse21 .cse31 .cse6 .cse7 .cse27) (or .cse0 .cse1 .cse17 .cse2 .cse21 .cse12 .cse29 .cse6 .cse7) (or .cse1 .cse5 .cse3 .cse7 .cse14 .cse23 .cse9 .cse10 .cse11 .cse6 .cse8 .cse13 .cse16)))) [2018-11-23 08:16:00,915 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 297 321) the Hoare annotation is: (let ((.cse22 (= 1 ~c_dr_pc~0)) (.cse26 (not (= 0 ~c_dr_st~0))) (.cse30 (+ ~c_num_read~0 1)) (.cse6 (= 2 ~c_dr_st~0)) (.cse14 (= 2 ~p_dw_st~0))) (let ((.cse20 (not (= 0 ~p_num_write~0))) (.cse29 (and .cse6 .cse14)) (.cse18 (< 0 ~q_req_up~0)) (.cse27 (< ~p_num_write~0 .cse30)) (.cse28 (< .cse30 ~p_num_write~0)) (.cse25 (and .cse26 .cse14)) (.cse1 (not .cse22)) (.cse5 (< ~p_num_write~0 ~c_num_read~0)) (.cse7 (< ~q_free~0 1)) (.cse10 (< 1 ~q_free~0)) (.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (not (= |old(~p_dw_st~0)| 2))) (.cse21 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse15 (not (= 1 ~p_num_write~0))) (.cse17 (not (= 0 ~c_num_read~0))) (.cse4 (< ~q_write_ev~0 2)) (.cse9 (= 1 ~q_req_up~0)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse16 (= ~p_dw_pc~0 1)) (.cse24 (= 0 |old(~c_dr_st~0)|)) (.cse23 (not (= |old(~p_dw_st~0)| 0))) (.cse19 (= ~p_dw_st~0 0)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse13 (not (= ~q_free~0 0))) (.cse8 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse4 .cse0 .cse6 .cse13 .cse8 .cse9 .cse2 .cse3) (or .cse14 .cse4 .cse0 .cse13 .cse2 .cse15 .cse16 .cse3 .cse17 .cse18) (or .cse0 .cse19 .cse2 .cse20 .cse21 .cse18 .cse22 .cse7 .cse23 .cse16 .cse17 .cse10 .cse12) (or .cse22 .cse0 .cse7 .cse24 .cse23 .cse16 .cse17 .cse19 .cse10 .cse20 .cse12) (or .cse4 .cse0 .cse13 .cse8 .cse9 .cse2 .cse23 .cse6 .cse16) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 .cse7 .cse9 .cse24 .cse16 .cse10 .cse11 .cse12) (or .cse26 .cse22 .cse0 .cse7 .cse24 .cse16 .cse17 .cse10 .cse20 .cse12) (or .cse27 .cse0 .cse1 .cse28 .cse2 (not .cse16) .cse3 (= 0 ~q_write_ev~0) .cse18 .cse13 .cse29 .cse8) (or .cse6 .cse22 .cse0 .cse7 .cse8 .cse16 .cse17 .cse10 .cse20 .cse12) (or .cse0 .cse14 .cse2 .cse3 .cse20 .cse21 .cse18 .cse22 .cse7 .cse16 .cse17 .cse10 .cse12) (or .cse29 (or .cse4 .cse5 .cse0 .cse7 .cse1 .cse8 .cse3 .cse10 .cse11 .cse12 .cse18)) (or .cse4 .cse0 .cse13 .cse8 .cse9 .cse16 .cse3 .cse6) (or .cse4 .cse0 .cse1 .cse13 .cse9 .cse24 .cse16 .cse3 .cse25) (or .cse27 .cse4 .cse0 .cse1 .cse13 .cse9 .cse14 .cse28 .cse16 .cse3) (or .cse22 .cse0 .cse13 .cse26 .cse24) (or .cse0 .cse1 .cse25 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse24 .cse10 .cse11 .cse12) (or .cse4 .cse0 .cse1 .cse13 .cse9 .cse25 .cse24 .cse2 .cse3) (or .cse0 .cse1 .cse3 .cse6 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse3 .cse21 .cse13 .cse9 .cse14 .cse15 .cse16 .cse17) (or .cse4 .cse0 .cse13 .cse9 .cse24 .cse2 .cse23 .cse16 (and .cse26 .cse19)) (or .cse22 .cse0 .cse13 .cse24 .cse23 .cse19) (or .cse22 .cse0 .cse13 .cse8 .cse6)))) [2018-11-23 08:16:00,915 INFO L448 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2018-11-23 08:16:00,915 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2018-11-23 08:16:00,915 INFO L444 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse7 (= 1 ~c_dr_pc~0)) (.cse22 (= 0 ~c_dr_st~0)) (.cse21 (= ~p_dw_pc~0 1))) (let ((.cse13 (not (= 2 ~c_dr_st~0))) (.cse6 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse19 (< 0 ~q_req_up~0)) (.cse2 (= exists_runnable_thread_~__retres1~2 1)) (.cse4 (not .cse21)) (.cse0 (not .cse22)) (.cse10 (< ~q_write_ev~0 2)) (.cse12 (not .cse7)) (.cse8 (not (= ~q_free~0 0))) (.cse14 (= 1 ~q_req_up~0)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse5 (not (= ~p_dw_st~0 2))) (.cse20 (= 1 exists_runnable_thread_~__retres1~2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse11 (< ~q_free~0 1)) (.cse15 (not (= ~p_dw_st~0 0))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse16 (< 1 ~q_free~0)) (.cse18 (not (= 0 ~p_num_write~0))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 1 ~p_num_write~0)) .cse9) (or .cse2 (or .cse10 (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 (< ~c_num_read~0 ~p_num_write~0) .cse17) .cse4) (or .cse1 .cse12 .cse3 .cse18 .cse6 .cse19 .cse11 .cse13 .cse20 .cse15 .cse9 .cse16 .cse17) (or .cse1 .cse3 .cse18 .cse6 .cse19 .cse7 .cse11 .cse20 .cse15 .cse21 .cse9 .cse16 .cse17) (or .cse10 .cse1 .cse8 .cse14 .cse22 .cse3 .cse15 .cse20 .cse21) (or .cse7 .cse1 .cse8 .cse22 .cse15 .cse20) (or .cse2 .cse4 (and (<= ~q_req_up~0 0) .cse0) (let ((.cse23 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse23) .cse10 .cse1 .cse12 .cse8 .cse14 (< .cse23 ~p_num_write~0) .cse3 .cse5))) (or .cse20 .cse7 .cse1 .cse11 .cse22 .cse15 .cse21 .cse9 .cse16 .cse18 .cse17)))) [2018-11-23 08:16:00,915 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2018-11-23 08:16:00,915 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2018-11-23 08:16:00,915 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2018-11-23 08:16:00,915 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2018-11-23 08:16:00,915 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2018-11-23 08:16:00,916 INFO L444 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 21 40) the Hoare annotation is: (let ((.cse16 (= 1 ~c_dr_pc~0))) (let ((.cse8 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse10 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse17 (< ~q_free~0 1)) (.cse21 (not .cse16)) (.cse18 (< 1 ~q_free~0))) (let ((.cse0 (< |old(~q_write_ev~0)| 2)) (.cse1 (< ~p_num_write~0 ~c_num_read~0)) (.cse4 (or .cse17 .cse21 .cse18)) (.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (and .cse8 .cse10)) (.cse14 (= 0 ~c_dr_st~0)) (.cse9 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse3 (not (= 2 ~c_dr_st~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse19 (not (= ~q_free~0 0))) (.cse13 (not (= |old(~q_read_ev~0)| 2))) (.cse6 (not (= ~p_dw_st~0 2))) (.cse7 (not (= 1 |old(~q_req_up~0)|))) (.cse5 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10) .cse11 .cse12) (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse11 .cse12) (and (and .cse8 .cse9) (= ~q_read_ev~0 |old(~q_read_ev~0)|))) (or .cse2 .cse14 .cse15 .cse5 (not (= 0 ~c_num_read~0)) (or .cse16 .cse17 .cse18) (not (= 0 ~p_num_write~0)) .cse12) (or .cse16 .cse2 .cse19 .cse15 .cse14) (or (and (and (= 2 ~q_read_ev~0) .cse9) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (or .cse3 (let ((.cse20 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse20) .cse2 .cse21 .cse19 (< .cse20 ~p_num_write~0))) .cse13 .cse6 .cse7 (= 0 |old(~q_write_ev~0)|)) (not .cse5)))))) [2018-11-23 08:16:00,916 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-11-23 08:16:00,916 INFO L448 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2018-11-23 08:16:00,916 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2018-11-23 08:16:00,916 INFO L448 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2018-11-23 08:16:00,916 INFO L448 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2018-11-23 08:16:00,916 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2018-11-23 08:16:00,916 INFO L448 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2018-11-23 08:16:00,916 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 279 296) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1)) (.cse33 (+ ~c_num_read~0 1)) (.cse32 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse11 (= 1 ~c_dr_pc~0)) (.cse20 (not (= |old(~q_read_ev~0)| 2))) (.cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse29 (= ~q_read_ev~0 ~q_write_ev~0))) (let ((.cse2 (and .cse22 .cse29)) (.cse8 (or .cse11 .cse20 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (.cse28 (not (= ~p_dw_st~0 0))) (.cse23 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse25 (not (= 1 ~p_num_write~0))) (.cse24 (not (= 2 ~c_dr_st~0))) (.cse13 (and .cse32 .cse22)) (.cse5 (not (= 0 ~c_num_read~0))) (.cse7 (not (= 0 ~p_num_write~0))) (.cse30 (= ~q_read_ev~0 1)) (.cse31 (not (= |old(~q_read_ev~0)| 1))) (.cse16 (< |old(~q_write_ev~0)| 2)) (.cse26 (< ~p_num_write~0 ~c_num_read~0)) (.cse1 (< ~q_free~0 1)) (.cse18 (= 1 ~q_req_up~0)) (.cse14 (= 0 ~c_dr_st~0)) (.cse6 (< 1 ~q_free~0)) (.cse27 (< ~c_num_read~0 ~p_num_write~0)) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (< ~p_num_write~0 .cse33)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse17 (not .cse11)) (.cse19 (< .cse33 ~p_num_write~0)) (.cse21 (not .cse3)) (.cse4 (not (= ~p_dw_st~0 2))) (.cse10 (< 0 ~q_req_up~0)) (.cse12 (not (= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse14) (or .cse15 .cse16 .cse0 .cse17 .cse12 .cse18 .cse13 .cse19 .cse3 .cse4) (or .cse15 .cse0 .cse19 .cse20 .cse21 .cse4 (= 0 |old(~q_write_ev~0)|) .cse10 .cse12 (and .cse22 .cse23) .cse24) (or .cse16 .cse0 .cse12 .cse18 .cse13 .cse14 .cse20 .cse4) (or .cse0 .cse12 .cse18 .cse2 .cse25 .cse3 .cse4 .cse5 .cse8) (or .cse0 .cse17 .cse4 .cse13 .cse16 .cse26 .cse1 .cse18 .cse14 .cse3 .cse6 .cse27 .cse9) (or .cse16 .cse0 .cse12 .cse18 .cse14 .cse20 .cse28 .cse3 .cse13) (or .cse16 .cse0 .cse12 .cse18 .cse14 .cse3 .cse4 .cse13) (or .cse0 (and .cse29 .cse23) .cse7 .cse10 .cse1 .cse28 .cse3 .cse5 .cse6 .cse8 .cse9) (or (or .cse16 .cse26 .cse0 .cse1 .cse17 .cse24 .cse18 .cse28 .cse6 .cse27 .cse9) (and .cse23 .cse30) .cse31 .cse21) (or .cse0 .cse17 .cse13 .cse20 .cse4 .cse16 .cse26 .cse1 .cse18 .cse14 .cse6 .cse27 .cse9) (or .cse13 .cse16 .cse0 .cse12 .cse20 .cse25 .cse3 .cse4 .cse5 .cse10) (or .cse13 (or .cse16 .cse26 .cse0 .cse1 .cse17 .cse24 .cse4 .cse6 .cse27 .cse9 .cse10)) (or .cse13 .cse11 .cse0 .cse1 .cse14 .cse3 .cse5 .cse6 .cse7 .cse9) (or (and .cse32 .cse30) .cse31 (or .cse16 .cse26 .cse0 .cse1 .cse17 .cse18 .cse14 .cse4 .cse6 .cse27 .cse9)) (or .cse15 .cse0 (and .cse22 (= 1 ~q_write_ev~0)) .cse17 .cse19 .cse20 .cse21 .cse4 .cse10 .cse12 (not (= 1 |old(~q_write_ev~0)|)))))) [2018-11-23 08:16:00,916 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2018-11-23 08:16:00,917 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 223 240) the Hoare annotation is: (or (not (= ~q_buf_0~0 ~p_last_write~0)) (= ~p_dw_st~0 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) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_pc~0 1) (not (= 0 ~c_num_read~0)) (< 1 ~q_free~0) (not (= ~c_last_read~0 ~p_last_write~0))) [2018-11-23 08:16:00,917 INFO L448 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2018-11-23 08:16:00,917 INFO L448 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2018-11-23 08:16:00,917 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 455 466) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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) (= ~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_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-11-23 08:16:00,917 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-23 08:16:00,917 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2018-11-23 08:16:00,917 INFO L444 ceAbstractionStarter]: At program point L460(line 460) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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) (= ~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_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-11-23 08:16:00,917 INFO L444 ceAbstractionStarter]: At program point L460-1(line 460) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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)|)) (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) (= 0 ~p_num_write~0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-11-23 08:16:00,917 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2018-11-23 08:16:00,918 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 114 153) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0))) (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse21 (< |old(~q_free~0)| 1)) (.cse27 (not .cse0)) (.cse20 (not (= ~q_read_ev~0 2))) (.cse23 (< 1 |old(~q_free~0)|))) (let ((.cse13 (not (= 2 ~c_dr_st~0))) (.cse9 (or .cse1 .cse21 .cse27 .cse20 .cse23)) (.cse26 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse3 (= 0 ~c_dr_st~0)) (.cse5 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse4 (= ~q_free~0 0)) (.cse8 (not (= 0 |old(~p_num_write~0)|))) (.cse10 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (< 0 |old(~q_req_up~0)|)) (.cse12 (= |old(~p_dw_st~0)| 0)) (.cse15 (<= 1 ~q_free~0)) (.cse16 (not (= 0 ~p_dw_st~0))) (.cse6 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse18 (<= ~q_free~0 1)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= 0 ~p_num_write~0)) (.cse22 (= |old(~p_dw_pc~0)| 1)) (.cse14 (not (= 0 ~c_num_read~0))) (.cse25 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7)) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse6 .cse7 .cse17 .cse18 .cse19)) (or .cse1 .cse20 .cse8 .cse10 .cse0 .cse21 .cse3 .cse22 .cse14 .cse23 .cse24 .cse25) (or .cse3 (and .cse6 .cse7 .cse15 .cse18 .cse19) .cse14 (or .cse0 .cse1 .cse21 .cse22 .cse23) .cse8) (or .cse26 (and .cse16 .cse17 (and .cse5 .cse6 .cse18 .cse7 .cse15)) (or .cse12 .cse13 (or (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|) .cse9)) (not .cse22)) (or .cse12 .cse26 .cse1 .cse27 .cse2 (= 1 |old(~q_req_up~0)|) .cse3 .cse20 (and .cse5 .cse6 .cse7 .cse4 .cse16 .cse17) .cse22) (or .cse1 .cse20 .cse8 .cse10 .cse11 .cse12 .cse0 .cse21 (and .cse15 .cse16 .cse6 .cse7 .cse17 .cse18 .cse24 .cse19) .cse22 .cse14 .cse23 .cse25))))) [2018-11-23 08:16:00,918 INFO L444 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse5 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse20 (< |old(~q_free~0)| 1)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse22 (not (= ~q_read_ev~0 2))) (.cse21 (< 1 |old(~q_free~0)|))) (let ((.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse10 (or .cse1 .cse20 (not .cse0) .cse22 .cse21)) (.cse9 (not (= 2 ~c_dr_st~0))) (.cse19 (and .cse5 .cse6)) (.cse12 (not (= 0 ~p_dw_st~0))) (.cse13 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse17 (= 0 ~p_num_write~0)) (.cse14 (not (= 0 |old(~p_num_write~0)|))) (.cse15 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse16 (< 0 |old(~q_req_up~0)|)) (.cse18 (not (= 0 ~c_num_read~0))) (.cse8 (= |old(~p_dw_st~0)| 0)) (.cse7 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse3 (= 0 ~c_dr_st~0)) (.cse11 (= |old(~p_dw_pc~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= ~q_free~0 0) (= 1 |old(~p_dw_pc~0)|) .cse4 .cse5 .cse6)) (or .cse7 (or .cse8 .cse9 (or (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|) .cse10)) (not .cse11) (and (and .cse4 .cse5 .cse6) .cse12 .cse13)) (or .cse14 .cse10 .cse15 .cse16 .cse8 .cse9 (and .cse5 .cse6 .cse12 .cse13 .cse17) .cse18) (or (and .cse19 .cse17) .cse3 .cse18 (or .cse0 .cse1 .cse20 .cse11 .cse21) .cse14) (or .cse1 (and .cse19 .cse12 .cse13 .cse17) .cse22 .cse14 .cse15 .cse16 .cse8 .cse0 .cse20 .cse11 .cse18 .cse21 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (or .cse8 .cse7 .cse1 .cse2 (= 1 |old(~q_req_up~0)|) .cse3 .cse22 .cse11)))) [2018-11-23 08:16:00,918 INFO L444 ceAbstractionStarter]: At program point L129-1(lines 117 152) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0))) (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse25 (< |old(~q_free~0)| 1)) (.cse32 (not .cse0)) (.cse24 (not (= ~q_read_ev~0 2))) (.cse28 (< 1 |old(~q_free~0)|)) (.cse10 (+ |old(~p_num_write~0)| 1)) (.cse5 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 0)) (.cse20 (not (= 0 ~p_dw_st~0))) (.cse30 (= 1 ~p_num_write~0))) (let ((.cse15 (< 0 |old(~q_req_up~0)|)) (.cse11 (and .cse5 .cse7 .cse3 .cse20 .cse30)) (.cse14 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse6 (= ~p_dw_pc~0 1)) (.cse9 (<= .cse10 ~p_num_write~0)) (.cse17 (not (= 2 ~c_dr_st~0))) (.cse13 (or .cse1 .cse25 .cse32 .cse24 .cse28)) (.cse19 (<= 1 ~q_free~0)) (.cse22 (<= ~q_free~0 1)) (.cse23 (= 0 ~p_num_write~0)) (.cse18 (not (= 0 ~c_num_read~0))) (.cse12 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (= |old(~p_dw_st~0)| 0)) (.cse31 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse8 (= 0 ~c_dr_st~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse21 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse27 (= |old(~p_dw_pc~0)| 1))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 (not .cse6) .cse7) .cse8 (and .cse3 (= 1 |old(~p_dw_pc~0)|) .cse5 .cse7 .cse9 (<= ~p_num_write~0 .cse10))) (or .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse19 .cse20 .cse5 .cse7 .cse21 .cse22 .cse23)) (or .cse1 .cse24 .cse12 .cse14 .cse15 .cse16 .cse0 .cse25 .cse11 (and .cse19 .cse20 .cse5 .cse7 .cse21 .cse22 .cse26 .cse23) .cse27 .cse18 .cse28 .cse29) (or .cse1 .cse24 .cse12 .cse14 .cse0 .cse30 .cse25 .cse8 .cse27 .cse18 .cse28 .cse26 .cse29) (or .cse31 (and .cse6 .cse7 .cse9 .cse3 .cse20 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (or .cse16 .cse17 (or (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|) .cse13)) (not .cse27)) (or .cse8 (and .cse5 .cse7 .cse19 .cse22 .cse23) .cse18 (or .cse0 .cse1 .cse25 .cse27 .cse28) (and .cse3 .cse5 .cse30 .cse7) .cse12) (or .cse16 .cse31 .cse1 .cse32 .cse2 (= 1 |old(~q_req_up~0)|) .cse8 .cse24 (and .cse4 .cse5 .cse7 .cse3 .cse20 .cse21) .cse27))))) [2018-11-23 08:16:00,918 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2018-11-23 08:16:00,918 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2018-11-23 08:16:00,919 INFO L444 ceAbstractionStarter]: At program point L148(lines 114 153) the Hoare annotation is: (let ((.cse5 (= 1 ~c_dr_pc~0))) (let ((.cse17 (= ~p_dw_pc~0 1)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (= ~q_free~0 0)) (.cse19 (= 2 ~p_dw_st~0)) (.cse1 (= 1 ~p_num_write~0)) (.cse23 (+ |old(~p_num_write~0)| 1)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (< |old(~q_free~0)| 1)) (.cse24 (not .cse5)) (.cse25 (not (= ~q_read_ev~0 2))) (.cse9 (< 1 |old(~q_free~0)|))) (let ((.cse16 (or .cse6 .cse7 .cse24 .cse25 .cse9)) (.cse15 (not (= 2 ~c_dr_st~0))) (.cse18 (<= .cse23 ~p_num_write~0)) (.cse12 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse13 (< ~q_write_ev~0 2)) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse3 (= 0 ~c_dr_st~0)) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse21 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse22 (< 0 |old(~q_req_up~0)|)) (.cse14 (= |old(~p_dw_st~0)| 0)) (.cse20 (and .cse17 .cse2 .cse0 .cse19 .cse1)) (.cse8 (= |old(~p_dw_pc~0)| 1)) (.cse4 (not (= 0 ~c_num_read~0)))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4 (or .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse5 .cse6 .cse11 .cse3 .cse8 (and .cse0 .cse12 .cse2)) (or .cse13 (or .cse14 .cse15 (or (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|) .cse16)) (and .cse17 .cse2 .cse18 .cse0 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not .cse8)) (or .cse20 .cse10 .cse16 .cse21 .cse22 .cse14 .cse15 .cse4) (or .cse5 .cse6 .cse11 .cse3 (and .cse0 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse2 .cse18 (<= ~p_num_write~0 .cse23)) (not (= 1 |old(~p_dw_pc~0)|))) (or .cse14 (and .cse12 .cse2 .cse0 .cse19 (= |old(~q_req_up~0)| ~q_req_up~0)) .cse13 .cse6 .cse24 .cse11 (= 1 |old(~q_req_up~0)|) .cse3 .cse25 .cse8) (or .cse6 .cse25 .cse10 .cse21 .cse22 .cse14 .cse5 .cse7 .cse20 .cse8 .cse4 .cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))))))) [2018-11-23 08:16:00,919 INFO L448 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2018-11-23 08:16:00,919 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-23 08:16:00,919 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-23 08:16:00,919 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-23 08:16:00,919 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-23 08:16:00,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 08:16:00,919 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-11-23 08:16:00,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:16:00,919 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-23 08:16:00,919 INFO L451 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2018-11-23 08:16:00,919 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-23 08:16:00,919 INFO L451 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2018-11-23 08:16:00,920 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2018-11-23 08:16:00,920 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2018-11-23 08:16:00,920 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2018-11-23 08:16:00,920 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 322 375) the Hoare annotation is: (let ((.cse9 (= 1 |old(~c_dr_pc~0)|)) (.cse49 (+ ~c_num_read~0 1)) (.cse50 (+ |old(~c_num_read~0)| 1)) (.cse8 (= |old(~p_dw_pc~0)| 1)) (.cse42 (not (= ~c_dr_pc~0 1))) (.cse43 (= ~c_num_read~0 0)) (.cse24 (= ~q_free~0 0)) (.cse37 (<= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse33 (not (= 0 ~c_dr_st~0))) (.cse34 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse22 (= 1 ~c_dr_pc~0)) (.cse23 (= ~p_last_write~0 ~q_buf_0~0)) (.cse38 (<= 1 ~q_free~0)) (.cse39 (<= ~c_num_read~0 ~p_num_write~0)) (.cse25 (= 2 ~p_dw_st~0)) (.cse26 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse40 (<= ~q_free~0 1)) (.cse41 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse28 (= ~p_dw_pc~0 1)) (.cse29 (and .cse37 .cse21 .cse33 .cse34 .cse22 .cse23 .cse38 .cse39 .cse25 .cse26 .cse40 .cse41)) (.cse46 (and .cse42 .cse34 .cse23 .cse43 .cse24 .cse25 .cse26 (= 1 ~p_num_write~0))) (.cse44 (= 0 ~p_num_write~0)) (.cse45 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse36 (< 0 |old(~q_req_up~0)|)) (.cse47 (not (= 1 |old(~p_num_write~0)|))) (.cse30 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse32 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse7 (= 2 ~c_dr_st~0)) (.cse15 (not .cse8)) (.cse16 (< |old(~p_num_write~0)| .cse50)) (.cse18 (< .cse50 |old(~p_num_write~0)|)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse20 (<= .cse49 ~p_num_write~0)) (.cse27 (<= ~p_num_write~0 .cse49)) (.cse10 (< |old(~q_free~0)| 1)) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse35 (= ~p_dw_st~0 0)) (.cse12 (< 1 |old(~q_free~0)|)) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (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)|))) (.cse17 (not .cse9)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse4 (= 1 |old(~q_req_up~0)|)) (.cse31 (= 0 |old(~c_dr_st~0)|)) (.cse19 (not (= |old(~p_dw_st~0)| 2))) (.cse48 (and .cse21 .cse33 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse7 .cse9 .cse1 .cse10 .cse3 .cse8 .cse11 .cse12 .cse13 .cse14) (or .cse15 (or .cse16 .cse0 .cse1 .cse17 .cse2 .cse4 .cse18 .cse5 .cse19) (and (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse28)) (or .cse1 .cse17 .cse19 .cse29 .cse0 .cse30 .cse10 .cse4 .cse31 .cse8 .cse12 .cse32 .cse14) (or .cse1 .cse17 .cse19 .cse7 .cse0 .cse30 .cse10 .cse3 .cse4 .cse8 .cse12 .cse32 .cse14) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse19) (or .cse0 .cse1 .cse17 .cse2 .cse4 .cse31 .cse5 .cse6 .cse8 (and .cse21 .cse33 .cse34 .cse35 .cse22 .cse23 .cse24 .cse26)) (or .cse16 .cse0 .cse1 .cse17 .cse2 .cse4 (and .cse20 .cse21 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse18 .cse8 .cse19) (or .cse16 .cse1 .cse17 .cse18 .cse5 .cse15 .cse19 (= 0 ~q_write_ev~0) .cse36 .cse2 (and .cse20 .cse21 .cse28 .cse7 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse3) (or (and .cse37 .cse21 .cse34 .cse7 .cse22 .cse23 .cse38 .cse39 .cse25 .cse26 .cse40 .cse41) (or .cse0 .cse30 .cse1 .cse10 .cse17 .cse3 .cse19 .cse12 .cse32 .cse14 .cse36)) (or .cse1 .cse17 .cse29 .cse5 .cse19 .cse0 .cse30 .cse10 .cse4 .cse31 .cse12 .cse32 .cse14) (or .cse1 .cse5 (and .cse42 .cse34 .cse23 .cse38 .cse43 .cse25 .cse26 .cse40 .cse41 .cse44) .cse19 .cse13 .cse45 .cse36 .cse9 .cse10 .cse8 .cse11 .cse12 .cse14) (or .cse46 .cse9 .cse0 .cse1 .cse2 .cse5 .cse47 .cse8 .cse19 .cse11 .cse36) (or .cse1 .cse5 .cse19 .cse45 .cse9 .cse2 .cse4 .cse46 .cse47 .cse8 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse19 .cse7) (or .cse9 .cse1 .cse2 .cse3 .cse7) (or (and .cse42 .cse33 .cse34 .cse23 .cse38 .cse43 .cse40 .cse41 .cse44) .cse9 .cse1 .cse10 .cse31 .cse8 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse17 .cse5 .cse19 .cse0 .cse30 .cse7 .cse10 .cse3 .cse4 .cse12 .cse32 .cse14) (or .cse0 .cse1 .cse17 .cse2 .cse4 .cse48 .cse31 .cse5 .cse19) (or .cse9 .cse1 .cse2 .cse31 .cse6 .cse35) (or .cse1 (and .cse38 .cse42 .cse34 (= 0 ~p_dw_st~0) .cse23 .cse43 .cse26 .cse40 .cse41 .cse44) .cse5 .cse13 .cse45 .cse36 .cse9 .cse10 .cse6 .cse8 .cse11 .cse12 .cse14) (or .cse9 .cse1 .cse2 .cse31 .cse47 .cse11 .cse43) (or (or .cse0 .cse30 .cse1 .cse10 .cse17 .cse3 .cse4 .cse5 .cse6 .cse12 .cse32 .cse14) (and .cse37 .cse21 .cse34 .cse35 .cse7 .cse22 .cse23 .cse38 .cse39 .cse26 .cse40 .cse41) .cse15) (or .cse16 .cse0 .cse1 .cse17 .cse2 .cse4 .cse18 .cse31 .cse5 .cse6 .cse8 (and .cse20 .cse27)) (or .cse9 .cse1 .cse10 .cse31 .cse6 .cse8 .cse11 .cse35 .cse12 .cse13 .cse14) (or .cse9 .cse1 .cse2 (and .cse24 .cse42 .cse21 .cse33 .cse34 .cse23) .cse31) (or .cse0 .cse1 .cse17 .cse2 .cse4 .cse31 .cse8 .cse19 .cse48)))) [2018-11-23 08:16:00,920 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2018-11-23 08:16:00,920 INFO L448 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2018-11-23 08:16:00,921 INFO L444 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse9 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (= 2 ~c_dr_st~0)) (.cse53 (= ~c_num_read~0 1)) (.cse52 (= 1 ~p_num_write~0)) (.cse56 (+ ~c_num_read~0 1)) (.cse55 (+ |old(~c_num_read~0)| 1)) (.cse19 (= ~q_free~0 0)) (.cse57 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse8 (= |old(~p_dw_pc~0)| 1)) (.cse49 (not (= ~c_dr_pc~0 1))) (.cse50 (= ~c_num_read~0 0)) (.cse51 (= 0 ~p_num_write~0)) (.cse35 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse24 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (= 1 ~c_dr_pc~0)) (.cse18 (= ~p_last_write~0 ~q_buf_0~0)) (.cse37 (<= 1 ~q_free~0)) (.cse38 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (= 2 ~p_dw_st~0)) (.cse21 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse39 (<= ~q_free~0 1)) (.cse40 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse27 (and .cse35 .cse15 .cse16 .cse24 .cse17 .cse18 .cse37 .cse38 .cse20 .cse21 .cse39 .cse40)) (.cse47 (and .cse49 .cse16 .cse24 .cse18 .cse37 .cse50 .cse39 .cse40 .cse51)) (.cse41 (not .cse8)) (.cse31 (not .cse57)) (.cse33 (and .cse19 .cse49 .cse16 .cse57 .cse18 (= 2 ~q_read_ev~0))) (.cse36 (= ~p_dw_pc~0 1)) (.cse28 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse29 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse10 (< |old(~q_free~0)| 1)) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse25 (= ~p_dw_st~0 0)) (.cse12 (< 1 |old(~q_free~0)|)) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse42 (< |old(~p_num_write~0)| .cse55)) (.cse44 (<= .cse56 ~p_num_write~0)) (.cse45 (<= ~p_num_write~0 .cse56)) (.cse43 (< .cse55 |old(~p_num_write~0)|)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse46 (< 0 |old(~q_req_up~0)|)) (.cse48 (and .cse19 .cse49 .cse16 .cse18)) (.cse32 (and .cse49 .cse24 .cse18 .cse50 .cse19 .cse20 .cse21 .cse52)) (.cse34 (not (= 1 |old(~p_num_write~0)|))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse30 (and .cse24 .cse7 .cse17 .cse18 .cse53 .cse37 .cse20 .cse39 .cse52 .cse40)) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse22 (not .cse9)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse4 (= 1 |old(~q_req_up~0)|)) (.cse23 (= 0 |old(~c_dr_st~0)|)) (.cse26 (not (= |old(~p_dw_st~0)| 2))) (.cse54 (and .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse7 .cse9 .cse1 .cse10 .cse3 .cse8 .cse11 .cse12 .cse13 .cse14) (or (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse0 .cse1 .cse22 .cse2 .cse4 .cse23 .cse5 .cse6 .cse8 (and .cse15 .cse16 .cse24 .cse25 .cse17 .cse18 .cse19 .cse21)) (or .cse1 .cse22 .cse26 .cse27 .cse0 .cse28 .cse10 .cse4 .cse23 .cse8 .cse12 .cse29 .cse14) (or .cse1 .cse5 .cse26 .cse30 .cse31 .cse9 .cse2 .cse4 .cse32 .cse33 .cse34 .cse8 .cse11) (or .cse1 .cse22 .cse26 .cse7 .cse0 .cse28 .cse10 .cse3 .cse4 .cse8 .cse12 .cse29 .cse14) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse26) (or (and .cse35 .cse15 .cse36 .cse7 .cse17 .cse18 .cse37 .cse38 .cse20 .cse39 .cse40) .cse41 (or .cse42 .cse0 .cse1 .cse22 .cse2 .cse4 .cse43 .cse5 .cse26) (and (<= ~q_req_up~0 0) .cse44 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse45)) (or .cse42 .cse1 .cse22 .cse43 .cse5 .cse41 .cse26 (= 0 ~q_write_ev~0) .cse46 .cse2 (and .cse44 .cse15 .cse36 .cse7 .cse17 .cse18 .cse19 .cse20 .cse21 .cse45) .cse3) (or (and .cse35 .cse15 .cse24 .cse7 .cse17 .cse18 .cse37 .cse38 .cse20 .cse21 .cse39 .cse40) (or .cse0 .cse28 .cse1 .cse10 .cse22 .cse3 .cse26 .cse12 .cse29 .cse14 .cse46)) (or .cse42 .cse1 .cse22 .cse43 .cse5 .cse0 .cse2 .cse4 .cse23 .cse6 (and .cse44 .cse45) .cse8) (or .cse1 .cse22 .cse27 .cse5 .cse26 .cse0 .cse28 .cse10 .cse4 .cse23 .cse12 .cse29 .cse14) (or .cse47 .cse48 .cse9 .cse1 .cse10 .cse23 .cse8 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse5 (and .cse49 .cse24 .cse18 .cse37 .cse50 .cse20 .cse21 .cse39 .cse40 .cse51) .cse26 .cse13 .cse31 .cse46 .cse9 .cse10 (and .cse24 .cse7 .cse18 .cse37 .cse50 .cse20 .cse21 .cse39 .cse40 .cse51) .cse33 .cse8 .cse11 .cse12 .cse47 .cse14) (or (or .cse0 .cse28 .cse1 .cse10 .cse22 .cse3 .cse4 .cse5 .cse6 .cse12 .cse29 .cse14) .cse41 (and (and .cse44 .cse7 .cse17 .cse18 .cse19 .cse20 .cse45) .cse36)) (or .cse9 .cse1 .cse2 .cse3 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse26 .cse7) (or .cse1 (and .cse36 .cse7 .cse18 .cse50 .cse19 .cse20 .cse52) .cse5 .cse13 .cse31 .cse46 .cse9 .cse10 (and .cse49 .cse16 .cse24 .cse25 .cse18 .cse37 .cse50 .cse39 .cse40 .cse51) .cse6 .cse33 .cse8 .cse11 .cse12 .cse14 (and .cse36 .cse7 .cse17 .cse18 .cse53 .cse37 .cse20 .cse39 .cse52 .cse40)) (or .cse1 .cse22 .cse5 .cse26 .cse0 .cse28 .cse7 .cse10 .cse3 .cse4 .cse12 .cse29 .cse14) (or .cse0 .cse1 .cse22 .cse2 .cse4 .cse54 .cse23 .cse5 .cse26) (or .cse48 .cse9 .cse1 .cse10 .cse23 .cse6 .cse8 .cse11 .cse25 .cse12 .cse13 .cse14) (or .cse42 .cse0 .cse1 .cse22 .cse2 .cse4 (and .cse44 .cse15 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse45) .cse43 (and .cse35 .cse15 .cse24 .cse7 .cse17 .cse18 .cse37 .cse38 .cse20 .cse39 .cse40) .cse8 .cse26) (or .cse48 .cse9 .cse1 .cse2 .cse23) (or .cse1 .cse5 .cse26 .cse46 .cse48 .cse32 .cse9 .cse0 .cse2 .cse34 .cse8 .cse11 .cse30) (or .cse0 .cse1 .cse22 .cse2 .cse4 .cse23 .cse8 .cse26 .cse54)))) [2018-11-23 08:16:00,921 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2018-11-23 08:16:00,922 INFO L444 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse9 (= 1 |old(~c_dr_pc~0)|)) (.cse58 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse8 (= |old(~p_dw_pc~0)| 1)) (.cse60 (+ ~c_num_read~0 1)) (.cse59 (+ |old(~c_num_read~0)| 1)) (.cse49 (= 0 ~p_num_write~0)) (.cse38 (<= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse22 (not (= 0 ~c_dr_st~0))) (.cse40 (<= ~c_num_read~0 ~p_num_write~0)) (.cse47 (not (= ~c_dr_pc~0 1))) (.cse48 (= ~c_num_read~0 0)) (.cse25 (= ~q_free~0 0)) (.cse27 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse30 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse7 (= 2 ~c_dr_st~0)) (.cse23 (= 1 ~c_dr_pc~0)) (.cse24 (= ~p_last_write~0 ~q_buf_0~0)) (.cse57 (= ~c_num_read~0 1)) (.cse39 (<= 1 ~q_free~0)) (.cse26 (= 2 ~p_dw_st~0)) (.cse41 (<= ~q_free~0 1)) (.cse54 (= 1 ~p_num_write~0)) (.cse42 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse20 (and .cse30 .cse7 .cse23 .cse24 .cse57 .cse39 .cse26 .cse41 .cse54 .cse42)) (.cse17 (and .cse47 .cse30 .cse24 .cse48 .cse25 .cse26 .cse27 .cse54)) (.cse19 (not (= 1 |old(~p_num_write~0)|))) (.cse33 (and .cse38 .cse21 .cse22 .cse30 .cse23 .cse24 .cse39 .cse40 .cse26 .cse27 .cse41 .cse42)) (.cse32 (and .cse47 .cse22 .cse30 .cse24 .cse39 .cse48 .cse41 .cse42 .cse49)) (.cse34 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse35 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse43 (< |old(~p_num_write~0)| .cse59)) (.cse45 (<= .cse60 ~p_num_write~0)) (.cse46 (<= ~p_num_write~0 .cse60)) (.cse44 (< .cse59 |old(~p_num_write~0)|)) (.cse50 (not .cse8)) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse18 (and .cse25 .cse47 .cse22 .cse24)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse36 (not .cse58)) (.cse16 (< 0 |old(~q_req_up~0)|)) (.cse10 (< |old(~q_free~0)| 1)) (.cse31 (= ~p_dw_st~0 0)) (.cse52 (= ~p_dw_pc~0 1)) (.cse51 (not (= 0 eval_~tmp___1~0))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse37 (and .cse25 .cse47 .cse22 .cse58 .cse24 (= 2 ~q_read_ev~0))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (< 1 |old(~q_free~0)|)) (.cse14 (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)|))) (.cse28 (not .cse9)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse4 (= 1 |old(~q_req_up~0)|)) (.cse29 (= 0 |old(~c_dr_st~0)|)) (.cse15 (not (= |old(~p_dw_st~0)| 2))) (.cse53 (and .cse21 .cse22 .cse30 .cse23 .cse24 .cse25 .cse26 .cse27))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse7 .cse9 .cse1 .cse10 .cse3 .cse8 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse5 .cse15 .cse16 .cse17 .cse18 .cse9 .cse0 .cse2 .cse19 .cse8 .cse11 .cse20) (or (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse0 .cse1 .cse28 .cse2 .cse4 .cse29 .cse5 .cse6 .cse8 (and .cse21 .cse22 .cse30 .cse31 .cse23 .cse24 .cse25 .cse27)) (or .cse18 .cse32 .cse9 .cse1 .cse10 .cse29 .cse8 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse28 .cse15 .cse33 .cse0 .cse34 .cse10 .cse4 .cse29 .cse8 .cse12 .cse35 .cse14) (or .cse1 .cse5 .cse15 .cse20 .cse36 .cse9 .cse2 .cse4 .cse17 .cse37 .cse19 .cse8 .cse11) (or .cse1 .cse28 .cse15 .cse7 .cse0 .cse34 .cse10 .cse3 .cse4 .cse8 .cse12 .cse35 .cse14) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse15) (or (and .cse38 .cse21 .cse30 .cse7 .cse23 .cse24 .cse39 .cse40 .cse26 .cse27 .cse41 .cse42) (or .cse0 .cse34 .cse1 .cse10 .cse28 .cse3 .cse15 .cse12 .cse35 .cse14 .cse16)) (or .cse43 .cse1 .cse28 .cse44 .cse5 .cse0 .cse2 .cse4 .cse29 .cse6 (and .cse45 .cse46) .cse8) (or .cse1 .cse28 .cse33 .cse5 .cse15 .cse0 .cse34 .cse10 .cse4 .cse29 .cse12 .cse35 .cse14) (or .cse1 .cse5 (and .cse47 .cse30 .cse24 .cse39 .cse48 .cse26 .cse27 .cse41 .cse42 .cse49) .cse15 .cse13 .cse36 .cse16 .cse9 .cse10 (and .cse30 .cse7 .cse24 .cse39 .cse48 .cse26 .cse27 .cse41 .cse42 .cse49) .cse37 .cse8 .cse11 .cse12 .cse32 .cse14) (or (and .cse38 .cse21 .cse30 .cse31 .cse7 .cse23 .cse24 .cse39 .cse40 .cse27 .cse41 .cse42) (or .cse0 .cse34 .cse1 .cse10 .cse28 .cse3 .cse4 .cse5 .cse6 .cse12 .cse35 .cse14) .cse50 (and (and .cse45 .cse7 .cse23 .cse24 .cse25 .cse26 .cse51 .cse46) .cse52)) (or .cse9 .cse1 .cse2 .cse3 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse15 .cse7) (or (and (and .cse38 .cse21 .cse7 .cse23 .cse24 .cse39 .cse40 .cse26 .cse41 .cse51 .cse42) .cse52) .cse50 (or .cse43 .cse0 .cse1 .cse28 .cse2 .cse4 .cse44 .cse5 .cse15) (and (and .cse45 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse46) .cse52)) (or .cse1 .cse28 .cse5 .cse15 .cse0 .cse34 .cse7 .cse10 .cse3 .cse4 .cse12 .cse35 .cse14) (or .cse0 .cse1 .cse28 .cse2 .cse4 .cse53 .cse29 .cse5 .cse15) (or .cse18 .cse9 .cse1 .cse10 .cse29 .cse6 .cse8 .cse11 .cse31 .cse12 .cse13 .cse14) (or .cse43 .cse0 .cse1 .cse28 .cse2 .cse4 (and .cse45 .cse21 .cse30 .cse23 .cse24 .cse25 .cse26 .cse27 .cse46) .cse44 (and .cse38 .cse21 .cse30 .cse7 .cse23 .cse24 .cse39 .cse40 .cse26 .cse41 .cse42) .cse8 .cse15) (or .cse43 .cse1 .cse28 (and .cse45 .cse21 .cse52 .cse7 .cse23 .cse24 .cse25 .cse26 .cse27 .cse46) .cse44 .cse5 .cse50 .cse15 (= 0 ~q_write_ev~0) .cse16 .cse2 .cse3) (or .cse18 .cse9 .cse1 .cse2 .cse29) (let ((.cse55 (= eval_~tmp___1~0 1)) (.cse56 (= 0 ~p_dw_st~0))) (or (and .cse52 (and .cse7 .cse24 .cse48 .cse25 .cse26 .cse51 .cse54)) (and .cse47 .cse55 .cse52 .cse24 .cse48 .cse25 .cse26 .cse54) .cse1 (and .cse39 .cse47 .cse30 .cse56 .cse24 .cse48 .cse27 .cse41 .cse42 .cse49) .cse5 (and .cse55 .cse7 .cse39 .cse30 .cse56 .cse24 .cse48 .cse27 .cse41 .cse42 .cse49) .cse13 .cse36 .cse16 .cse9 .cse10 (and .cse47 .cse22 .cse30 .cse31 .cse24 .cse39 .cse48 .cse41 .cse42 .cse49) (and .cse52 (and .cse7 .cse23 .cse24 .cse57 .cse39 .cse26 .cse41 .cse51 .cse54 .cse42)) .cse6 .cse37 .cse8 .cse11 .cse12 .cse14)) (or .cse0 .cse1 .cse28 .cse2 .cse4 .cse29 .cse8 .cse15 .cse53)))) [2018-11-23 08:16:00,922 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2018-11-23 08:16:00,922 INFO L444 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse9 (= |old(~p_dw_pc~0)| 1)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse45 (+ |old(~c_num_read~0)| 1)) (.cse38 (= ~q_free~0 0)) (.cse23 (not (= ~c_dr_pc~0 1))) (.cse36 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse37 (not (= 0 ~c_dr_st~0))) (.cse16 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse18 (= ~p_last_write~0 ~q_buf_0~0)) (.cse47 (= 2 ~q_read_ev~0)) (.cse14 (<= 1 ~q_free~0)) (.cse19 (= ~c_num_read~0 0)) (.cse21 (<= ~q_free~0 1)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse46 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse22 (= 0 ~p_num_write~0))) (let ((.cse20 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse17 (= 1 ~c_dr_pc~0)) (.cse15 (not (= 0 ~p_dw_st~0))) (.cse13 (= eval_~tmp___1~0 1)) (.cse25 (not (= 0 |old(~p_num_write~0)|))) (.cse31 (and .cse23 .cse36 .cse37 .cse16 .cse18 .cse47 .cse14 .cse19 (not (= ~p_dw_pc~0 1)) .cse21 .cse24 .cse46 .cse22)) (.cse41 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse27 (< |old(~q_free~0)| 1)) (.cse30 (< 1 |old(~q_free~0)|)) (.cse42 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse32 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse26 (not .cse46)) (.cse29 (and .cse38 .cse23 .cse37 .cse46 .cse18 .cse47)) (.cse8 (not (= 1 |old(~p_num_write~0)|))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (and .cse38 .cse23 .cse37 .cse18)) (.cse35 (= 0 |old(~c_dr_st~0)|)) (.cse39 (< |old(~p_num_write~0)| .cse45)) (.cse33 (not .cse0)) (.cse40 (< .cse45 |old(~p_num_write~0)|)) (.cse43 (not .cse9)) (.cse10 (not (= |old(~p_dw_st~0)| 2))) (.cse12 (< 0 |old(~q_req_up~0)|)) (.cse6 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse34 (= 1 |old(~q_req_up~0)|)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse4 (= 2 ~c_dr_st~0)) (.cse28 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse1 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 (and .cse13 .cse4 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse7 (and .cse13 .cse14 .cse15 .cse23 .cse16 .cse18 .cse19 .cse20 .cse21 .cse24 .cse22) .cse25 .cse26 .cse12 .cse0 .cse27 .cse28 .cse29 .cse9 .cse11 .cse30 .cse31 .cse32) (or .cse6 .cse1 .cse33 .cse2 .cse34 .cse35 .cse7 .cse28 (and .cse36 .cse37 .cse16 .cse17 .cse18 .cse38 .cse15 .cse20) .cse9) (or .cse6 .cse1 .cse33 .cse2 .cse34 .cse35 .cse9 .cse10) (or .cse39 .cse6 .cse1 .cse33 .cse2 .cse34 .cse40 .cse9 .cse10) (or (or .cse6 .cse41 .cse1 .cse27 .cse33 .cse3 .cse34 .cse7 .cse28 .cse30 .cse42 .cse32) .cse43 (and (and (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse36 .cse16 .cse21 .cse17 .cse18 .cse14) .cse15 .cse4) .cse13)) (or .cse0 .cse1 .cse27 .cse3 .cse4 .cse9 .cse11 .cse30 .cse25 .cse32) (or .cse6 .cse41 .cse1 .cse27 .cse33 .cse34 .cse35 .cse7 .cse10 .cse30 .cse42 .cse32) (or .cse6 .cse41 .cse1 .cse27 .cse33 .cse3 .cse10 .cse30 .cse42 .cse32 .cse12) (or .cse39 .cse6 .cse1 .cse33 .cse2 .cse34 .cse40 .cse7 .cse10) (or .cse6 .cse1 .cse33 .cse2 .cse34 .cse35 .cse7 .cse10) (or .cse5 .cse0 .cse1 .cse27 .cse35 .cse9 .cse11 (and .cse23 .cse37 .cse16 .cse18 .cse14 .cse19 .cse21 .cse22) .cse30 .cse25 .cse32) (or .cse1 .cse7 .cse10 .cse25 .cse26 .cse12 .cse0 .cse27 .cse29 .cse9 .cse11 .cse30 .cse31 .cse32) (or .cse1 .cse7 .cse25 .cse26 .cse0 .cse27 .cse35 .cse29 .cse9 .cse11 .cse30 .cse31 .cse32) (or .cse6 .cse41 .cse1 .cse27 .cse33 .cse34 .cse35 .cse9 .cse10 .cse30 .cse42 .cse32) (or .cse1 .cse7 .cse10 .cse26 .cse2 .cse34 .cse29 .cse8 .cse9 .cse11) (or .cse5 .cse0 .cse1 .cse2 .cse35) (or .cse39 .cse6 .cse1 .cse33 .cse2 .cse34 (let ((.cse44 (+ ~c_num_read~0 1))) (and (<= .cse44 ~p_num_write~0) (<= ~p_num_write~0 .cse44))) .cse40 .cse35 .cse7 .cse28 .cse9) (or .cse39 .cse1 .cse33 .cse2 .cse3 .cse40 .cse7 .cse43 .cse10 (= 0 ~q_write_ev~0) .cse12) (or .cse6 .cse1 .cse2 .cse3 .cse34 .cse7 .cse4 .cse28 .cse9)))) [2018-11-23 08:16:00,922 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2018-11-23 08:16:00,923 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2018-11-23 08:16:00,923 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-23 08:16:00,923 INFO L444 ceAbstractionStarter]: At program point L330(line 330) the Hoare annotation is: (let ((.cse9 (= 1 |old(~c_dr_pc~0)|)) (.cse58 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse8 (= |old(~p_dw_pc~0)| 1)) (.cse60 (+ ~c_num_read~0 1)) (.cse59 (+ |old(~c_num_read~0)| 1)) (.cse53 (= 0 ~p_num_write~0)) (.cse37 (<= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse22 (not (= 0 ~c_dr_st~0))) (.cse39 (<= ~c_num_read~0 ~p_num_write~0)) (.cse51 (not (= ~c_dr_pc~0 1))) (.cse52 (= ~c_num_read~0 0)) (.cse25 (= ~q_free~0 0)) (.cse27 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse30 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse7 (= 2 ~c_dr_st~0)) (.cse23 (= 1 ~c_dr_pc~0)) (.cse24 (= ~p_last_write~0 ~q_buf_0~0)) (.cse57 (= ~c_num_read~0 1)) (.cse38 (<= 1 ~q_free~0)) (.cse26 (= 2 ~p_dw_st~0)) (.cse40 (<= ~q_free~0 1)) (.cse54 (= 1 ~p_num_write~0)) (.cse41 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse20 (and .cse30 .cse7 .cse23 .cse24 .cse57 .cse38 .cse26 .cse40 .cse54 .cse41)) (.cse17 (and .cse51 .cse30 .cse24 .cse52 .cse25 .cse26 .cse27 .cse54)) (.cse19 (not (= 1 |old(~p_num_write~0)|))) (.cse32 (and .cse37 .cse21 .cse22 .cse30 .cse23 .cse24 .cse38 .cse39 .cse26 .cse27 .cse40 .cse41)) (.cse33 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse34 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse46 (and .cse51 .cse22 .cse30 .cse24 .cse38 .cse52 .cse40 .cse41 .cse53)) (.cse42 (< |old(~p_num_write~0)| .cse59)) (.cse44 (<= .cse60 ~p_num_write~0)) (.cse45 (<= ~p_num_write~0 .cse60)) (.cse43 (< .cse59 |old(~p_num_write~0)|)) (.cse47 (not .cse8)) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse18 (and .cse25 .cse51 .cse22 .cse24)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse35 (not .cse58)) (.cse16 (< 0 |old(~q_req_up~0)|)) (.cse10 (< |old(~q_free~0)| 1)) (.cse31 (= ~p_dw_st~0 0)) (.cse49 (= ~p_dw_pc~0 1)) (.cse48 (not (= 0 eval_~tmp___1~0))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse36 (and .cse25 .cse51 .cse22 .cse58 .cse24 (= 2 ~q_read_ev~0))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (< 1 |old(~q_free~0)|)) (.cse14 (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)|))) (.cse28 (not .cse9)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse4 (= 1 |old(~q_req_up~0)|)) (.cse29 (= 0 |old(~c_dr_st~0)|)) (.cse15 (not (= |old(~p_dw_st~0)| 2))) (.cse50 (and .cse21 .cse22 .cse30 .cse23 .cse24 .cse25 .cse26 .cse27))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse7 .cse9 .cse1 .cse10 .cse3 .cse8 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse5 .cse15 .cse16 .cse17 .cse18 .cse9 .cse0 .cse2 .cse19 .cse8 .cse11 .cse20) (or (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse0 .cse1 .cse28 .cse2 .cse4 .cse29 .cse5 .cse6 .cse8 (and .cse21 .cse22 .cse30 .cse31 .cse23 .cse24 .cse25 .cse27)) (or .cse1 .cse28 .cse15 .cse32 .cse0 .cse33 .cse10 .cse4 .cse29 .cse8 .cse12 .cse34 .cse14) (or .cse1 .cse5 .cse15 .cse20 .cse35 .cse9 .cse2 .cse4 .cse17 .cse36 .cse19 .cse8 .cse11) (or .cse1 .cse28 .cse15 .cse7 .cse0 .cse33 .cse10 .cse3 .cse4 .cse8 .cse12 .cse34 .cse14) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse15) (or (and .cse37 .cse21 .cse30 .cse7 .cse23 .cse24 .cse38 .cse39 .cse26 .cse27 .cse40 .cse41) (or .cse0 .cse33 .cse1 .cse10 .cse28 .cse3 .cse15 .cse12 .cse34 .cse14 .cse16)) (or .cse42 .cse1 .cse28 .cse43 .cse5 .cse0 .cse2 .cse4 .cse29 .cse6 (and .cse44 .cse45) .cse8) (or .cse1 .cse28 .cse32 .cse5 .cse15 .cse0 .cse33 .cse10 .cse4 .cse29 .cse12 .cse34 .cse14) (or .cse46 .cse18 .cse9 .cse1 .cse10 .cse29 .cse8 .cse11 .cse12 .cse13 .cse14) (or (and .cse37 .cse21 .cse30 .cse31 .cse7 .cse23 .cse24 .cse38 .cse39 .cse27 .cse40 .cse41) (or .cse0 .cse33 .cse1 .cse10 .cse28 .cse3 .cse4 .cse5 .cse6 .cse12 .cse34 .cse14) .cse47 (and (and .cse44 .cse7 .cse23 .cse24 .cse25 .cse26 .cse48 .cse45) .cse49)) (or .cse9 .cse1 .cse2 .cse3 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse15 .cse7) (or (and (and .cse37 .cse21 .cse7 .cse23 .cse24 .cse38 .cse39 .cse26 .cse40 .cse48 .cse41) .cse49) .cse47 (or .cse42 .cse0 .cse1 .cse28 .cse2 .cse4 .cse43 .cse5 .cse15) (and (and .cse44 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse45) .cse49)) (or .cse1 .cse28 .cse5 .cse15 .cse0 .cse33 .cse7 .cse10 .cse3 .cse4 .cse12 .cse34 .cse14) (or .cse0 .cse1 .cse28 .cse2 .cse4 .cse50 .cse29 .cse5 .cse15) (or .cse1 .cse5 (and .cse51 .cse30 .cse24 .cse38 .cse52 .cse26 .cse27 .cse40 .cse41 .cse53) .cse15 .cse13 .cse35 .cse16 .cse9 .cse10 .cse36 (and .cse30 .cse7 .cse24 .cse38 .cse52 .cse26 .cse27 .cse40 .cse41 .cse53) .cse8 .cse11 .cse12 .cse46 .cse14) (or .cse18 .cse9 .cse1 .cse10 .cse29 .cse6 .cse8 .cse11 .cse31 .cse12 .cse13 .cse14) (or .cse42 .cse0 .cse1 .cse28 .cse2 .cse4 (and .cse44 .cse21 .cse30 .cse23 .cse24 .cse25 .cse26 .cse27 .cse45) .cse43 (and .cse37 .cse21 .cse30 .cse7 .cse23 .cse24 .cse38 .cse39 .cse26 .cse40 .cse41) .cse8 .cse15) (or .cse42 .cse1 .cse28 (and .cse44 .cse21 .cse49 .cse7 .cse23 .cse24 .cse25 .cse26 .cse27 .cse45) .cse43 .cse5 .cse47 .cse15 (= 0 ~q_write_ev~0) .cse16 .cse2 .cse3) (or .cse18 .cse9 .cse1 .cse2 .cse29) (let ((.cse55 (= eval_~tmp___1~0 1)) (.cse56 (= 0 ~p_dw_st~0))) (or (and .cse49 (and .cse7 .cse24 .cse52 .cse25 .cse26 .cse48 .cse54)) (and .cse51 .cse55 .cse49 .cse24 .cse52 .cse25 .cse26 .cse54) .cse1 (and .cse38 .cse51 .cse30 .cse56 .cse24 .cse52 .cse27 .cse40 .cse41 .cse53) .cse5 (and .cse55 .cse7 .cse38 .cse30 .cse56 .cse24 .cse52 .cse27 .cse40 .cse41 .cse53) .cse13 .cse35 .cse16 .cse9 .cse10 (and .cse51 .cse22 .cse30 .cse31 .cse24 .cse38 .cse52 .cse40 .cse41 .cse53) (and .cse49 (and .cse7 .cse23 .cse24 .cse57 .cse38 .cse26 .cse40 .cse48 .cse54 .cse41)) .cse6 .cse36 .cse8 .cse11 .cse12 .cse14)) (or .cse0 .cse1 .cse28 .cse2 .cse4 .cse29 .cse8 .cse15 .cse50)))) [2018-11-23 08:16:00,924 INFO L444 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse45 (+ ~c_num_read~0 1)) (.cse17 (= 1 |old(~c_dr_pc~0)|)) (.cse46 (+ |old(~c_num_read~0)| 1)) (.cse19 (= |old(~p_dw_pc~0)| 1)) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 0 ~c_dr_st~0))) (.cse4 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_num_read~0 0)) (.cse39 (= ~q_free~0 0)) (.cse8 (= 2 ~p_dw_st~0)) (.cse9 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse44 (= 1 ~p_num_write~0))) (let ((.cse30 (not (= 2 |old(~c_dr_st~0)|))) (.cse6 (<= 1 ~q_free~0)) (.cse10 (<= ~q_free~0 1)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse15 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse28 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse32 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse18 (< |old(~q_free~0)| 1)) (.cse21 (< 1 |old(~q_free~0)|)) (.cse14 (not (= 0 |old(~p_num_write~0)|))) (.cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse34 (= 0 |old(~c_dr_st~0)|)) (.cse31 (not (= |old(~p_dw_st~0)| 0))) (.cse23 (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse39 .cse8 .cse9 .cse44)) (.cse26 (not (= 1 |old(~p_num_write~0)|))) (.cse20 (not (= 0 |old(~c_num_read~0)|))) (.cse16 (< 0 |old(~q_req_up~0)|)) (.cse33 (not .cse19)) (.cse35 (< |old(~p_num_write~0)| .cse46)) (.cse27 (< ~q_write_ev~0 2)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse29 (not .cse17)) (.cse24 (not (= |old(~q_free~0)| 0))) (.cse25 (= 1 |old(~q_req_up~0)|)) (.cse41 (< .cse46 |old(~p_num_write~0)|)) (.cse1 (not (= ~q_read_ev~0 2))) (.cse13 (not (= |old(~p_dw_st~0)| 2))) (.cse36 (<= .cse45 ~p_num_write~0)) (.cse37 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse38 (= 1 ~c_dr_pc~0)) (.cse40 (<= ~p_num_write~0 .cse45)) (.cse42 (= eval_~tmp___1~0 1)) (.cse43 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse13 .cse23 .cse15 .cse17 .cse24 .cse25 .cse26 .cse19 .cse20) (or (or .cse27 .cse28 .cse0 .cse18 .cse29 .cse30 .cse25 .cse1 .cse31 .cse21 .cse32 .cse22) .cse33) (or .cse27 .cse28 .cse0 .cse18 .cse29 .cse25 .cse34 .cse1 .cse13 .cse21 .cse32 .cse22) (or .cse35 .cse27 (and .cse36 .cse37 .cse3 .cse4 .cse38 .cse5 .cse39 .cse8 .cse9 .cse40) .cse0 .cse29 .cse24 .cse25 .cse41 .cse19 .cse13) (or .cse27 .cse0 .cse24 .cse25 .cse34 .cse19 .cse13) (or .cse27 .cse28 .cse0 .cse18 .cse29 .cse30 .cse13 .cse21 .cse32 .cse22 .cse16) (or .cse17 .cse0 .cse24 .cse34) (or .cse27 .cse0 .cse24 .cse25 .cse34 .cse1 .cse13) (or .cse35 .cse0 .cse24 .cse30 .cse41 .cse1 .cse33 .cse13 (= 0 ~q_write_ev~0) .cse16) (or .cse0 (and .cse2 .cse42 .cse3 .cse43 .cse5 .cse7 .cse39 .cse8 .cse44) .cse1 (and .cse42 .cse3 .cse6 .cse2 .cse4 (= 0 ~p_dw_st~0) .cse5 .cse7 .cse9 .cse10 .cse11 .cse12) .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse22) (or .cse27 .cse28 .cse0 .cse18 .cse29 .cse25 .cse34 .cse19 .cse13 .cse21 .cse32 .cse22) (or .cse17 .cse0 .cse18 .cse34 .cse19 .cse20 .cse21 .cse14 .cse22) (or .cse27 .cse0 .cse24 .cse25 .cse34 .cse1 .cse31 .cse19) (or .cse17 .cse27 .cse0 .cse24 .cse1 .cse23 .cse26 .cse19 .cse13 .cse20 .cse16) (or .cse33 (or .cse35 .cse27 .cse0 .cse29 .cse24 .cse25 .cse41 .cse1 .cse13) (and (and .cse36 .cse37 .cse3 .cse38 .cse5 .cse39 .cse8 .cse9 .cse40) .cse42 .cse43))))) [2018-11-23 08:16:00,924 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2018-11-23 08:16:00,924 INFO L444 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse6 (= 1 ~c_dr_pc~0))) (let ((.cse27 (+ ~c_num_read~0 1)) (.cse19 (not .cse6)) (.cse2 (not (= ~q_read_ev~0 2)))) (let ((.cse21 (not (= 1 ~p_num_write~0))) (.cse8 (not (= ~p_dw_st~0 0))) (.cse24 (not (= 2 ~c_dr_st~0))) (.cse25 (or .cse19 .cse2)) (.cse22 (< ~p_num_write~0 .cse27)) (.cse13 (not (= ~q_free~0 0))) (.cse23 (< .cse27 ~p_num_write~0)) (.cse3 (not (= 0 ~p_num_write~0))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (< 0 ~q_req_up~0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse10 (not (= 0 ~c_num_read~0))) (.cse16 (< ~q_write_ev~0 2)) (.cse17 (< ~p_num_write~0 ~c_num_read~0)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (< ~q_free~0 1)) (.cse14 (= 0 ~c_dr_st~0)) (.cse11 (< 1 ~q_free~0)) (.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (not (= ~p_dw_st~0 2))) (.cse18 (= 1 ~q_req_up~0)) (.cse26 (not (= ~q_read_ev~0 1))) (.cse1 (= 0 is_do_read_c_triggered_~__retres1~1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse13 .cse14 .cse6) (or .cse0 .cse15 .cse16 .cse17 .cse7 .cse18 .cse1 .cse14 .cse19 .cse9 .cse11 .cse20 .cse12) (or .cse16 .cse0 .cse1 .cse13 .cse21 .cse9 .cse15 .cse10 .cse2 .cse5) (or .cse0 .cse7 .cse14 .cse9 .cse10 .cse1 .cse11 .cse3 .cse6 .cse12) (or .cse22 .cse0 .cse23 .cse15 (= 0 ~q_write_ev~0) .cse1 (not (= 1 ~p_dw_pc~0)) .cse5 .cse13 .cse24 .cse25 (= 1 ~q_write_ev~0)) (or .cse0 .cse2 .cse15 .cse4 .cse13 .cse18 .cse1 .cse21 .cse9 .cse10) (or .cse16 .cse0 .cse13 .cse18 .cse1 .cse14 .cse2 .cse15) (or .cse16 .cse0 .cse13 .cse1 .cse18 .cse14 .cse2 .cse8 .cse9) (or .cse16 .cse0 .cse13 .cse18 .cse14 .cse9 .cse15 .cse1) (or (or .cse0 .cse5 .cse17 .cse16 .cse7 .cse24 .cse8 .cse19 .cse11 .cse20 .cse12) .cse26 (not .cse9) .cse1) (or .cse1 (or .cse16 (or (or .cse17 .cse0 .cse7 .cse24 .cse19 .cse11 .cse20 .cse12) .cse15) .cse5)) (or .cse0 .cse1 .cse15 .cse17 .cse16 .cse7 .cse18 .cse25 .cse14 .cse11 .cse20 .cse12) (or .cse22 .cse16 .cse0 .cse13 .cse18 .cse23 .cse19 .cse9 .cse15 .cse1) (or .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (or (or .cse16 (or (or .cse17 .cse0 .cse7 .cse14 .cse19 .cse11 .cse20 .cse12) .cse15) .cse18) .cse26 .cse1))))) [2018-11-23 08:16:00,927 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2018-11-23 08:16:00,927 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-23 08:16:00,927 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2018-11-23 08:16:00,927 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2018-11-23 08:16:00,927 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2018-11-23 08:16:00,928 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse24 (+ ~c_num_read~0 1)) (.cse23 (= ~p_dw_pc~0 1))) (let ((.cse18 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse17 (= 1 ~p_num_write~0)) (.cse22 (<= ~q_req_up~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse21 (= 0 ~p_num_write~0)) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse6 (not (= ~q_req_up~0 1))) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (not .cse23)) (.cse13 (<= ~q_free~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 1 ~c_dr_pc~0)) (.cse15 (<= 1 ~q_free~0)) (.cse1 (<= .cse24 ~p_num_write~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 2 ~q_read_ev~0)) (.cse0 (= ~q_free~0 0)) (.cse2 (= 2 ~p_dw_st~0)) (.cse5 (<= ~p_num_write~0 .cse24))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse4 .cse3 .cse6 (= 0 ~p_dw_st~0) .cse8 .cse10) (< 0 |old(~q_req_up~0)|) (and .cse2 .cse3 (and .cse11 .cse12 .cse9 .cse13 .cse14 .cse7 .cse8 .cse10 .cse15) .cse6) (= 1 |old(~c_dr_pc~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)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse8 .cse10 .cse16 .cse0 .cse2 .cse4 .cse17 .cse6 .cse18) (not (= |old(~q_read_ev~0)| 2)) (and .cse2 .cse3 (and .cse11 .cse12 .cse13 .cse14 .cse19 .cse7 .cse8 .cse10 .cse15)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse20 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse8 .cse10 .cse15 .cse16 .cse2 (= |old(~q_req_up~0)| ~q_req_up~0) .cse13 .cse14 .cse18 .cse21) (and .cse22 .cse2 .cse3 (and .cse16 .cse0 .cse4 .cse17 .cse8 .cse10)) (and .cse11 .cse12 .cse22 .cse2 .cse3 .cse13 .cse14 .cse19 .cse7 .cse8 .cse15) (and .cse12 .cse9 .cse3 .cse7 .cse8 .cse15 .cse11 .cse2 .cse4 .cse13 .cse14 .cse6) (and .cse22 .cse1 .cse23 .cse19 (not (= 0 ~q_write_ev~0)) .cse8 .cse10 .cse0 .cse2 .cse5) (< |old(~q_free~0)| 1) (and .cse0 .cse20 .cse9 .cse8) (and .cse2 .cse3 .cse6 (and .cse0 .cse9 .cse8 .cse10)) (and .cse16 .cse20 .cse9 .cse4 .cse13 .cse14 .cse8 .cse15 .cse21) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse6 .cse8) (and .cse11 .cse12 .cse2 .cse4 .cse3 .cse13 .cse14 .cse19 .cse7 .cse8 .cse15) (and .cse1 .cse3 .cse23 .cse19 .cse8 .cse10 .cse0 .cse2 .cse5) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-23 08:16:00,931 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-11-23 08:16:00,931 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse24 (= ~p_dw_pc~0 1)) (.cse27 (+ ~c_num_read~0 1))) (let ((.cse3 (= 0 ~p_dw_st~0)) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse9 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse25 (= 1 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (= 1 ~c_dr_pc~0)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~q_req_up~0 0)) (.cse12 (<= .cse27 ~p_num_write~0)) (.cse23 (= 2 ~c_dr_st~0)) (.cse16 (<= ~p_num_write~0 .cse27)) (.cse20 (= 2 ~q_read_ev~0)) (.cse5 (= ~c_num_read~0 0)) (.cse1 (not (= ~c_dr_pc~0 1))) (.cse7 (<= ~q_free~0 1)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (<= 1 ~q_free~0)) (.cse10 (= 0 ~p_num_write~0)) (.cse11 (= ~q_free~0 0)) (.cse13 (= 2 ~p_dw_st~0)) (.cse19 (not (= 0 ~c_dr_st~0))) (.cse14 (<= 2 ~q_write_ev~0)) (.cse15 (not .cse24)) (.cse17 (not (= ~q_req_up~0 1))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse4) (and .cse11 .cse19 .cse15 .cse14 .cse17 .cse3 .cse4 .cse20) (and (and .cse14 .cse17 (and .cse21 .cse22 .cse7 .cse8 (= ~p_dw_st~0 0) .cse23 .cse18 .cse4 .cse20 .cse0)) .cse24) (< 0 |old(~q_req_up~0)|) (and .cse13 .cse14 (and .cse21 .cse22 .cse19 .cse7 .cse8 .cse18 .cse4 .cse20 .cse0) .cse17) (= 1 |old(~c_dr_pc~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)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse4 .cse20 .cse5 .cse11 .cse13 .cse15 .cse25 .cse17 .cse9) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse4 .cse20) (and .cse1 .cse2 .cse4 .cse20 .cse0 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse26 .cse13 .cse14 (and .cse5 .cse11 .cse15 .cse25 .cse4 .cse20)) (and .cse21 .cse22 .cse26 .cse13 .cse14 .cse7 .cse8 .cse23 .cse18 .cse4 .cse0) (and .cse22 .cse19 .cse14 .cse18 .cse4 .cse0 .cse21 .cse13 .cse15 .cse7 .cse8 .cse17) (and .cse26 .cse12 .cse24 .cse23 (not (= 0 ~q_write_ev~0)) .cse4 .cse20 .cse11 .cse13 .cse16) (< |old(~q_free~0)| 1) (and .cse11 .cse1 .cse19 .cse4) (and .cse13 .cse14 .cse17 (and .cse11 .cse19 .cse4 .cse20)) (and .cse5 .cse1 .cse19 .cse15 .cse7 .cse8 .cse4 .cse0 .cse10) (not (= 0 |old(~p_num_write~0)|)) (and .cse11 .cse13 .cse19 .cse14 .cse15 .cse17 .cse4) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-23 08:16:00,933 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-23 08:16:00,933 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2018-11-23 08:16:00,933 INFO L444 ceAbstractionStarter]: At program point L409-1(lines 406 431) the Hoare annotation is: (let ((.cse24 (= ~p_dw_pc~0 1)) (.cse27 (+ ~c_num_read~0 1))) (let ((.cse3 (= 0 ~p_dw_st~0)) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse9 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse25 (= 1 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (= 1 ~c_dr_pc~0)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~q_req_up~0 0)) (.cse12 (<= .cse27 ~p_num_write~0)) (.cse23 (= 2 ~c_dr_st~0)) (.cse16 (<= ~p_num_write~0 .cse27)) (.cse20 (= 2 ~q_read_ev~0)) (.cse5 (= ~c_num_read~0 0)) (.cse1 (not (= ~c_dr_pc~0 1))) (.cse7 (<= ~q_free~0 1)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (<= 1 ~q_free~0)) (.cse10 (= 0 ~p_num_write~0)) (.cse11 (= ~q_free~0 0)) (.cse13 (= 2 ~p_dw_st~0)) (.cse19 (not (= 0 ~c_dr_st~0))) (.cse14 (<= 2 ~q_write_ev~0)) (.cse15 (not .cse24)) (.cse17 (not (= ~q_req_up~0 1))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse4) (and .cse11 .cse19 .cse15 .cse14 .cse17 .cse3 .cse4 .cse20) (and (and .cse14 .cse17 (and .cse21 .cse22 .cse7 .cse8 (= ~p_dw_st~0 0) .cse23 .cse18 .cse4 .cse20 .cse0)) .cse24) (< 0 |old(~q_req_up~0)|) (and .cse13 .cse14 (and .cse21 .cse22 .cse19 .cse7 .cse8 .cse18 .cse4 .cse20 .cse0) .cse17) (= 1 |old(~c_dr_pc~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)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse4 .cse20 .cse5 .cse11 .cse13 .cse15 .cse25 .cse17 .cse9) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse4 .cse20) (and .cse1 .cse2 .cse4 .cse20 .cse0 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse26 .cse13 .cse14 (and .cse5 .cse11 .cse15 .cse25 .cse4 .cse20)) (and .cse21 .cse22 .cse26 .cse13 .cse14 .cse7 .cse8 .cse23 .cse18 .cse4 .cse0) (and .cse22 .cse19 .cse14 .cse18 .cse4 .cse0 .cse21 .cse13 .cse15 .cse7 .cse8 .cse17) (and .cse26 .cse12 .cse24 .cse23 (not (= 0 ~q_write_ev~0)) .cse4 .cse20 .cse11 .cse13 .cse16) (< |old(~q_free~0)| 1) (and .cse11 .cse1 .cse19 .cse4) (and .cse13 .cse14 .cse17 (and .cse11 .cse19 .cse4 .cse20)) (and .cse5 .cse1 .cse19 .cse15 .cse7 .cse8 .cse4 .cse0 .cse10) (not (= 0 |old(~p_num_write~0)|)) (and .cse11 .cse13 .cse19 .cse14 .cse15 .cse17 .cse4) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-23 08:16:00,935 INFO L444 ceAbstractionStarter]: At program point L405(line 405) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 1 ~q_free~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse6 (<= ~q_free~0 1)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse9 (= 0 ~p_num_write~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~p_dw_st~0) .cse5 .cse6 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse7 .cse8 .cse9) (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 .cse4 .cse0 .cse1 .cse6 .cse7 (= 2 ~c_dr_st~0) .cse2 .cse9 .cse3) (and .cse0 .cse1 (= ~p_dw_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse9) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-11-23 08:16:00,935 INFO L444 ceAbstractionStarter]: At program point L403(line 403) the Hoare annotation is: (let ((.cse5 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse8 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse4 (= ~c_num_read~0 0)) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (<= ~q_free~0 1)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= 0 ~p_num_write~0)) (.cse3 (<= 1 ~q_free~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 (= ~p_dw_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse9) (not (= |old(~q_read_ev~0)| 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~p_dw_st~0) .cse5 .cse6 .cse7 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse8 .cse9) (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 .cse4 .cse0 .cse1 .cse6 .cse7 (= 2 ~c_dr_st~0) .cse2 .cse9 .cse3) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-11-23 08:16:00,940 INFO L451 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2018-11-23 08:16:00,940 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-11-23 08:16:00,940 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-23 08:16:00,940 INFO L444 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse17 (= ~p_dw_pc~0 1)) (.cse25 (+ ~c_num_read~0 1))) (let ((.cse21 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse23 (= 0 ~p_num_write~0)) (.cse16 (<= .cse25 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 .cse25)) (.cse15 (<= ~q_req_up~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse20 (= 1 ~p_num_write~0)) (.cse14 (= 2 ~q_read_ev~0)) (.cse2 (= 2 ~p_dw_st~0)) (.cse13 (not .cse17)) (.cse12 (= ~q_free~0 0)) (.cse22 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 0 ~c_dr_st~0))) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse24 (= 2 ~c_dr_st~0)) (.cse8 (= 1 ~c_dr_pc~0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 1 ~q_free~0)) (.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (not (= ~q_req_up~0 1))) (.cse11 (= ~q_read_ev~0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (and .cse12 .cse3 .cse13 .cse4 .cse7 (= 0 ~p_dw_st~0) .cse9 .cse14) (and .cse2 .cse4 (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse8 .cse9 .cse14 .cse10) .cse7) (= 1 |old(~c_dr_pc~0)|) (and .cse15 .cse16 .cse17 .cse8 .cse9 .cse14 .cse12 .cse2 .cse18 (= 1 ~q_write_ev~0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse9 .cse14 .cse19 .cse12 .cse2 .cse13 .cse20 .cse7 .cse21) (and .cse22 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse9 .cse14 .cse10 .cse19 .cse2 (= |old(~q_req_up~0)| ~q_req_up~0) .cse5 .cse6 .cse21 .cse23) (and .cse0 .cse1 .cse15 .cse2 .cse4 .cse5 .cse6 .cse24 .cse8 .cse9 .cse10) (and .cse15 .cse16 .cse17 .cse24 (not (= 0 ~q_write_ev~0)) .cse9 .cse14 .cse12 .cse2 .cse18) (< |old(~q_free~0)| 1) (and .cse2 .cse4 .cse7 (and .cse12 .cse3 .cse9 .cse14)) (and .cse19 .cse22 .cse3 .cse13 .cse5 .cse6 .cse9 .cse10 .cse23) (and .cse12 .cse2 .cse3 .cse4 .cse13 .cse7 .cse9) (not (= |old(~p_dw_st~0)| 0)) (and .cse12 .cse16 .cse2 .cse4 .cse13 .cse18 .cse7 .cse8 .cse9) (< 0 |old(~q_req_up~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 .cse15 .cse2 .cse4 (and .cse19 .cse12 .cse13 .cse20 .cse9 .cse14)) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse10 .cse0 .cse2 .cse13 .cse5 .cse6 .cse7) (and .cse12 .cse22 .cse3 .cse9) (not (= 0 |old(~p_num_write~0)|)) (and .cse17 (and .cse1 .cse4 (= ~p_dw_st~0 0) .cse24 .cse8 .cse9 .cse10 .cse0 .cse5 .cse6 .cse7) .cse11)))) [2018-11-23 08:16:00,941 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 395 437) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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(~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) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-23 08:16:00,941 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-23 08:16:00,941 INFO L444 ceAbstractionStarter]: At program point L404(line 404) the Hoare annotation is: (let ((.cse5 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse8 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse4 (= ~c_num_read~0 0)) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (<= ~q_free~0 1)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= 0 ~p_num_write~0)) (.cse3 (<= 1 ~q_free~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~p_dw_st~0) .cse5 .cse6 .cse7 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse8 .cse9) (and .cse0 .cse1 (= ~p_dw_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse9) (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 .cse4 .cse0 .cse1 .cse6 .cse7 (= 2 ~c_dr_st~0) .cse2 .cse9 .cse3) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-11-23 08:16:00,943 INFO L444 ceAbstractionStarter]: At program point L402(line 402) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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(~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) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-23 08:16:00,943 INFO L444 ceAbstractionStarter]: At program point L402-1(line 402) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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(~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) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-23 08:16:00,943 INFO L444 ceAbstractionStarter]: At program point L423(line 423) the Hoare annotation is: (let ((.cse17 (= ~p_dw_pc~0 1)) (.cse24 (+ ~c_num_read~0 1))) (let ((.cse20 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse19 (= 1 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 1 ~c_dr_pc~0)) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse23 (<= ~q_req_up~0 0)) (.cse1 (<= .cse24 ~p_num_write~0)) (.cse15 (= 2 ~c_dr_st~0)) (.cse5 (<= ~p_num_write~0 .cse24)) (.cse10 (= 2 ~q_read_ev~0)) (.cse18 (= ~c_num_read~0 0)) (.cse21 (not (= ~c_dr_pc~0 1))) (.cse13 (<= ~q_free~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= 1 ~q_free~0)) (.cse22 (= 0 ~p_num_write~0)) (.cse0 (= ~q_free~0 0)) (.cse2 (= 2 ~p_dw_st~0)) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not .cse17)) (.cse6 (not (= ~q_req_up~0 1))) (.cse8 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse4 .cse3 .cse6 (= 0 ~p_dw_st~0) .cse8 .cse10) (and (and .cse3 .cse6 (and .cse11 .cse12 .cse13 .cse14 (= ~p_dw_st~0 0) .cse15 .cse7 .cse8 .cse10 .cse16)) .cse17) (< 0 |old(~q_req_up~0)|) (and .cse2 .cse3 (and .cse11 .cse12 .cse9 .cse13 .cse14 .cse7 .cse8 .cse10 .cse16) .cse6) (= 1 |old(~c_dr_pc~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)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse8 .cse10 .cse18 .cse0 .cse2 .cse4 .cse19 .cse6 .cse20) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10) (and .cse21 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse8 .cse10 .cse16 .cse18 .cse2 (= |old(~q_req_up~0)| ~q_req_up~0) .cse13 .cse14 .cse20 .cse22) (and .cse23 .cse2 .cse3 (and .cse18 .cse0 .cse4 .cse19 .cse8 .cse10)) (and .cse11 .cse12 .cse23 .cse2 .cse3 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16) (and .cse12 .cse9 .cse3 .cse7 .cse8 .cse16 .cse11 .cse2 .cse4 .cse13 .cse14 .cse6) (and .cse23 .cse1 .cse17 .cse15 (not (= 0 ~q_write_ev~0)) .cse8 .cse10 .cse0 .cse2 .cse5) (< |old(~q_free~0)| 1) (and .cse0 .cse21 .cse9 .cse8) (and .cse2 .cse3 .cse6 (and .cse0 .cse9 .cse8 .cse10)) (and .cse18 .cse21 .cse9 .cse4 .cse13 .cse14 .cse8 .cse16 .cse22) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse6 .cse8) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-23 08:16:00,944 INFO L444 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 1)) (.cse24 (+ ~c_num_read~0 1))) (let ((.cse1 (<= .cse24 ~p_num_write~0)) (.cse8 (<= ~p_num_write~0 .cse24)) (.cse21 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse20 (= 1 ~p_num_write~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse3 (= 2 ~c_dr_st~0)) (.cse15 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= 1 ~c_dr_pc~0)) (.cse14 (<= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= 2 ~q_read_ev~0)) (.cse19 (= ~c_num_read~0 0)) (.cse22 (not (= ~c_dr_pc~0 1))) (.cse16 (<= ~q_free~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (<= 1 ~q_free~0)) (.cse23 (= 0 ~p_num_write~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse13 (not (= 0 ~c_dr_st~0))) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (not .cse2)) (.cse11 (not (= ~q_req_up~0 1))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse6 .cse1 .cse7 .cse9 .cse10 .cse8 .cse11 .cse12 .cse4) (and .cse6 .cse13 .cse10 .cse9 .cse11 (= 0 ~p_dw_st~0) .cse4 .cse5) (< 0 |old(~q_req_up~0)|) (and .cse7 .cse9 (and .cse14 .cse15 .cse13 .cse16 .cse17 .cse12 .cse4 .cse5 .cse18) .cse11) (= 1 |old(~c_dr_pc~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)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse4 .cse5 .cse19 .cse6 .cse7 .cse10 .cse20 .cse11 .cse21) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse22 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse4 .cse5 .cse18 .cse19 .cse7 (= |old(~q_req_up~0)| ~q_req_up~0) .cse16 .cse17 .cse21 .cse23) (and .cse0 .cse7 .cse9 (and .cse19 .cse6 .cse10 .cse20 .cse4 .cse5)) (and .cse14 .cse15 .cse0 .cse7 .cse9 .cse16 .cse17 .cse3 .cse12 .cse4 .cse18) (and .cse15 .cse13 .cse9 .cse12 .cse4 .cse18 .cse14 .cse7 .cse10 .cse16 .cse17 .cse11) (< |old(~q_free~0)| 1) (and .cse6 .cse22 .cse13 .cse4) (and .cse7 .cse9 .cse11 (and .cse6 .cse13 .cse4 .cse5)) (and .cse19 .cse22 .cse13 .cse10 .cse16 .cse17 .cse4 .cse18 .cse23) (not (= 0 |old(~p_num_write~0)|)) (and .cse6 .cse7 .cse13 .cse9 .cse10 .cse11 .cse4) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-23 08:16:00,946 INFO L444 ceAbstractionStarter]: At program point L421-1(line 421) the Hoare annotation is: (let ((.cse23 (= ~p_dw_pc~0 1)) (.cse24 (+ ~c_num_read~0 1))) (let ((.cse18 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse17 (= 1 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 1 ~c_dr_pc~0)) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~q_req_up~0 0)) (.cse1 (<= .cse24 ~p_num_write~0)) (.cse22 (= 2 ~c_dr_st~0)) (.cse5 (<= ~p_num_write~0 .cse24)) (.cse10 (= 2 ~q_read_ev~0)) (.cse16 (= ~c_num_read~0 0)) (.cse19 (not (= ~c_dr_pc~0 1))) (.cse13 (<= ~q_free~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (<= 1 ~q_free~0)) (.cse20 (= 0 ~p_num_write~0)) (.cse0 (= ~q_free~0 0)) (.cse2 (= 2 ~p_dw_st~0)) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not .cse23)) (.cse6 (not (= ~q_req_up~0 1))) (.cse8 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse4 .cse3 .cse6 (= 0 ~p_dw_st~0) .cse8 .cse10) (< 0 |old(~q_req_up~0)|) (and .cse2 .cse3 (and .cse11 .cse12 .cse9 .cse13 .cse14 .cse7 .cse8 .cse10 .cse15) .cse6) (= 1 |old(~c_dr_pc~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)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse8 .cse10 .cse16 .cse0 .cse2 .cse4 .cse17 .cse6 .cse18) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse19 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse8 .cse10 .cse15 .cse16 .cse2 (= |old(~q_req_up~0)| ~q_req_up~0) .cse13 .cse14 .cse18 .cse20) (and .cse21 .cse2 .cse3 (and .cse16 .cse0 .cse4 .cse17 .cse8 .cse10)) (and .cse11 .cse12 .cse21 .cse2 .cse3 .cse13 .cse14 .cse22 .cse7 .cse8 .cse15) (and .cse12 .cse9 .cse3 .cse7 .cse8 .cse15 .cse11 .cse2 .cse4 .cse13 .cse14 .cse6) (and .cse21 .cse1 .cse23 .cse22 (not (= 0 ~q_write_ev~0)) .cse8 .cse10 .cse0 .cse2 .cse5) (< |old(~q_free~0)| 1) (and .cse0 .cse19 .cse9 .cse8) (and .cse2 .cse3 .cse6 (and .cse0 .cse9 .cse8 .cse10)) (and .cse16 .cse19 .cse9 .cse4 .cse13 .cse14 .cse8 .cse15 .cse20) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse6 .cse8) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-23 08:16:00,947 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 261 278) the Hoare annotation is: (let ((.cse21 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse12 (= 1 ~c_dr_pc~0)) (.cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse22 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse30 (+ ~c_num_read~0 1))) (let ((.cse16 (< ~p_num_write~0 .cse30)) (.cse0 (and .cse29 .cse22)) (.cse6 (not (= 2 ~c_dr_st~0))) (.cse18 (< .cse30 ~p_num_write~0)) (.cse25 (not (= ~p_dw_st~0 0))) (.cse5 (not .cse12)) (.cse2 (< ~p_num_write~0 ~c_num_read~0)) (.cse9 (< ~c_num_read~0 ~p_num_write~0)) (.cse1 (< |old(~q_write_ev~0)| 2)) (.cse14 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse29)) (.cse15 (= 0 ~c_dr_st~0)) (.cse13 (not (= ~q_free~0 0))) (.cse17 (= 1 ~q_req_up~0)) (.cse27 (not (= 1 ~p_num_write~0))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse20 (not (= |old(~q_read_ev~0)| 2))) (.cse28 (and .cse29 .cse21)) (.cse7 (not (= ~p_dw_st~0 2))) (.cse23 (not (= 0 ~p_num_write~0))) (.cse24 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse11 (< 0 ~q_req_up~0)) (.cse4 (< ~q_free~0 1)) (.cse19 (= ~p_dw_pc~0 1)) (.cse26 (not (= 0 ~c_num_read~0))) (.cse8 (< 1 ~q_free~0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (or .cse12 .cse3 .cse13 .cse14 .cse15) (or .cse16 .cse1 .cse3 .cse5 .cse13 .cse17 .cse14 .cse18 .cse19 .cse7) (or .cse16 .cse3 .cse13 .cse0 .cse6 .cse18 .cse20 (not .cse19) .cse7 .cse11) (or (and .cse21 .cse22) .cse3 .cse20 .cse23 .cse24 .cse11 .cse12 .cse4 .cse25 .cse19 .cse26 .cse8 .cse10) (or .cse1 .cse3 .cse13 .cse17 .cse14 .cse15 .cse20 .cse7) (or .cse3 .cse5 .cse7 .cse14 .cse1 .cse2 .cse4 .cse17 .cse15 .cse19 .cse8 .cse9 .cse10) (or .cse1 .cse3 .cse13 .cse17 .cse15 .cse20 .cse25 .cse19 .cse14) (or .cse1 .cse3 .cse13 .cse17 .cse15 .cse19 .cse7 .cse14) (or .cse3 .cse5 .cse14 .cse20 .cse7 .cse1 .cse2 .cse4 .cse17 .cse15 .cse8 .cse9 .cse10) (or .cse14 .cse1 .cse3 .cse13 .cse20 .cse27 .cse19 .cse7 .cse26 .cse11) (or .cse14 .cse12 .cse3 .cse4 .cse15 .cse19 .cse26 .cse8 .cse23 .cse10) (or .cse3 .cse20 .cse7 .cse24 .cse28 .cse13 .cse17 .cse27 .cse19 .cse26) (or .cse3 .cse20 .cse28 .cse7 .cse23 .cse24 .cse11 .cse12 .cse4 .cse19 .cse26 .cse8 .cse10)))) [2018-11-23 08:16:00,949 INFO L448 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2018-11-23 08:16:00,949 INFO L448 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2018-11-23 08:16:00,949 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2018-11-23 08:16:00,949 INFO L444 ceAbstractionStarter]: At program point update_channelsENTRY(lines 208 222) the Hoare annotation is: (let ((.cse24 (= 1 ~c_dr_pc~0)) (.cse33 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse32 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse17 (= ~p_dw_pc~0 1)) (.cse0 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse1 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse2 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse34 (+ ~c_num_read~0 1))) (let ((.cse18 (< ~p_num_write~0 .cse34)) (.cse23 (and .cse0 .cse1 .cse2)) (.cse19 (< .cse34 ~p_num_write~0)) (.cse21 (not .cse17)) (.cse28 (not (= 1 ~p_num_write~0))) (.cse27 (and .cse0 .cse1 .cse32)) (.cse22 (not (= ~q_free~0 0))) (.cse15 (= 1 |old(~q_req_up~0)|)) (.cse14 (and .cse33 .cse0 .cse1)) (.cse26 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse13 (< 0 |old(~q_req_up~0)|)) (.cse30 (not (= ~p_dw_st~0 0))) (.cse25 (and .cse33 .cse1)) (.cse16 (= 0 ~c_dr_st~0)) (.cse29 (not (= 0 ~c_num_read~0))) (.cse31 (not (= 0 ~p_num_write~0))) (.cse3 (< |old(~q_write_ev~0)| 2)) (.cse4 (< ~p_num_write~0 ~c_num_read~0)) (.cse5 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse6 (< ~q_free~0 1)) (.cse7 (not .cse24)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse20 (not (= |old(~q_read_ev~0)| 2))) (.cse9 (not (= ~p_dw_st~0 2))) (.cse10 (< 1 ~q_free~0)) (.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (and (and .cse0 .cse1) .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (or .cse5 .cse7 .cse9 .cse14 .cse3 .cse4 .cse6 .cse15 .cse16 .cse17 .cse10 .cse11 .cse12) (or .cse18 .cse5 .cse7 .cse19 .cse20 .cse21 .cse9 (= 0 |old(~q_write_ev~0)|) .cse13 .cse22 .cse23 .cse8) (or .cse24 .cse5 .cse22 .cse25 .cse16) (or .cse18 .cse3 .cse5 .cse7 .cse22 .cse15 .cse14 .cse19 .cse17 .cse9) (or .cse5 .cse20 .cse9 .cse26 .cse22 .cse15 .cse27 .cse28 .cse17 .cse29) (or .cse18 .cse5 .cse7 .cse23 .cse19 .cse20 .cse21 .cse9 .cse3 .cse22 .cse8) (or .cse14 .cse3 .cse5 .cse22 .cse20 .cse28 .cse17 .cse9 .cse29 .cse13) (or .cse5 .cse7 .cse14 .cse20 .cse9 .cse3 .cse4 .cse6 .cse15 .cse16 .cse10 .cse11 .cse12) (or .cse3 .cse5 .cse7 .cse22 .cse15 .cse16 .cse17 .cse9 .cse14) (or .cse3 .cse5 .cse7 .cse22 .cse15 .cse16 .cse20 .cse30 .cse17 .cse14) (or .cse5 .cse20 .cse27 .cse9 .cse31 .cse26 .cse13 .cse24 .cse6 .cse17 .cse29 .cse10 .cse12) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse17 .cse9 .cse10 .cse11 .cse12) (or .cse3 .cse5 .cse7 .cse22 .cse15 .cse14 .cse16 .cse20 .cse9) (or .cse5 (and .cse0 .cse32 .cse2) .cse20 .cse31 .cse26 .cse13 .cse24 .cse6 .cse30 .cse17 .cse29 .cse10 .cse12) (or .cse25 .cse24 .cse5 .cse6 .cse16 .cse17 .cse29 .cse10 .cse31 .cse12) (or (and (and .cse0 (= ~q_read_ev~0 |old(~q_read_ev~0)|)) .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12))))) [2018-11-23 08:16:00,949 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2018-11-23 08:16:00,950 INFO L444 ceAbstractionStarter]: At program point L214(line 214) the Hoare annotation is: (let ((.cse18 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_dw_pc~0 1)) (.cse29 (+ ~c_num_read~0 1)) (.cse9 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse21 (and .cse9 .cse11)) (.cse15 (not (= 0 ~p_num_write~0))) (.cse10 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse16 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse24 (not (= 1 ~p_num_write~0))) (.cse19 (not (= 0 ~c_num_read~0))) (.cse25 (< ~p_num_write~0 .cse29)) (.cse26 (< .cse29 ~p_num_write~0)) (.cse28 (not .cse6)) (.cse1 (< ~p_num_write~0 ~c_num_read~0)) (.cse3 (< ~q_free~0 1)) (.cse5 (not (= 2 ~c_dr_st~0))) (.cse7 (not (= ~p_dw_st~0 2))) (.cse8 (< 1 ~q_free~0)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (< 0 |old(~q_req_up~0)|)) (.cse0 (< |old(~q_write_ev~0)| 2)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not .cse18)) (.cse20 (not (= ~q_free~0 0))) (.cse23 (= 1 |old(~q_req_up~0)|)) (.cse22 (= 0 ~c_dr_st~0)) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse27 (not (= ~p_dw_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11) .cse12 .cse13) (or .cse2 .cse14 .cse7 .cse15 .cse16 .cse17 .cse18 .cse3 .cse6 .cse19 .cse8 .cse13) (or .cse18 .cse2 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse22 .cse6 .cse7 .cse8 .cse12 .cse13) (or .cse18 .cse2 .cse3 .cse22 .cse21 .cse6 .cse19 .cse8 .cse15 .cse13) (or .cse0 .cse2 .cse4 .cse20 .cse23 .cse22 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse22 .cse14 .cse7 .cse8 .cse12 .cse13) (or .cse0 .cse2 .cse20 .cse14 .cse24 .cse6 .cse7 .cse19 .cse17) (or (and (and .cse9 .cse10) (= ~q_read_ev~0 |old(~q_read_ev~0)|)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse7 .cse8 .cse12 .cse13)) (or .cse25 .cse0 .cse2 .cse4 .cse20 .cse23 .cse26 .cse6 .cse7) (or .cse2 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse27 .cse6 .cse19 .cse8 .cse13) (or .cse25 .cse2 .cse4 .cse26 .cse14 .cse28 .cse7 .cse0 .cse20 .cse5 (and (and (= 2 ~q_read_ev~0) .cse10) (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (or .cse2 .cse14 .cse7 .cse16 .cse20 .cse23 .cse24 .cse6 .cse19) (or .cse25 .cse2 .cse4 .cse20 .cse5 .cse26 .cse14 .cse28 .cse7 (= 0 |old(~q_write_ev~0)|) .cse17) (or .cse0 .cse2 .cse4 .cse20 .cse23 .cse22 .cse14 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse12 .cse13 .cse17) (or .cse0 .cse2 .cse4 .cse20 .cse23 .cse22 .cse14 .cse27 .cse6)))) [2018-11-23 08:16:00,951 INFO L448 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2018-11-23 08:16:00,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:16:00,951 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) (= ~q_read_ev~0 ~q_write_ev~0) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) [2018-11-23 08:16:00,951 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 08:16:00,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 08:16:00,951 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2018-11-23 08:16:00,951 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2018-11-23 08:16:00,951 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2018-11-23 08:16:00,952 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-23 08:16:00,952 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-23 08:16:00,953 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2018-11-23 08:16:00,953 INFO L444 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse9 (= 1 ~c_dr_pc~0)) (.cse25 (+ ~c_num_read~0 1))) (let ((.cse11 (not (= 0 ~p_num_write~0))) (.cse6 (not (= ~p_dw_st~0 0))) (.cse20 (not (= 2 ~c_dr_st~0))) (.cse18 (< ~p_num_write~0 ~c_num_read~0)) (.cse14 (< ~q_free~0 1)) (.cse16 (< 1 ~q_free~0)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (< 0 ~q_req_up~0)) (.cse22 (< ~p_num_write~0 .cse25)) (.cse19 (not .cse9)) (.cse23 (< .cse25 ~p_num_write~0)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse12 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse24 (not (= 1 ~p_num_write~0))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse0 (< ~q_write_ev~0 2)) (.cse3 (= 1 ~q_req_up~0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse10 (not (= ~p_dw_st~0 2))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse2 (not (= ~q_free~0 0))) (.cse4 (= 0 ~c_dr_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse1 .cse2 .cse4 .cse7 .cse8) (or .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse9 .cse14 .cse7 .cse8 .cse15 .cse16 .cse17) (or (= ~q_read_ev~0 1) .cse7 (or .cse0 .cse18 .cse1 .cse14 .cse19 .cse20 .cse10 .cse16 .cse21 .cse17 .cse13)) (or .cse9 .cse1 .cse14 .cse4 .cse8 .cse15 .cse16 .cse11 .cse7 .cse17) (or .cse1 .cse19 .cse10 .cse7 .cse0 .cse18 .cse14 .cse3 .cse4 .cse8 .cse16 .cse21 .cse17) (or .cse1 .cse5 .cse7 .cse11 .cse12 .cse13 .cse9 .cse14 .cse6 .cse8 .cse15 .cse16 .cse17) (or .cse9 .cse1 .cse2 .cse7 .cse4 .cse5) (or .cse22 .cse1 .cse23 .cse5 (not .cse8) .cse10 (= 0 ~q_write_ev~0) .cse13 .cse7 .cse2 .cse20) (or .cse1 .cse19 .cse5 .cse7 .cse10 .cse0 .cse18 .cse14 .cse3 .cse4 .cse16 .cse21 .cse17) (or .cse0 .cse1 .cse2 .cse5 .cse7 .cse24 .cse8 .cse10 .cse15 .cse13) (or .cse22 .cse0 .cse1 .cse19 .cse2 .cse3 .cse23 .cse8 .cse10 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (or .cse1 .cse5 .cse10 .cse12 .cse2 .cse3 .cse7 .cse24 .cse8 .cse15) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse8 .cse10) (or .cse9 .cse1 .cse7 .cse2 (not (= 0 ~q_read_ev~0)) .cse4)))) [2018-11-23 08:16:00,953 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2018-11-23 08:16:00,953 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2018-11-23 08:16:00,953 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2018-11-23 08:16:00,953 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2018-11-23 08:16:00,953 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2018-11-23 08:16:00,954 INFO L444 ceAbstractionStarter]: At program point L193(line 193) the Hoare annotation is: (let ((.cse13 (= 1 |old(~c_dr_pc~0)|)) (.cse21 (+ |old(~c_num_read~0)| 1)) (.cse15 (= ~p_dw_pc~0 1))) (let ((.cse1 (not .cse15)) (.cse2 (< ~p_num_write~0 .cse21)) (.cse6 (< .cse21 ~p_num_write~0)) (.cse5 (not .cse13)) (.cse10 (not (= 0 ~p_num_write~0))) (.cse14 (< |old(~q_free~0)| 1)) (.cse17 (< 1 |old(~q_free~0)|)) (.cse18 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse20 (= 1 |old(~q_req_up~0)|)) (.cse0 (< ~q_write_ev~0 2)) (.cse4 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse8 (not (= ~q_read_ev~0 2))) (.cse19 (not (= 1 ~p_num_write~0))) (.cse9 (not (= ~p_dw_st~0 2))) (.cse16 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1 (or .cse2 .cse3 (or .cse4 .cse5) .cse6 .cse7 .cse8 .cse9)) (or .cse4 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse7 (not (= ~p_dw_st~0 0)) .cse15 .cse16 .cse17 .cse18) (or (or .cse4 .cse3 .cse7 .cse8 .cse19 .cse9 .cse16) .cse1 .cse11) (or .cse0 (or .cse2 .cse3 .cse20 .cse6 .cse7 .cse9 (or .cse4 .cse5 .cse15))) (or .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse7 .cse15 .cse16 .cse17 .cse18) (or .cse4 .cse8 .cse9 .cse11 .cse3 .cse20 .cse7 .cse19 .cse16) (or .cse0 .cse4 .cse3 .cse7 .cse8 .cse19 .cse15 .cse9 .cse16 .cse12)))) [2018-11-23 08:16:00,955 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2018-11-23 08:16:00,955 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 155 207) the Hoare annotation is: (let ((.cse19 (not (= ~c_dr_pc~0 1))) (.cse20 (= ~c_num_read~0 0)) (.cse1 (= 1 |old(~c_dr_pc~0)|)) (.cse31 (+ |old(~c_num_read~0)| 1)) (.cse17 (not (= 0 ~c_dr_st~0))) (.cse30 (= ~q_free~0 0)) (.cse21 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse14 (= ~p_dw_pc~0 1))) (let ((.cse9 (not .cse14)) (.cse25 (let ((.cse32 (+ ~c_num_read~0 1))) (and (<= .cse32 ~p_num_write~0) .cse17 (= 1 ~c_dr_pc~0) .cse30 .cse21 (<= ~p_num_write~0 .cse32)))) (.cse26 (< ~p_num_write~0 .cse31)) (.cse29 (not .cse1)) (.cse28 (< .cse31 ~p_num_write~0)) (.cse24 (< ~q_write_ev~0 2)) (.cse0 (and .cse19 .cse17 .cse20 .cse30 .cse21)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse27 (= 1 |old(~q_req_up~0)|)) (.cse6 (not (= 1 ~p_num_write~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= ~q_read_ev~0 2))) (.cse18 (<= 1 ~q_free~0)) (.cse22 (<= ~q_free~0 1)) (.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (not (= ~p_dw_st~0 2))) (.cse11 (not (= 0 ~p_num_write~0))) (.cse10 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse12 (< 0 |old(~q_req_up~0)|)) (.cse13 (< |old(~q_free~0)| 1)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse15 (< 1 |old(~q_free~0)|)) (.cse16 (not (= |old(~c_last_read~0)| ~p_last_write~0)))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (or .cse2 .cse5 .cse11 .cse10 .cse12 .cse1 .cse13 .cse4 (not (= ~p_dw_st~0 0)) .cse14 .cse8 .cse15 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) (or .cse24 .cse25 (or .cse26 .cse3 .cse27 .cse28 .cse4 .cse7 (or .cse2 .cse29 .cse14))) (or .cse24 .cse9 .cse25 (or .cse26 .cse3 (or .cse2 (or .cse29 .cse5)) .cse28 .cse4 .cse7)) (or .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse14 .cse7 .cse8 .cse12) (or .cse2 .cse5 .cse7 .cse0 .cse10 .cse1 .cse3 .cse27 .cse4 .cse6 .cse8) (or .cse2 .cse5 (and .cse19 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) .cse7 .cse11 .cse10 .cse12 .cse1 .cse13 .cse4 .cse14 .cse8 .cse15 .cse16)))) [2018-11-23 08:16:00,955 INFO L448 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2018-11-23 08:16:00,955 INFO L444 ceAbstractionStarter]: At program point L202(lines 155 207) the Hoare annotation is: (let ((.cse6 (= 1 |old(~c_dr_pc~0)|)) (.cse30 (+ |old(~c_num_read~0)| 1)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= 2 ~c_dr_st~0)) (.cse10 (= 1 ~c_dr_pc~0)) (.cse11 (<= 1 ~q_free~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse22 (= 1 |old(~q_req_up~0)|)) (.cse23 (not (= 1 ~p_num_write~0))) (.cse20 (and .cse9 .cse10 (= ~c_num_read~0 1) .cse11 .cse14 .cse15)) (.cse12 (= ~c_num_read~0 0)) (.cse13 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse3 (not (= 0 ~p_num_write~0))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (< 0 |old(~q_req_up~0)|)) (.cse7 (< |old(~q_free~0)| 1)) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse18 (< 1 |old(~q_free~0)|)) (.cse19 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (.cse28 (and (<= ~p_num_write~0 ~c_num_read~0) .cse9 .cse10 .cse11 (<= ~c_num_read~0 ~p_num_write~0) .cse14 .cse15)) (.cse24 (< ~q_write_ev~0 2)) (.cse29 (not .cse16)) (.cse25 (< ~p_num_write~0 .cse30)) (.cse21 (not (= |old(~q_free~0)| 0))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse27 (not .cse6)) (.cse1 (not (= ~q_read_ev~0 2))) (.cse26 (< .cse30 ~p_num_write~0)) (.cse8 (= 0 |old(~c_dr_st~0)|)) (.cse2 (not (= ~p_dw_st~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse21 .cse22 .cse8 .cse23 .cse17) (or .cse24 (or .cse25 .cse21 .cse22 .cse26 .cse8 .cse2 (or .cse0 .cse27 .cse16)) .cse28) (or (or .cse0 .cse21 .cse8 .cse1 .cse23 .cse2 .cse17) .cse20 .cse29 .cse4) (or .cse24 .cse0 .cse21 .cse8 .cse1 .cse23 .cse16 .cse2 .cse17 .cse20 .cse5) (or (and .cse9 .cse11 .cse10 .cse12 .cse13 .cse14 .cse15) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~p_dw_st~0 0)) .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse24 .cse29 (or .cse25 .cse21 (or .cse0 (or .cse27 .cse1)) .cse26 .cse8 .cse2))))) [2018-11-23 08:16:00,957 INFO L444 ceAbstractionStarter]: At program point L198(line 198) the Hoare annotation is: (let ((.cse13 (= 1 |old(~c_dr_pc~0)|)) (.cse21 (+ |old(~c_num_read~0)| 1)) (.cse15 (= ~p_dw_pc~0 1))) (let ((.cse1 (not .cse15)) (.cse2 (< ~p_num_write~0 .cse21)) (.cse6 (< .cse21 ~p_num_write~0)) (.cse5 (not .cse13)) (.cse10 (not (= 0 ~p_num_write~0))) (.cse14 (< |old(~q_free~0)| 1)) (.cse17 (< 1 |old(~q_free~0)|)) (.cse18 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse20 (= 1 |old(~q_req_up~0)|)) (.cse0 (< ~q_write_ev~0 2)) (.cse4 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse8 (not (= ~q_read_ev~0 2))) (.cse19 (not (= 1 ~p_num_write~0))) (.cse9 (not (= ~p_dw_st~0 2))) (.cse16 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1 (or .cse2 .cse3 (or .cse4 .cse5) .cse6 .cse7 .cse8 .cse9)) (or .cse4 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse7 (not (= ~p_dw_st~0 0)) .cse15 .cse16 .cse17 .cse18) (or (or .cse4 .cse3 .cse7 .cse8 .cse19 .cse9 .cse16) .cse1 .cse11) (or .cse0 (or .cse2 .cse3 .cse20 .cse6 .cse7 .cse9 (or .cse4 .cse5 .cse15))) (or .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse7 .cse15 .cse16 .cse17 .cse18) (or .cse4 .cse8 .cse9 .cse11 .cse3 .cse20 .cse7 .cse19 .cse16) (or .cse0 .cse4 .cse3 .cse7 .cse8 .cse19 .cse15 .cse9 .cse16 .cse12)))) [2018-11-23 08:16:00,957 INFO L444 ceAbstractionStarter]: At program point L198-1(lines 158 206) the Hoare annotation is: (let ((.cse10 (= ~p_dw_pc~0 1)) (.cse29 (= ~c_num_read~0 0)) (.cse30 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse25 (not (= 0 ~c_dr_st~0))) (.cse26 (<= 1 ~q_free~0)) (.cse27 (<= ~q_free~0 1)) (.cse28 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= 1 |old(~c_dr_pc~0)|)) (.cse31 (+ |old(~c_num_read~0)| 1))) (let ((.cse5 (< ~q_write_ev~0 2)) (.cse14 (< ~p_num_write~0 .cse31)) (.cse16 (< .cse31 ~p_num_write~0)) (.cse15 (not .cse21)) (.cse12 (and (<= ~p_num_write~0 ~c_num_read~0) .cse25 .cse26 (<= ~c_num_read~0 ~p_num_write~0) .cse27 .cse28)) (.cse17 (= 1 |old(~q_req_up~0)|)) (.cse20 (not (= 0 ~p_num_write~0))) (.cse19 (and .cse25 .cse26 .cse29 .cse30 .cse27 .cse28)) (.cse4 (< 0 |old(~q_req_up~0)|)) (.cse22 (< |old(~q_free~0)| 1)) (.cse23 (< 1 |old(~q_free~0)|)) (.cse24 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (.cse8 (and .cse25 .cse29 (= ~q_free~0 0) .cse30)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse1 (not (= ~q_read_ev~0 2))) (.cse9 (not (= 1 ~p_num_write~0))) (.cse3 (not (= ~p_dw_st~0 2))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse13 (not .cse10)) (.cse18 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse2 (and .cse25 (= ~c_num_read~0 1) .cse26 .cse27 .cse28))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse5 .cse12 .cse13 (or .cse14 .cse6 (or .cse0 (or .cse15 .cse1)) .cse16 .cse7 .cse3)) (or .cse5 (or .cse14 .cse6 .cse17 .cse16 .cse7 .cse3 (or .cse0 .cse15 .cse10)) .cse12) (or .cse0 .cse1 .cse3 .cse18 .cse6 .cse17 .cse7 .cse9 .cse11 .cse2 .cse8) (or .cse0 .cse1 .cse3 .cse19 .cse20 .cse18 .cse4 .cse21 .cse22 .cse7 .cse10 .cse11 .cse23 .cse24) (or .cse0 .cse1 .cse20 .cse18 .cse19 .cse4 .cse21 .cse22 .cse7 (not (= ~p_dw_st~0 0)) .cse10 .cse11 .cse23 .cse24) (or .cse8 (or .cse0 .cse6 .cse7 .cse1 .cse9 .cse3 .cse11) .cse13 .cse18 .cse2)))) [2018-11-23 08:16:00,959 INFO L444 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse8 (= ~p_dw_pc~0 1)) (.cse5 (= 1 |old(~c_dr_pc~0)|)) (.cse22 (+ |old(~c_num_read~0)| 1))) (let ((.cse14 (= 1 |old(~q_req_up~0)|)) (.cse2 (not (= 0 ~p_num_write~0))) (.cse4 (< 0 |old(~q_req_up~0)|)) (.cse6 (< |old(~q_free~0)| 1)) (.cse10 (< 1 |old(~q_free~0)|)) (.cse11 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (.cse16 (< ~q_write_ev~0 2)) (.cse17 (let ((.cse23 (+ ~c_num_read~0 1))) (and (<= .cse23 ~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 .cse23)))) (.cse18 (< ~p_num_write~0 .cse22)) (.cse20 (not .cse5)) (.cse19 (< .cse22 ~p_num_write~0)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse13 (not (= |old(~q_free~0)| 0))) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse1 (not (= ~q_read_ev~0 2))) (.cse15 (not (= 1 ~p_num_write~0))) (.cse12 (not (= ~p_dw_st~0 2))) (.cse9 (not (= 0 |old(~c_num_read~0)|))) (.cse21 (not .cse8)) (.cse3 (not (= ~q_read_ev~0 ~q_write_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~p_dw_st~0 0)) .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse5 .cse13 .cse14 .cse7 .cse15 .cse9) (or .cse5 .cse16 .cse0 .cse13 .cse7 .cse1 .cse15 .cse8 .cse12 .cse9 .cse4) (or .cse16 .cse17 (or .cse18 .cse13 .cse14 .cse19 .cse7 .cse12 (or .cse0 .cse20 .cse8))) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse16 .cse21 .cse17 (or .cse18 .cse13 (or .cse0 (or .cse20 .cse1)) .cse19 .cse7 .cse12)) (or (or .cse5 .cse0 .cse13 .cse7 .cse1 .cse15 .cse12 .cse9) .cse21 .cse3)))) [2018-11-23 08:16:00,960 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2018-11-23 08:16:00,960 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2018-11-23 08:16:00,960 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 438 454) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= ~q_buf_0~0 ~p_last_write~0)) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~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 (= |old(~q_free~0)| 0)) (not (= ~p_dw_st~0 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (< 0 ~q_req_up~0)) [2018-11-23 08:16:01,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:16:01 BoogieIcfgContainer [2018-11-23 08:16:01,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:16:01,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:16:01,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:16:01,021 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:16:01,022 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:14:40" (3/4) ... [2018-11-23 08:16:01,025 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 08:16:01,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-23 08:16:01,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-23 08:16:01,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-11-23 08:16:01,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-23 08:16:01,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-23 08:16:01,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 08:16:01,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-23 08:16:01,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-23 08:16:01,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 08:16:01,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-23 08:16:01,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-23 08:16:01,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-23 08:16:01,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-23 08:16:01,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-23 08:16:01,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-23 08:16:01,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-23 08:16:01,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-23 08:16:01,033 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-23 08:16:01,039 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-23 08:16:01,039 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 08:16:01,064 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((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) || ((((((((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)) || (((((((q_free == 0 && !(0 == c_dr_st)) && !(p_dw_pc == 1)) && 2 <= q_write_ev) && !(q_req_up == 1)) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((2 <= q_write_ev && !(q_req_up == 1)) && ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free <= 1) && c_last_read == p_last_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && p_dw_pc == 1)) || 0 < \old(q_req_up)) || (((2 == p_dw_st && 2 <= q_write_ev) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && !(0 == c_dr_st)) && q_free <= 1) && c_last_read == p_last_write) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && !(q_req_up == 1))) || 1 == \old(c_dr_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((((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)) || !(\old(q_read_ev) == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 == p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && !(q_req_up == 1)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((((((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read == 0) && 2 == p_dw_st) && \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)) || (((q_req_up <= 0 && 2 == p_dw_st) && 2 <= q_write_ev) && ((((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)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 == p_dw_st) && 2 <= q_write_ev) && q_free <= 1) && c_last_read == p_last_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free)) || (((((((((((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))) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && p_dw_pc == 1) && 2 == c_dr_st) && !(0 == q_write_ev)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || \old(q_free) < 1) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((2 == p_dw_st && 2 <= q_write_ev) && !(q_req_up == 1)) && ((q_free == 0 && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev)) || ((((((((c_num_read == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && p_last_write == q_buf_0) && 1 <= q_free) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || ((((((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)) || !(\old(p_dw_st) == 0) [2018-11-23 08:16:01,064 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) && (((((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || (((((((!(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)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || 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))) && ((((((((((((((((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) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || (((((((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_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || ((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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)) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || (((((((((((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)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \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)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || (((((((((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_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((!(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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \old(q_free) < 1) || !(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)))) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || 2 == c_dr_st) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\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) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) || (((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 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))) || !(1 == \old(c_dr_pc))) || \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)) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(p_dw_pc) == 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)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \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)))) && (((((((((((((((!(\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) && 1 <= q_free) && c_num_read == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || ((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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(c_last_read) == \old(p_last_write)))) && ((((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 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) || ((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\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(p_dw_pc) == 1)) || ((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) && p_dw_pc == 1))) && ((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(\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))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || 2 == 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 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && c_last_read == p_last_write) && p_dw_pc == 1) || !(\old(p_dw_pc) == 1)) || (((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(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_st) == 2)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 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) && p_dw_pc == 1))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || 2 == c_dr_st) || \old(q_free) < 1) || !(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)))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(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)) && 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)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || p_dw_st == 0) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\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))) || !(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)) || ((((((((((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)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 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)) && p_dw_pc == 1) && 2 == 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) && 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)))) && (((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && (((((((((((((((((((p_dw_pc == 1 && (((((2 == c_dr_st && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && 1 == p_num_write) || (((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((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)) || !(q_read_ev == 2)) || ((((((((((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)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 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)) || (p_dw_pc == 1 && ((((((((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) && !(0 == tmp___1)) && 1 == p_num_write) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 0)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || \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))) || !(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 == \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)) [2018-11-23 08:16:01,065 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) && (((((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((((((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) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || (((((((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))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || (((((((((((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)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \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)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || (((((((((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_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((!(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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \old(q_free) < 1) || !(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)))) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || 2 == c_dr_st) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == 1) && 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) || !(\old(p_dw_pc) == 1)) || (((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(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_st) == 2)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\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)) || !(\old(q_free) == 0)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == 1) && 2 == 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) && p_num_write <= c_num_read + 1)) || !(2 == \old(c_dr_st)))) && ((((((((((((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) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) || (((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 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))) || !(1 == \old(c_dr_pc))) || \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)) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(p_dw_pc) == 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)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \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)))) && ((((((((((((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((!(\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) && 1 <= q_free) && c_num_read == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || ((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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(c_last_read) == \old(p_last_write)))) && (((((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\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(p_dw_pc) == 1)) || (((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_pc == 1))) && ((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(\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))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st)) && (((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((p_dw_pc == 1 && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((p_dw_pc == 1 && 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))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || 2 == c_dr_st) || \old(q_free) < 1) || !(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)))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(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)) && 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)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || p_dw_st == 0) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\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))) || !(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)) || ((((((((((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)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((((((!(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)) || 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_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(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 == \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)) [2018-11-23 08:16:01,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || ((((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)) || 0 == c_dr_st) || (((((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)) && ((((((((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_write) || !(0 == \old(p_num_write))) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((((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))) && (((((((((((((!(\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) || ((((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)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(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)) || 1 == c_dr_pc) || 1 == p_num_write) || \old(q_free) < 1) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || c_last_read == p_last_write) || !(c_last_read == \old(p_last_write)))) && (((q_write_ev < 2 || (((((p_dw_pc == 1 && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && !(0 == 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 || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(\old(p_dw_pc) == 1))) && (((((0 == c_dr_st || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && 0 == p_num_write)) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || (((q_free == 0 && p_dw_pc == \old(p_dw_pc)) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write)))) && (((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || (((((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)) || \old(p_dw_pc) == 1) [2018-11-23 08:16:01,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((q_free == 0 && 1 == p_num_write) && p_last_write == q_buf_0) || 0 == c_dr_st) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || ((q_free == 0 && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0))) && (((q_write_ev < 2 || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || (((((p_dw_pc == 1 && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || !(\old(p_dw_pc) == 1))) && (((((((((((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) || !(0 == \old(p_num_write))) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((q_free == 0 && 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)) || !(1 == \old(p_dw_pc)))) && (((((((((\old(p_dw_st) == 0 || ((((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)) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(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)) && ((((((((((((!(\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) || ((((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) [2018-11-23 08:16:01,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((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)) && (((q_write_ev < 2 || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(\old(p_dw_pc) == 1)) || ((((p_num_write == \old(p_num_write) && 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 == \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || ((((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)) || !(0 == c_num_read))) && ((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || 0 == c_dr_st) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(p_num_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((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)) || !(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)))) && (((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1) [2018-11-23 08:16:01,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) && (((q_write_ev < 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)) || !(p_dw_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || (((((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))) && ((((((((((!(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)) || !(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)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up))) && (((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 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_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && (((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || (((((!(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 < \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))) && (((((((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up) || (((((!(q_buf_0 == p_last_write) || !(\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)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) [2018-11-23 08:16:01,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 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)) || ((((((2 == c_dr_st && 1 == c_dr_pc) && 1 <= q_free) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) && (((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || (((((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_read_ev == q_write_ev)) || !(\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_num_write < \old(c_num_read) + 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || ((((((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) || !(\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))) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev))) && ((((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(\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))) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 0 < \old(q_req_up))) && (((((((((((((((((((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_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))) && (((((((((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_write_ev < 2) || !(p_dw_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) [2018-11-23 08:16:01,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(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_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)))) && ((((((((((1 == \old(c_dr_pc) || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(\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))) && ((q_write_ev < 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)) || (((((p_num_write < \old(c_num_read) + 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1)) && ((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 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_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && (((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 || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && (((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(\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)) [2018-11-23 08:16:01,112 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2e283da9-44e7-44d7-9df6-5024fb68cc02/bin-2019/uautomizer/witness.graphml [2018-11-23 08:16:01,112 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:16:01,113 INFO L168 Benchmark]: Toolchain (without parser) took 81363.94 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 959.2 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-23 08:16:01,113 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:16:01,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:16:01,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.21 ms. Allocated memory is still 1.0 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:16:01,114 INFO L168 Benchmark]: Boogie Preprocessor took 54.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:16:01,114 INFO L168 Benchmark]: RCFGBuilder took 341.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:16:01,114 INFO L168 Benchmark]: TraceAbstraction took 80658.45 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-23 08:16:01,114 INFO L168 Benchmark]: Witness Printer took 91.05 ms. Allocated memory is still 4.3 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 67.8 MB). Peak memory consumption was 67.8 MB. Max. memory is 11.5 GB. [2018-11-23 08:16:01,116 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.21 ms. Allocated memory is still 1.0 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 341.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 80658.45 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 91.05 ms. Allocated memory is still 4.3 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 67.8 MB). Peak memory consumption was 67.8 MB. 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: (((((((((((((((((!(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_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)))) && ((((((((((1 == \old(c_dr_pc) || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(\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))) && ((q_write_ev < 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)) || (((((p_num_write < \old(c_num_read) + 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1)) && ((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 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_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && (((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 || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && (((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(\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)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((((((((q_free == 0 && 1 == p_num_write) && p_last_write == q_buf_0) || 0 == c_dr_st) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || ((q_free == 0 && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0))) && (((q_write_ev < 2 || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || (((((p_dw_pc == 1 && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || !(\old(p_dw_pc) == 1))) && (((((((((((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) || !(0 == \old(p_num_write))) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((q_free == 0 && 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)) || !(1 == \old(p_dw_pc)))) && (((((((((\old(p_dw_st) == 0 || ((((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)) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(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)) && ((((((((((((!(\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) || ((((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(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))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) && (((((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || (((((((!(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)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || 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))) && ((((((((((((((((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) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || (((((((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_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || ((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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)) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || (((((((((((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)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \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)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || (((((((((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_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((!(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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \old(q_free) < 1) || !(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)))) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || 2 == c_dr_st) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\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) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) || (((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 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))) || !(1 == \old(c_dr_pc))) || \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)) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(p_dw_pc) == 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)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \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)))) && (((((((((((((((!(\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) && 1 <= q_free) && c_num_read == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || ((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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(c_last_read) == \old(p_last_write)))) && ((((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 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) || ((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\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(p_dw_pc) == 1)) || ((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) && p_dw_pc == 1))) && ((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(\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))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || 2 == 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 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && c_last_read == p_last_write) && p_dw_pc == 1) || !(\old(p_dw_pc) == 1)) || (((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(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_st) == 2)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 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) && p_dw_pc == 1))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || 2 == c_dr_st) || \old(q_free) < 1) || !(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)))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(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)) && 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)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || p_dw_st == 0) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\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))) || !(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)) || ((((((((((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)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 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)) && p_dw_pc == 1) && 2 == 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) && 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)))) && (((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && (((((((((((((((((((p_dw_pc == 1 && (((((2 == c_dr_st && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && 1 == p_num_write) || (((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((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)) || !(q_read_ev == 2)) || ((((((((((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)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 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)) || (p_dw_pc == 1 && ((((((((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) && !(0 == tmp___1)) && 1 == p_num_write) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 0)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || \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))) || !(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 == \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)) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || 0 == __retres1) || p_dw_pc == 1) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 0 == c_dr_st) || 0 == __retres1) || p_dw_pc == 1)) && ((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 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_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && ((q_read_ev == 1 || 0 == __retres1) || (((((((((q_write_ev < 2 || p_num_write < c_num_read) || !(q_buf_0 == p_last_write)) || q_free < 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) || 0 == c_dr_st) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(0 == p_num_write)) || 0 == __retres1) || !(c_last_read == p_last_write))) && ((((((((((((!(q_buf_0 == p_last_write) || !(1 == c_dr_pc)) || !(p_dw_st == 2)) || 0 == __retres1) || q_write_ev < 2) || p_num_write < c_num_read) || 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_buf_0 == p_last_write) || !(q_read_ev == 2)) || 0 == __retres1) || !(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))) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 0 == __retres1) || 0 == c_dr_st) || !(q_read_ev == 2))) && ((((((((((p_num_write < c_num_read + 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) || 0 == __retres1) || !(q_free == 0)) || !(2 == c_dr_st))) && ((((((((((((!(q_buf_0 == p_last_write) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 0 == __retres1) || !(p_dw_st == 2)) || q_write_ev < 2) || p_num_write < c_num_read) || q_free < 1) || 1 == q_req_up) || 0 == c_dr_st) || 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)) || !(q_free == 0)) || !(q_read_ev == 2)) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == c_num_read)) || 0 < q_req_up)) && (((((((((p_num_write < c_num_read + 1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(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)) || 0 == __retres1)) && (((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 == __retres1)) && (((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || 1 == q_req_up) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == c_num_read))) && (((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || 0 == __retres1) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || p_dw_pc == 1) || !(p_dw_st == 2))) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || 0 == __retres1) || !(q_free == 0)) || !(0 == q_read_ev)) || 0 == c_dr_st) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 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)) || ((((((2 == c_dr_st && 1 == c_dr_pc) && 1 <= q_free) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) && (((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || (((((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_read_ev == q_write_ev)) || !(\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_num_write < \old(c_num_read) + 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || ((((((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) || !(\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))) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev))) && ((((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(\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))) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 0 < \old(q_req_up))) && (((((((((((((((((((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_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))) && (((((((((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_write_ev < 2) || !(p_dw_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \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: (((((((((((((((((((((((((((((((((((((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) || ((((((((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)) || (((((((q_free == 0 && !(0 == c_dr_st)) && !(p_dw_pc == 1)) && 2 <= q_write_ev) && !(q_req_up == 1)) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((2 <= q_write_ev && !(q_req_up == 1)) && ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free <= 1) && c_last_read == p_last_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && p_dw_pc == 1)) || 0 < \old(q_req_up)) || (((2 == p_dw_st && 2 <= q_write_ev) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && !(0 == c_dr_st)) && q_free <= 1) && c_last_read == p_last_write) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && !(q_req_up == 1))) || 1 == \old(c_dr_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((((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)) || !(\old(q_read_ev) == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 == p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && !(q_req_up == 1)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((((((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read == 0) && 2 == p_dw_st) && \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)) || (((q_req_up <= 0 && 2 == p_dw_st) && 2 <= q_write_ev) && ((((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)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 == p_dw_st) && 2 <= q_write_ev) && q_free <= 1) && c_last_read == p_last_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free)) || (((((((((((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))) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && p_dw_pc == 1) && 2 == c_dr_st) && !(0 == q_write_ev)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || \old(q_free) < 1) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((2 == p_dw_st && 2 <= q_write_ev) && !(q_req_up == 1)) && ((q_free == 0 && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev)) || ((((((((c_num_read == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && p_last_write == q_buf_0) && 1 <= q_free) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || ((((((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)) || !(\old(p_dw_st) == 0) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((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)) && (((q_write_ev < 2 || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(\old(p_dw_pc) == 1)) || ((((p_num_write == \old(p_num_write) && 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 == \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || ((((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)) || !(0 == c_num_read))) && ((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || 0 == c_dr_st) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(p_num_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((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)) || !(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)))) && (((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1) - 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))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) && (((((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((((((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) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || (((((((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))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || (((((((((((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)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \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)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || (((((((((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_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((!(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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \old(q_free) < 1) || !(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)))) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || 2 == c_dr_st) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == 1) && 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) || !(\old(p_dw_pc) == 1)) || (((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(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_st) == 2)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\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)) || !(\old(q_free) == 0)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == 1) && 2 == 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) && p_num_write <= c_num_read + 1)) || !(2 == \old(c_dr_st)))) && ((((((((((((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) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) || (((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 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))) || !(1 == \old(c_dr_pc))) || \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)) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(p_dw_pc) == 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)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || \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)))) && ((((((((((((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((!(\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) && 1 <= q_free) && c_num_read == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || ((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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(c_last_read) == \old(p_last_write)))) && (((((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\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(p_dw_pc) == 1)) || (((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_pc == 1))) && ((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(\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))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st)) && (((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((p_dw_pc == 1 && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((p_dw_pc == 1 && 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))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || q_write_ev < 2) || \old(p_num_write) < \old(c_num_read)) || 2 == c_dr_st) || \old(q_free) < 1) || !(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)))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(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)) && 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)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || p_dw_st == 0) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\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))) || !(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)) || ((((((((((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)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((((((!(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)) || 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_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(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 == \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)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || ((((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)) || 0 == c_dr_st) || (((((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)) && ((((((((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_write) || !(0 == \old(p_num_write))) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((((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))) && (((((((((((((!(\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) || ((((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)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(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)) || 1 == c_dr_pc) || 1 == p_num_write) || \old(q_free) < 1) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || c_last_read == p_last_write) || !(c_last_read == \old(p_last_write)))) && (((q_write_ev < 2 || (((((p_dw_pc == 1 && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && !(0 == 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 || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(\old(p_dw_pc) == 1))) && (((((0 == c_dr_st || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && 0 == p_num_write)) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || (((q_free == 0 && p_dw_pc == \old(p_dw_pc)) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write)))) && (((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || (((((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)) || \old(p_dw_pc) == 1) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == c_dr_st) || !(q_buf_0 == p_last_write)) || __retres1 == 1) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || !(q_free == 0)) || !(1 == p_num_write)) || !(0 == c_num_read)) && ((__retres1 == 1 || ((((((((((q_write_ev < 2 || p_num_write < c_num_read) || !(q_buf_0 == p_last_write)) || q_free < 1) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || 1 == q_req_up) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) || !(p_dw_pc == 1))) && ((((((((((((!(q_buf_0 == p_last_write) || !(1 == c_dr_pc)) || !(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)) || 1 == __retres1) || !(p_dw_st == 0)) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && ((((((((((((!(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) || 1 == __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)) || !(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)) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 0 == c_dr_st) || !(p_dw_st == 0)) || 1 == __retres1)) && (((__retres1 == 1 || !(p_dw_pc == 1)) || (q_req_up <= 0 && !(0 == c_dr_st))) || (((((((p_num_write < c_num_read + 1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(q_free == 0)) || 1 == q_req_up) || c_num_read + 1 < p_num_write) || !(q_read_ev == 2)) || !(p_dw_st == 2))) && ((((((((((1 == __retres1 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || q_free < 1) || 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)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) && (((q_write_ev < 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)) || !(p_dw_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || (((((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))) && ((((((((((!(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)) || !(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)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up))) && (((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 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_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && (((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || (((((!(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 < \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))) && (((((((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up) || (((((!(q_buf_0 == p_last_write) || !(\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)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(q_buf_0 == p_last_write) || 0 == __retres1) || !(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)) && ((((!(q_buf_0 == p_last_write) || 0 == __retres1) || !(q_free == 0)) || 0 == c_dr_st) || 1 == c_dr_pc)) && ((((((((((((!(q_buf_0 == p_last_write) || !(p_dw_st == 2)) || q_write_ev < 2) || p_num_write < c_num_read) || q_free < 1) || 1 == q_req_up) || 0 == __retres1) || 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)) || 0 == __retres1) || !(q_free == 0)) || !(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_buf_0 == p_last_write) || q_free < 1) || 0 == c_dr_st) || 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))) && (((((((((((p_num_write < c_num_read + 1 || !(q_buf_0 == p_last_write)) || c_num_read + 1 < p_num_write) || !(p_dw_st == 2)) || 0 == q_write_ev) || 0 == __retres1) || !(1 == p_dw_pc)) || 0 < q_req_up) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 1 == q_write_ev)) && (((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || 1 == q_req_up) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == c_num_read))) && (((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 1 == q_req_up) || 0 == __retres1) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 2))) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 0 == __retres1) || 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)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || p_dw_pc == 1) || !(p_dw_st == 2)) || 0 == __retres1)) && (((((((((((((!(q_buf_0 == p_last_write) || 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)) || !(q_read_ev == 1)) || !(p_dw_pc == 1)) || 0 == __retres1)) && (0 == __retres1 || (q_write_ev < 2 || (((((((p_num_write < c_num_read || !(q_buf_0 == p_last_write)) || q_free < 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)) && (((((((((((!(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) || !(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))) && (((((((((p_num_write < c_num_read + 1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 1 == q_req_up) || c_num_read + 1 < p_num_write) || !(1 == c_dr_pc)) || p_dw_pc == 1) || !(p_dw_st == 2)) || 0 == __retres1)) && ((((((((((((!(q_buf_0 == p_last_write) || 0 == __retres1) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < q_req_up) || 1 == c_dr_pc) || q_free < 1) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && ((((q_write_ev < 2 || (((((((p_num_write < c_num_read || !(q_buf_0 == p_last_write)) || q_free < 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)) || 1 == q_req_up) || !(q_read_ev == 1)) || 0 == __retres1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 130 locations, 1 error locations. SAFE Result, 80.5s OverallTime, 20 OverallIterations, 8 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 55.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 4076 SDtfs, 7808 SDslu, 5796 SDs, 0 SdLazy, 9656 SolverSat, 2811 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2001 GetRequests, 1815 SyntacticMatches, 16 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25958occurred in iteration=16, 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: 7.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 11110 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 48470 PreInvPairs, 56362 NumberOfFragments, 25902 HoareAnnotationTreeSize, 48470 FomulaSimplifications, 389132 FormulaSimplificationTreeSizeReduction, 8.2s HoareSimplificationTime, 56 FomulaSimplificationsInter, 400293 FormulaSimplificationTreeSizeReductionInter, 46.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 4422 NumberOfCodeBlocks, 4422 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4394 ConstructedInterpolants, 0 QuantifiedInterpolants, 1242698 SizeOfPredicates, 13 NumberOfNonLiveVariables, 8190 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 28 InterpolantComputations, 17 PerfectInterpolantSequences, 3073/3175 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...