./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/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 aa63abe8d244d72d8b78f82e911235dbe511cfc8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:21:58,525 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:21:58,526 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:21:58,535 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:21:58,535 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:21:58,536 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:21:58,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:21:58,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:21:58,539 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:21:58,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:21:58,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:21:58,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:21:58,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:21:58,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:21:58,542 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:21:58,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:21:58,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:21:58,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:21:58,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:21:58,546 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:21:58,547 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:21:58,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:21:58,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:21:58,549 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:21:58,549 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:21:58,549 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:21:58,550 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:21:58,550 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:21:58,551 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:21:58,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:21:58,551 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:21:58,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:21:58,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:21:58,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:21:58,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:21:58,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:21:58,553 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 14:21:58,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:21:58,560 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:21:58,561 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:21:58,561 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:21:58,561 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:21:58,561 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:21:58,561 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 14:21:58,561 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:21:58,561 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:21:58,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:21:58,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:21:58,562 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:21:58,562 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:21:58,562 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:21:58,562 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:21:58,562 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:21:58,562 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:21:58,562 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:21:58,562 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:21:58,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:21:58,563 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:21:58,563 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:21:58,563 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:21:58,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:21:58,563 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:21:58,563 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:21:58,563 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:21:58,563 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 14:21:58,563 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:21:58,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:21:58,563 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_42845bf4-524e-4ffb-bc24-a00037901dfd/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 -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2018-12-02 14:21:58,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:21:58,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:21:58,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:21:58,592 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:21:58,592 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:21:58,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-12-02 14:21:58,631 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/data/b4a30b1b1/3b86b8b8d5314d06b4b1360f9af99c4d/FLAG39083a082 [2018-12-02 14:21:59,041 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:21:59,041 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-12-02 14:21:59,045 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/data/b4a30b1b1/3b86b8b8d5314d06b4b1360f9af99c4d/FLAG39083a082 [2018-12-02 14:21:59,053 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/data/b4a30b1b1/3b86b8b8d5314d06b4b1360f9af99c4d [2018-12-02 14:21:59,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:21:59,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:21:59,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:21:59,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:21:59,058 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:21:59,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22096c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59, skipping insertion in model container [2018-12-02 14:21:59,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:21:59,077 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:21:59,171 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:21:59,174 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:21:59,192 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:21:59,200 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:21:59,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59 WrapperNode [2018-12-02 14:21:59,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:21:59,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:21:59,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:21:59,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:21:59,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:21:59,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:21:59,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:21:59,215 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:21:59,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (1/1) ... [2018-12-02 14:21:59,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:21:59,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:21:59,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:21:59,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:21:59,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:21:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-02 14:21:59,294 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-02 14:21:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-02 14:21:59,294 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-02 14:21:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:21:59,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:21:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-12-02 14:21:59,294 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-12-02 14:21:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-02 14:21:59,294 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-02 14:21:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2018-12-02 14:21:59,294 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2018-12-02 14:21:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:21:59,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:21:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-02 14:21:59,295 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-02 14:21:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-02 14:21:59,295 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-02 14:21:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-12-02 14:21:59,295 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-12-02 14:21:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-02 14:21:59,295 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-02 14:21:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:21:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:21:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-12-02 14:21:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-12-02 14:21:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-12-02 14:21:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-12-02 14:21:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-02 14:21:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-02 14:21:59,487 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:21:59,487 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 14:21:59,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:21:59 BoogieIcfgContainer [2018-12-02 14:21:59,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:21:59,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:21:59,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:21:59,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:21:59,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:21:59" (1/3) ... [2018-12-02 14:21:59,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4850c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:21:59, skipping insertion in model container [2018-12-02 14:21:59,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:59" (2/3) ... [2018-12-02 14:21:59,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4850c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:21:59, skipping insertion in model container [2018-12-02 14:21:59,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:21:59" (3/3) ... [2018-12-02 14:21:59,492 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-12-02 14:21:59,498 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:21:59,504 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 14:21:59,514 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 14:21:59,533 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 14:21:59,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:21:59,533 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:21:59,534 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:21:59,534 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:21:59,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:21:59,534 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:21:59,534 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:21:59,534 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:21:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-12-02 14:21:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 14:21:59,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:21:59,552 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] [2018-12-02 14:21:59,554 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:21:59,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash 489843548, now seen corresponding path program 1 times [2018-12-02 14:21:59,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:21:59,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:21:59,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:59,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:21:59,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:21:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:21:59,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:21:59,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:21:59,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:21:59,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:21:59,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:21:59,720 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2018-12-02 14:21:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:21:59,767 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2018-12-02 14:21:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:21:59,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-02 14:21:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:21:59,776 INFO L225 Difference]: With dead ends: 279 [2018-12-02 14:21:59,776 INFO L226 Difference]: Without dead ends: 175 [2018-12-02 14:21:59,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:21:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-02 14:21:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-12-02 14:21:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-02 14:21:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-12-02 14:21:59,815 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2018-12-02 14:21:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:21:59,816 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-12-02 14:21:59,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:21:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-12-02 14:21:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:21:59,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:21:59,818 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] [2018-12-02 14:21:59,818 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:21:59,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash 343031424, now seen corresponding path program 1 times [2018-12-02 14:21:59,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:21:59,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:21:59,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:59,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:21:59,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:21:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:21:59,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:21:59,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:21:59,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:21:59,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:21:59,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:21:59,897 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 4 states. [2018-12-02 14:21:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:21:59,997 INFO L93 Difference]: Finished difference Result 469 states and 653 transitions. [2018-12-02 14:21:59,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:21:59,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 14:21:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:21:59,999 INFO L225 Difference]: With dead ends: 469 [2018-12-02 14:21:59,999 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 14:22:00,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-02 14:22:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 14:22:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2018-12-02 14:22:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-12-02 14:22:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 411 transitions. [2018-12-02 14:22:00,020 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 411 transitions. Word has length 66 [2018-12-02 14:22:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:00,021 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 411 transitions. [2018-12-02 14:22:00,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:22:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 411 transitions. [2018-12-02 14:22:00,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:22:00,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:00,023 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] [2018-12-02 14:22:00,023 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:00,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:00,023 INFO L82 PathProgramCache]: Analyzing trace with hash 229644767, now seen corresponding path program 1 times [2018-12-02 14:22:00,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:00,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:00,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:00,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:00,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:00,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:22:00,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:22:00,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:22:00,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:22:00,067 INFO L87 Difference]: Start difference. First operand 314 states and 411 transitions. Second operand 6 states. [2018-12-02 14:22:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:00,104 INFO L93 Difference]: Finished difference Result 575 states and 767 transitions. [2018-12-02 14:22:00,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:22:00,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 14:22:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:00,106 INFO L225 Difference]: With dead ends: 575 [2018-12-02 14:22:00,106 INFO L226 Difference]: Without dead ends: 324 [2018-12-02 14:22:00,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:22:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-02 14:22:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-12-02 14:22:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-02 14:22:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 417 transitions. [2018-12-02 14:22:00,123 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 417 transitions. Word has length 66 [2018-12-02 14:22:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:00,123 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 417 transitions. [2018-12-02 14:22:00,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:22:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 417 transitions. [2018-12-02 14:22:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:22:00,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:00,125 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] [2018-12-02 14:22:00,125 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:00,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:00,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1490517977, now seen corresponding path program 1 times [2018-12-02 14:22:00,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:00,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:00,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:00,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:00,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:00,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:22:00,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:22:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:22:00,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:22:00,156 INFO L87 Difference]: Start difference. First operand 324 states and 417 transitions. Second operand 4 states. [2018-12-02 14:22:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:00,211 INFO L93 Difference]: Finished difference Result 585 states and 748 transitions. [2018-12-02 14:22:00,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:22:00,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 14:22:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:00,213 INFO L225 Difference]: With dead ends: 585 [2018-12-02 14:22:00,213 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 14:22:00,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:22:00,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 14:22:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-02 14:22:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-02 14:22:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 349 transitions. [2018-12-02 14:22:00,229 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 349 transitions. Word has length 66 [2018-12-02 14:22:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:00,230 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 349 transitions. [2018-12-02 14:22:00,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:22:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 349 transitions. [2018-12-02 14:22:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:22:00,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:00,231 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] [2018-12-02 14:22:00,232 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:00,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:00,232 INFO L82 PathProgramCache]: Analyzing trace with hash -791423587, now seen corresponding path program 1 times [2018-12-02 14:22:00,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:00,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:00,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:00,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:00,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:00,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:22:00,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:22:00,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:22:00,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:22:00,311 INFO L87 Difference]: Start difference. First operand 278 states and 349 transitions. Second operand 6 states. [2018-12-02 14:22:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:00,616 INFO L93 Difference]: Finished difference Result 850 states and 1130 transitions. [2018-12-02 14:22:00,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:22:00,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 14:22:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:00,618 INFO L225 Difference]: With dead ends: 850 [2018-12-02 14:22:00,618 INFO L226 Difference]: Without dead ends: 589 [2018-12-02 14:22:00,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:22:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-12-02 14:22:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 577. [2018-12-02 14:22:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-12-02 14:22:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2018-12-02 14:22:00,641 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 66 [2018-12-02 14:22:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:00,641 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2018-12-02 14:22:00,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:22:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2018-12-02 14:22:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:22:00,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:00,642 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] [2018-12-02 14:22:00,643 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:00,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2070748322, now seen corresponding path program 1 times [2018-12-02 14:22:00,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:00,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:00,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:00,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:00,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:00,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:22:00,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:22:00,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:22:00,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:22:00,682 INFO L87 Difference]: Start difference. First operand 577 states and 713 transitions. Second operand 6 states. [2018-12-02 14:22:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:00,738 INFO L93 Difference]: Finished difference Result 1140 states and 1459 transitions. [2018-12-02 14:22:00,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:22:00,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 14:22:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:00,741 INFO L225 Difference]: With dead ends: 1140 [2018-12-02 14:22:00,742 INFO L226 Difference]: Without dead ends: 616 [2018-12-02 14:22:00,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:22:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-12-02 14:22:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2018-12-02 14:22:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-12-02 14:22:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 735 transitions. [2018-12-02 14:22:00,778 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 735 transitions. Word has length 66 [2018-12-02 14:22:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:00,778 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 735 transitions. [2018-12-02 14:22:00,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:22:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 735 transitions. [2018-12-02 14:22:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:22:00,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:00,780 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] [2018-12-02 14:22:00,780 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:00,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash -295740960, now seen corresponding path program 1 times [2018-12-02 14:22:00,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:00,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:00,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:00,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:00,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:00,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:22:00,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:22:00,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:22:00,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:22:00,848 INFO L87 Difference]: Start difference. First operand 604 states and 735 transitions. Second operand 4 states. [2018-12-02 14:22:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:00,941 INFO L93 Difference]: Finished difference Result 842 states and 1059 transitions. [2018-12-02 14:22:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:22:00,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 14:22:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:00,944 INFO L225 Difference]: With dead ends: 842 [2018-12-02 14:22:00,945 INFO L226 Difference]: Without dead ends: 839 [2018-12-02 14:22:00,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:22:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-02 14:22:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 675. [2018-12-02 14:22:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-12-02 14:22:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 829 transitions. [2018-12-02 14:22:00,986 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 829 transitions. Word has length 66 [2018-12-02 14:22:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:00,986 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 829 transitions. [2018-12-02 14:22:00,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:22:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 829 transitions. [2018-12-02 14:22:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 14:22:00,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:00,988 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] [2018-12-02 14:22:00,988 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:00,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:00,988 INFO L82 PathProgramCache]: Analyzing trace with hash -578339491, now seen corresponding path program 1 times [2018-12-02 14:22:00,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:00,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:00,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:00,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:00,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:01,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:01,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:22:01,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:22:01,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:22:01,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:22:01,027 INFO L87 Difference]: Start difference. First operand 675 states and 829 transitions. Second operand 3 states. [2018-12-02 14:22:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:01,067 INFO L93 Difference]: Finished difference Result 1249 states and 1576 transitions. [2018-12-02 14:22:01,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:22:01,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 14:22:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:01,069 INFO L225 Difference]: With dead ends: 1249 [2018-12-02 14:22:01,069 INFO L226 Difference]: Without dead ends: 655 [2018-12-02 14:22:01,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:22:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-12-02 14:22:01,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 567. [2018-12-02 14:22:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-12-02 14:22:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 677 transitions. [2018-12-02 14:22:01,090 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 677 transitions. Word has length 67 [2018-12-02 14:22:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:01,090 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 677 transitions. [2018-12-02 14:22:01,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:22:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 677 transitions. [2018-12-02 14:22:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 14:22:01,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:01,091 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] [2018-12-02 14:22:01,092 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:01,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1082734469, now seen corresponding path program 1 times [2018-12-02 14:22:01,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:01,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:01,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 14:22:01,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:22:01,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:22:01,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:01,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:22:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:01,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:22:01,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-02 14:22:01,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:22:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:22:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:22:01,244 INFO L87 Difference]: Start difference. First operand 567 states and 677 transitions. Second operand 7 states. [2018-12-02 14:22:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:01,539 INFO L93 Difference]: Finished difference Result 1850 states and 2333 transitions. [2018-12-02 14:22:01,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 14:22:01,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-12-02 14:22:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:01,544 INFO L225 Difference]: With dead ends: 1850 [2018-12-02 14:22:01,544 INFO L226 Difference]: Without dead ends: 930 [2018-12-02 14:22:01,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:22:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-12-02 14:22:01,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 759. [2018-12-02 14:22:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-02 14:22:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 948 transitions. [2018-12-02 14:22:01,592 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 948 transitions. Word has length 87 [2018-12-02 14:22:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:01,593 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 948 transitions. [2018-12-02 14:22:01,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:22:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 948 transitions. [2018-12-02 14:22:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 14:22:01,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:01,595 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 14:22:01,595 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:01,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:01,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1369387122, now seen corresponding path program 1 times [2018-12-02 14:22:01,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:01,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:01,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:01,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:01,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 14:22:01,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:22:01,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:22:01,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:01,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:22:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:01,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:22:01,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-12-02 14:22:01,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 14:22:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 14:22:01,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:22:01,807 INFO L87 Difference]: Start difference. First operand 759 states and 948 transitions. Second operand 12 states. [2018-12-02 14:22:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:02,893 INFO L93 Difference]: Finished difference Result 2594 states and 4274 transitions. [2018-12-02 14:22:02,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 14:22:02,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-12-02 14:22:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:02,902 INFO L225 Difference]: With dead ends: 2594 [2018-12-02 14:22:02,902 INFO L226 Difference]: Without dead ends: 2591 [2018-12-02 14:22:02,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-12-02 14:22:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2018-12-02 14:22:03,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2512. [2018-12-02 14:22:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2018-12-02 14:22:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 4092 transitions. [2018-12-02 14:22:03,027 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 4092 transitions. Word has length 99 [2018-12-02 14:22:03,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:03,027 INFO L480 AbstractCegarLoop]: Abstraction has 2512 states and 4092 transitions. [2018-12-02 14:22:03,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 14:22:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 4092 transitions. [2018-12-02 14:22:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 14:22:03,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:03,030 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:03,030 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:03,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:03,030 INFO L82 PathProgramCache]: Analyzing trace with hash 509314117, now seen corresponding path program 2 times [2018-12-02 14:22:03,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:03,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:03,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:03,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:03,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 14:22:03,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:03,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:22:03,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:22:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:22:03,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:22:03,052 INFO L87 Difference]: Start difference. First operand 2512 states and 4092 transitions. Second operand 3 states. [2018-12-02 14:22:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:03,153 INFO L93 Difference]: Finished difference Result 4236 states and 7499 transitions. [2018-12-02 14:22:03,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:22:03,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-12-02 14:22:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:03,166 INFO L225 Difference]: With dead ends: 4236 [2018-12-02 14:22:03,167 INFO L226 Difference]: Without dead ends: 2365 [2018-12-02 14:22:03,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:22:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2018-12-02 14:22:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2365. [2018-12-02 14:22:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2018-12-02 14:22:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3821 transitions. [2018-12-02 14:22:03,335 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3821 transitions. Word has length 125 [2018-12-02 14:22:03,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:03,335 INFO L480 AbstractCegarLoop]: Abstraction has 2365 states and 3821 transitions. [2018-12-02 14:22:03,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:22:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3821 transitions. [2018-12-02 14:22:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 14:22:03,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:03,337 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:03,338 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:03,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:03,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1972759988, now seen corresponding path program 1 times [2018-12-02 14:22:03,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:03,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:03,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:03,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:22:03,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-02 14:22:03,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:22:03,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:22:03,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:03,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:22:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 14:22:03,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:22:03,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-02 14:22:03,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:22:03,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:22:03,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:22:03,504 INFO L87 Difference]: Start difference. First operand 2365 states and 3821 transitions. Second operand 9 states. [2018-12-02 14:22:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:04,008 INFO L93 Difference]: Finished difference Result 3071 states and 5408 transitions. [2018-12-02 14:22:04,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:22:04,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2018-12-02 14:22:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:04,009 INFO L225 Difference]: With dead ends: 3071 [2018-12-02 14:22:04,010 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 14:22:04,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:22:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 14:22:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 14:22:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 14:22:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 14:22:04,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2018-12-02 14:22:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:04,027 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:22:04,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:22:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 14:22:04,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 14:22:04,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 14:22:04,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:04,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:22:05,795 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2018-12-02 14:22:06,046 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2018-12-02 14:22:06,149 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2018-12-02 14:22:06,510 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2018-12-02 14:22:07,062 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 86 [2018-12-02 14:22:07,483 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2018-12-02 14:22:07,760 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2018-12-02 14:22:07,954 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 37 [2018-12-02 14:22:08,171 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2018-12-02 14:22:10,447 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 170 DAG size of output: 112 [2018-12-02 14:22:10,603 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-12-02 14:22:10,848 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2018-12-02 14:22:11,104 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-12-02 14:22:12,361 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 170 DAG size of output: 112 [2018-12-02 14:22:12,895 WARN L180 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 112 [2018-12-02 14:22:13,424 WARN L180 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 96 [2018-12-02 14:22:13,811 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2018-12-02 14:22:14,133 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-02 14:22:15,535 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 170 DAG size of output: 112 [2018-12-02 14:22:15,850 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2018-12-02 14:22:16,219 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-12-02 14:22:16,464 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 43 [2018-12-02 14:22:17,201 WARN L180 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2018-12-02 14:22:17,600 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2018-12-02 14:22:17,829 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2018-12-02 14:22:17,830 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2018-12-02 14:22:17,831 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-12-02 14:22:17,831 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2018-12-02 14:22:17,831 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2018-12-02 14:22:17,831 INFO L451 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: true [2018-12-02 14:22:17,831 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2018-12-02 14:22:17,831 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2018-12-02 14:22:17,831 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2018-12-02 14:22:17,831 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= ~p_dw_i~0 1)) (= ~p_dw_pc~0 2) (not (= ~q_free~0 1)) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_st~0 0) (= ~p_dw_pc~0 1) (not (= 0 ~c_num_read~0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2018-12-02 14:22:17,831 INFO L448 ceAbstractionStarter]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2018-12-02 14:22:17,831 INFO L444 ceAbstractionStarter]: At program point L354-1(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (and (not (= ~p_dw_pc~0 2)) (= ~c_num_read~0 0) (not (= 1 ~c_dr_pc~0)) (= ~q_free~0 1) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (= ~p_dw_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-12-02 14:22:17,831 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= 1 ~c_dr_pc~0)) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (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(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-12-02 14:22:17,831 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2018-12-02 14:22:17,831 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2018-12-02 14:22:17,831 INFO L448 ceAbstractionStarter]: For program point L355(line 355) no Hoare annotation was computed. [2018-12-02 14:22:17,832 INFO L444 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= 1 ~c_dr_pc~0)) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (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(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-12-02 14:22:17,832 INFO L444 ceAbstractionStarter]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse18 (= 1 ~c_dr_pc~0)) (.cse23 (= |old(~p_dw_pc~0)| 1)) (.cse25 (= ~p_dw_i~0 1))) (let ((.cse12 (= ~q_free~0 0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse25)) (.cse17 (not .cse23)) (.cse2 (not .cse18)) (.cse24 (not (= ~p_dw_st~0 1))) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= 1 ~p_dw_pc~0))) (let ((.cse19 (= 0 |old(~c_dr_st~0)|)) (.cse20 (and .cse2 .cse24 (not (= ~c_dr_st~0 0)) .cse25 .cse14 .cse16)) (.cse21 (or .cse18 .cse0 .cse1 .cse17)) (.cse7 (not (= 2 |old(~c_dr_st~0)|))) (.cse22 (and .cse2 .cse24 (= 2 ~c_dr_st~0) .cse25 .cse14 .cse16)) (.cse3 (= |old(~p_dw_pc~0)| 2)) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse5 (not (= 0 |old(~p_num_write~0)|))) (.cse6 (= |old(~p_dw_st~0)| 0)) (.cse9 (= |old(~p_dw_st~0)| 2)) (.cse10 (not (= 0 ~c_num_read~0))) (.cse8 (and .cse12 .cse13 (= 1 ~p_num_write~0) .cse14 .cse16)) (.cse11 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse6 (let ((.cse15 (+ |old(~p_num_write~0)| 1))) (and .cse12 .cse13 .cse14 (<= .cse15 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse15))) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse0 .cse1 .cse2 .cse17) .cse7 .cse9 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse18 .cse0 .cse1 .cse19 .cse4 .cse9 .cse20 .cse11) (or .cse21 .cse19 .cse9 .cse20) (or .cse21 .cse7 .cse9 .cse22) (or .cse18 .cse0 .cse1 .cse7 .cse4 .cse9 .cse22 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse18 .cse9 .cse23 .cse10 .cse8 .cse11))))) [2018-12-02 14:22:17,832 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse16 (= |old(~p_dw_pc~0)| 1))) (let ((.cse7 (= 1 ~c_dr_pc~0)) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (not .cse16))) (let ((.cse2 (= 2 ~c_dr_st~0)) (.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse0 (or .cse7 .cse5 .cse6 .cse8)) (.cse4 (= |old(~p_dw_st~0)| 0)) (.cse13 (= |old(~p_dw_pc~0)| 2)) (.cse11 (not (= ~p_dw_st~0 0))) (.cse12 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse20 (= 0 ~p_num_write~0)) (.cse17 (not (= 0 ~c_num_read~0))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse23 (= 0 |old(~c_dr_st~0)|)) (.cse18 (= ~q_free~0 1)) (.cse9 (not (= ~p_dw_st~0 2))) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (not (= ~c_dr_st~0 0))) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse3 (= |old(~p_dw_st~0)| 2)) (.cse21 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse5 .cse6 (not .cse7) .cse8) .cse1 .cse3 (< ~c_num_read~0 |old(~p_num_write~0)|)) (and (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse9 .cse2 .cse10) .cse11 .cse12)) (or .cse5 .cse6 .cse13 .cse14 .cse15 .cse4 .cse1 .cse3 .cse16 .cse17 (and .cse18 .cse2 .cse10 .cse11 .cse9 .cse19 .cse12 .cse20) .cse21) (or .cse7 .cse2 .cse5 .cse6 .cse1 .cse14 .cse3 .cse21) (or (and .cse9 .cse22 .cse10 (= 1 ~p_dw_pc~0)) .cse0 .cse23 .cse3) (or .cse4 .cse7 .cse5 .cse6 .cse13 .cse14 .cse3 (and .cse18 .cse10 .cse11 .cse9 .cse19 .cse12 .cse20) .cse16 .cse17 .cse15 .cse21) (or .cse7 .cse5 .cse6 .cse23 (and .cse18 .cse9 (not (= ~p_dw_pc~0 1)) .cse19 .cse22 .cse10) .cse14 .cse3 .cse16 .cse21))))) [2018-12-02 14:22:17,832 INFO L444 ceAbstractionStarter]: At program point L124(line 124) the Hoare annotation is: (let ((.cse16 (= |old(~p_dw_pc~0)| 1))) (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (not .cse16)) (.cse13 (= 1 ~c_dr_pc~0))) (let ((.cse3 (not .cse13)) (.cse19 (= |old(~p_dw_pc~0)| 2)) (.cse20 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (= ~p_dw_st~0 0))) (.cse10 (= ~q_free~0 0)) (.cse21 (= 1 ~p_num_write~0)) (.cse12 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse22 (not (= 0 ~c_num_read~0))) (.cse5 (not (= 2 |old(~c_dr_st~0)|))) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse7 (= 2 ~c_dr_st~0)) (.cse18 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse11 (not (= ~p_dw_st~0 2))) (.cse17 (not (= ~c_dr_st~0 0))) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (or .cse13 .cse1 .cse2 .cse4)) (.cse14 (= 0 |old(~c_dr_st~0)|)) (.cse6 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 (< ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse7 .cse8 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse9 .cse10 .cse11 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse12)) (or .cse13 .cse1 .cse2 .cse14 .cse15 .cse6 .cse16 (and .cse11 (not (= ~p_dw_pc~0 1)) .cse17 .cse8) .cse18) (or .cse1 .cse2 .cse19 .cse15 .cse20 .cse0 .cse13 (and .cse9 .cse10 .cse11 .cse21 .cse12 .cse8) .cse6 .cse16 .cse22 .cse18) (or .cse1 .cse2 .cse3 .cse19 .cse15 .cse20 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12) .cse0 .cse5 .cse6 .cse22 .cse18) (or .cse23 .cse5 .cse7 .cse6) (or .cse13 .cse1 .cse2 .cse5 .cse15 .cse7 .cse6 .cse18) (or (and .cse11 .cse17 .cse8 (= 1 ~p_dw_pc~0)) .cse23 .cse14 .cse6))))) [2018-12-02 14:22:17,832 INFO L448 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-12-02 14:22:17,832 INFO L448 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2018-12-02 14:22:17,832 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2018-12-02 14:22:17,833 INFO L444 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_pc~0)| 1))) (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse22 (not .cse6)) (.cse0 (= 1 ~c_dr_pc~0))) (let ((.cse21 (not .cse0)) (.cse14 (= |old(~p_dw_pc~0)| 2)) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse17 (not (= ~p_dw_st~0 0))) (.cse13 (= 2 ~c_dr_st~0)) (.cse18 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse19 (= 0 ~p_num_write~0)) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (= |old(~p_dw_st~0)| 0)) (.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse20 (not (= 0 ~c_num_read~0))) (.cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse7 (not (= ~p_dw_st~0 2))) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (or .cse0 .cse1 .cse2 .cse22)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (not (= ~p_dw_pc~0 1)) .cse8 .cse9) .cse10) (or .cse11 .cse12 .cse13 .cse5) (or .cse1 .cse2 .cse14 .cse4 .cse15 .cse16 .cse0 (and .cse17 .cse7 .cse18 .cse9 .cse19) .cse5 .cse6 .cse20 .cse10) (or .cse16 (and .cse17 (and (= ~p_num_write~0 |old(~p_num_write~0)|) (and .cse7 .cse13 .cse9)) .cse18) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse2 .cse21 .cse22) .cse12 .cse5 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse0 .cse1 .cse2 .cse12 .cse4 .cse13 .cse5 .cse10) (or .cse1 .cse2 .cse21 .cse14 .cse4 (and .cse17 .cse7 .cse13 .cse18 .cse9 .cse19) .cse15 .cse16 .cse12 .cse5 .cse20 .cse10) (or (and .cse7 .cse8 .cse9 (= 1 ~p_dw_pc~0)) .cse11 .cse3 .cse5))))) [2018-12-02 14:22:17,833 INFO L444 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_pc~0)| 1))) (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse15 (not .cse6)) (.cse23 (not (= ~p_dw_st~0 0))) (.cse12 (= ~q_free~0 0)) (.cse7 (not (= ~p_dw_st~0 2))) (.cse25 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse18 (= 2 ~c_dr_st~0)) (.cse19 (= |old(~p_dw_pc~0)| 2)) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse20 (not (= 0 |old(~p_num_write~0)|))) (.cse11 (= |old(~p_dw_st~0)| 0)) (.cse27 (and .cse23 .cse12 .cse7 (= 1 ~p_num_write~0) .cse25 .cse9)) (.cse22 (= ~q_free~0 1)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (= 0 ~p_num_write~0)) (.cse21 (not (= 0 ~c_num_read~0))) (.cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse8 (not (= ~c_dr_st~0 0))) (.cse13 (= 1 ~p_dw_pc~0)) (.cse17 (or .cse0 .cse1 .cse2 .cse15)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (not (= ~p_dw_pc~0 1)) .cse8 .cse9) .cse10) (or .cse11 (let ((.cse14 (+ |old(~p_num_write~0)| 1))) (and .cse12 (and .cse7 .cse9 .cse13) (<= .cse14 ~p_num_write~0) (<= ~p_num_write~0 .cse14))) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse2 (not .cse0) .cse15) .cse16 .cse5 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse17 .cse16 .cse18 .cse5) (or .cse1 .cse2 .cse19 .cse4 .cse20 .cse11 .cse16 .cse5 .cse6 .cse21 (and .cse22 .cse18 .cse9 .cse23 .cse7 .cse24 .cse25 .cse26) .cse10 .cse27) (or .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse10) (or .cse1 .cse2 .cse19 .cse4 .cse20 .cse11 .cse0 .cse27 .cse5 (and .cse22 .cse9 .cse23 .cse7 .cse24 .cse25 .cse26) .cse6 .cse21 .cse10) (or (and .cse7 .cse8 .cse9 .cse13) .cse17 .cse3 .cse5))))) [2018-12-02 14:22:17,833 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2018-12-02 14:22:17,833 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-12-02 14:22:17,833 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-12-02 14:22:17,833 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-12-02 14:22:17,833 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-12-02 14:22:17,833 INFO L444 ceAbstractionStarter]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse14 (= ~p_dw_st~0 0))) (let ((.cse10 (= ~p_dw_pc~0 1)) (.cse13 (not (= ~c_dr_st~0 0))) (.cse1 (= 1 ~c_dr_pc~0)) (.cse24 (= 2 ~c_dr_st~0)) (.cse6 (not .cse14)) (.cse7 (not (= ~p_dw_st~0 2)))) (let ((.cse4 (= ~p_dw_pc~0 2)) (.cse11 (not (= 0 ~c_num_read~0))) (.cse8 (not (= 1 ~p_num_write~0))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse5 (not (= ~q_free~0 0))) (.cse17 (and .cse24 .cse6 .cse7)) (.cse23 (not .cse1)) (.cse19 (and (<= 2 ~p_dw_st~0) .cse13)) (.cse15 (not .cse10)) (.cse18 (not (= ~q_free~0 1))) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse20 (< |old(~p_dw_st~0)| 2)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse12 .cse9 (and .cse7 .cse13)) (or .cse14 (or .cse1 .cse2 .cse3 .cse15) .cse12 (not .cse0)) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse8 .cse9 .cse10 .cse11 .cse17) (or .cse2 .cse3 .cse15 .cse18 .cse19 .cse12 .cse8 (not (= 1 ~c_num_read~0)) .cse20 .cse21) (let ((.cse22 (+ ~c_num_read~0 1))) (or .cse0 (< ~p_num_write~0 .cse22) (or .cse16 (or .cse2 .cse3 .cse23 .cse15) .cse9) .cse5 (< .cse22 ~p_num_write~0) .cse17)) (or .cse2 .cse3 .cse23 .cse19 .cse15 .cse18 (< ~p_num_write~0 ~c_num_read~0) .cse12 (< ~c_num_read~0 ~p_num_write~0) .cse20 .cse21) (or .cse1 .cse2 .cse3 .cse16 .cse24 .cse9))))) [2018-12-02 14:22:17,833 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2018-12-02 14:22:17,833 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-12-02 14:22:17,833 INFO L448 ceAbstractionStarter]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2018-12-02 14:22:17,833 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2018-12-02 14:22:17,833 INFO L448 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2018-12-02 14:22:17,834 INFO L444 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (let ((.cse14 (= ~p_dw_st~0 0))) (let ((.cse10 (= ~p_dw_pc~0 1)) (.cse13 (not (= ~c_dr_st~0 0))) (.cse1 (= 1 ~c_dr_pc~0)) (.cse24 (= 2 ~c_dr_st~0)) (.cse6 (not .cse14)) (.cse7 (not (= ~p_dw_st~0 2)))) (let ((.cse4 (= ~p_dw_pc~0 2)) (.cse11 (not (= 0 ~c_num_read~0))) (.cse8 (not (= 1 ~p_num_write~0))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse5 (not (= ~q_free~0 0))) (.cse17 (and .cse24 .cse6 .cse7)) (.cse23 (not .cse1)) (.cse19 (and (<= 2 ~p_dw_st~0) .cse13)) (.cse15 (not .cse10)) (.cse18 (not (= ~q_free~0 1))) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse20 (< |old(~p_dw_st~0)| 2)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse12 .cse9 (and .cse7 .cse13)) (or .cse14 (or .cse1 .cse2 .cse3 .cse15) .cse12 (not .cse0)) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse8 .cse9 .cse10 .cse11 .cse17) (or .cse2 .cse3 .cse15 .cse18 .cse19 .cse12 .cse8 (not (= 1 ~c_num_read~0)) .cse20 .cse21) (let ((.cse22 (+ ~c_num_read~0 1))) (or .cse0 (< ~p_num_write~0 .cse22) (or .cse16 (or .cse2 .cse3 .cse23 .cse15) .cse9) .cse5 (< .cse22 ~p_num_write~0) .cse17)) (or .cse2 .cse3 .cse23 .cse19 .cse15 .cse18 (< ~p_num_write~0 ~c_num_read~0) .cse12 (< ~c_num_read~0 ~p_num_write~0) .cse20 .cse21) (or .cse1 .cse2 .cse3 .cse16 .cse24 .cse9))))) [2018-12-02 14:22:17,834 INFO L444 ceAbstractionStarter]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse21 (= ~p_dw_pc~0 1))) (let ((.cse3 (= immediate_notify_threads_~tmp~0 0)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse4 (= ~p_dw_st~0 0)) (.cse17 (= 1 ~c_dr_pc~0)) (.cse7 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse9 (not .cse21))) (let ((.cse0 (or .cse17 .cse7 .cse8 .cse9)) (.cse19 (= ~p_dw_pc~0 2)) (.cse18 (not .cse4)) (.cse13 (not (= 1 ~p_num_write~0))) (.cse22 (not (= 0 ~c_num_read~0))) (.cse16 (= |old(~p_dw_st~0)| 0)) (.cse5 (not (= ~p_dw_st~0 2))) (.cse24 (= 2 ~c_dr_st~0)) (.cse23 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (= |old(~p_dw_st~0)| 2)) (.cse20 (not (= ~q_free~0 0))) (.cse12 (and (<= 2 ~p_dw_st~0) .cse3 .cse6)) (.cse10 (not (= ~q_free~0 1))) (.cse1 (= 0 |old(~c_dr_st~0)|)) (.cse11 (and .cse4 .cse6)) (.cse14 (< |old(~p_dw_st~0)| 2)) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 (and (or .cse3 .cse4) .cse5 .cse6)) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 (not (= 1 ~c_num_read~0)) .cse14 .cse15) (or .cse16 .cse17 (and .cse18 .cse3 .cse5) .cse7 .cse8 .cse19 .cse20 .cse13 .cse2 .cse21 .cse22) (or .cse17 .cse7 .cse8 .cse23 .cse2 .cse24) (or .cse4 .cse0 .cse1 (not .cse16)) (or .cse16 .cse7 .cse8 .cse19 .cse20 .cse23 (and .cse24 .cse18 .cse3 .cse5) .cse13 .cse2 .cse21 .cse22) (or (and .cse3 .cse5 .cse6) .cse17 .cse7 .cse8 .cse1 .cse2 .cse21) (let ((.cse25 (+ ~c_num_read~0 1))) (or .cse16 (< ~p_num_write~0 .cse25) (and (or .cse4 .cse3) .cse5 .cse24) (or .cse23 (or .cse7 .cse8 .cse9) .cse2) .cse20 (< .cse25 ~p_num_write~0))) (or .cse12 .cse7 .cse8 (not .cse17) .cse9 .cse10 (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse11 (< ~c_num_read~0 ~p_num_write~0) .cse14 .cse15))))) [2018-12-02 14:22:17,834 INFO L448 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2018-12-02 14:22:17,834 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 14:22:17,834 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(~p_dw_pc~0)| ~p_dw_pc~0)) [2018-12-02 14:22:17,834 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 14:22:17,834 INFO L448 ceAbstractionStarter]: For program point L290-1(line 290) no Hoare annotation was computed. [2018-12-02 14:22:17,834 INFO L451 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: true [2018-12-02 14:22:17,834 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2018-12-02 14:22:17,834 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2018-12-02 14:22:17,834 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2018-12-02 14:22:17,834 INFO L451 ceAbstractionStarter]: At program point L290(line 290) the Hoare annotation is: true [2018-12-02 14:22:17,834 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2018-12-02 14:22:17,835 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse22 (= |old(~p_dw_pc~0)| 1)) (.cse0 (= 1 |old(~c_dr_pc~0)|))) (let ((.cse32 (= 1 ~c_dr_pc~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse34 (not .cse0)) (.cse5 (not .cse22)) (.cse40 (+ |old(~c_num_read~0)| 1))) (let ((.cse26 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse35 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse28 (<= ~c_num_read~0 ~p_num_write~0)) (.cse29 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (= |old(~p_dw_pc~0)| 2)) (.cse20 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse21 (= 0 ~p_num_write~0)) (.cse24 (not (= 0 |old(~p_num_write~0)|))) (.cse18 (= ~c_num_read~0 0)) (.cse23 (not (= 0 |old(~c_num_read~0)|))) (.cse38 (= |old(~p_dw_st~0)| 1)) (.cse37 (= ~q_free~0 0)) (.cse30 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse36 (<= 2 ~p_dw_st~0)) (.cse33 (= 1 ~p_dw_pc~0)) (.cse7 (< |old(~p_num_write~0)| .cse40)) (.cse8 (or .cse1 .cse2 .cse34 .cse5)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse27 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (< .cse40 |old(~p_num_write~0)|)) (.cse31 (= 2 ~c_dr_st~0)) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse15 (not .cse32)) (.cse16 (= ~q_free~0 1)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse25 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse6 (and .cse15 .cse16 .cse3 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25) (or .cse26 .cse27 (and .cse28 .cse29 .cse30 .cse3 .cse31 .cse32 .cse17 .cse33) (or .cse1 .cse2 .cse34 .cse5 .cse6) .cse35) (or .cse8 .cse26 .cse27 .cse35 .cse12 (and .cse28 .cse29 .cse30 .cse36 .cse31 .cse32 .cse17 .cse33)) (or .cse1 .cse2 .cse34 .cse13 .cse27 (and .cse16 .cse3 .cse31 .cse32 .cse17 .cse18 .cse19 .cse20 .cse21) .cse14 .cse6 .cse22 .cse23 .cse24 .cse25) (or (and .cse18 .cse15 .cse37 .cse36 (= 1 ~p_num_write~0) .cse17 .cse33) .cse0 .cse1 .cse2 .cse9 .cse5 (not (= 1 |old(~p_num_write~0)|)) .cse23 .cse12) (or .cse0 .cse1 .cse2 .cse4 .cse5 (and .cse15 (not (= ~p_dw_st~0 1)) .cse10 .cse17 .cse33) .cse38) (or .cse31 .cse0 .cse1 .cse2 .cse27 .cse14 .cse6 .cse25) (or .cse0 .cse1 .cse2 .cse27 .cse5 .cse31 .cse38) (or .cse7 .cse8 .cse9 .cse11 (let ((.cse39 (+ ~c_num_read~0 1))) (and .cse37 (<= .cse39 ~p_num_write~0) .cse30 .cse36 (<= ~p_num_write~0 .cse39) .cse32 .cse17 .cse33)) .cse12) (or .cse7 .cse8 .cse9 .cse27 .cse11 .cse31 .cse12) (or .cse0 .cse1 .cse2 (and .cse15 .cse16 (not (= ~p_dw_pc~0 1)) .cse19 .cse3 .cse10 .cse17) .cse4 .cse14 .cse6 .cse22 .cse25))))) [2018-12-02 14:22:17,835 INFO L444 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (let ((.cse22 (= 1 ~c_dr_pc~0)) (.cse32 (= |old(~p_dw_pc~0)| 1)) (.cse10 (= 1 |old(~c_dr_pc~0)|)) (.cse36 (= ~p_dw_i~0 1))) (let ((.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse36)) (.cse4 (not .cse10)) (.cse5 (not .cse32)) (.cse25 (not (= ~p_dw_st~0 0))) (.cse9 (= 2 ~c_dr_st~0)) (.cse38 (+ |old(~c_num_read~0)| 1)) (.cse37 (= 1 ~p_dw_pc~0)) (.cse31 (not .cse22)) (.cse21 (= ~q_free~0 1)) (.cse26 (not (= ~p_dw_st~0 2))) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse39 (not (= ~c_dr_st~0 0))) (.cse23 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse15 (= |old(~p_dw_st~0)| 1)) (.cse19 (= |old(~p_dw_pc~0)| 2)) (.cse30 (and .cse31 .cse21 .cse26 (not (= ~p_dw_pc~0 1)) .cse27 .cse39 .cse36 .cse23)) (.cse11 (not (= |old(~q_free~0)| 1))) (.cse20 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (and .cse31 .cse26 .cse39 .cse36 .cse23 .cse37)) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse24 (= ~c_num_read~0 0)) (.cse28 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse29 (= 0 ~p_num_write~0)) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse14 (= 0 |old(~c_dr_st~0)|)) (.cse33 (< |old(~p_num_write~0)| .cse38)) (.cse16 (not (= |old(~q_free~0)| 0))) (.cse35 (< .cse38 |old(~p_num_write~0)|)) (.cse7 (and .cse25 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse26 .cse9 .cse36 .cse22 .cse23 .cse37))) (.cse34 (or .cse2 .cse3 .cse4 .cse5)) (.cse0 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse8 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse18 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8) (or .cse9 .cse10 .cse2 .cse3 .cse1 .cse11 .cse6 .cse12) (or .cse13 .cse10 .cse2 .cse3 .cse14 .cse5 .cse15) (or .cse10 .cse2 .cse3 .cse1 .cse9 .cse5 .cse15) (or .cse2 .cse3 .cse5 .cse7 .cse13 .cse16 (not (= 1 |old(~p_num_write~0)|)) .cse17 .cse18) (or .cse2 .cse3 .cse4 .cse19 .cse11 .cse7 .cse20 .cse1 .cse6 .cse17 (and .cse21 .cse9 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse12) (or .cse13 .cse10 .cse2 .cse3 .cse30 .cse14 .cse11 .cse6 .cse12) (or .cse2 .cse3 .cse19 .cse30 .cse11 .cse7 (and .cse21 .cse9 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse20 .cse13 .cse10 .cse6 (and .cse31 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse32 .cse17 .cse12) (or .cse33 .cse34 .cse16 .cse35 .cse14 .cse18) (or .cse33 .cse34 .cse16 .cse35 .cse7 .cse18) (or .cse34 .cse0 .cse1 .cse8 .cse18))))) [2018-12-02 14:22:17,835 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2018-12-02 14:22:17,835 INFO L448 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2018-12-02 14:22:17,835 INFO L448 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-12-02 14:22:17,835 INFO L444 ceAbstractionStarter]: At program point L238(line 238) the Hoare annotation is: (let ((.cse35 (= 1 ~c_dr_pc~0)) (.cse26 (= |old(~p_dw_pc~0)| 1)) (.cse16 (= 1 |old(~c_dr_pc~0)|)) (.cse45 (= ~p_dw_i~0 1)) (.cse47 (+ ~c_num_read~0 1))) (let ((.cse8 (<= .cse47 ~p_num_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse46 (= ~q_free~0 0)) (.cse41 (<= ~c_num_read~0 ~p_num_write~0)) (.cse42 (<= ~p_num_write~0 ~c_num_read~0)) (.cse43 (<= 2 ~p_dw_st~0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse44 (= 1 ~p_dw_pc~0)) (.cse29 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse12 (not .cse45)) (.cse34 (not .cse16)) (.cse37 (not .cse26)) (.cse48 (+ |old(~c_num_read~0)| 1)) (.cse25 (not .cse35)) (.cse17 (= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse20 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (= |old(~p_dw_pc~0)| 2)) (.cse23 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse24 (= 0 ~p_num_write~0)) (.cse31 (not (= 0 |old(~p_num_write~0)|))) (.cse30 (and .cse25 .cse17 .cse22 .cse18 .cse10 .cse45 .cse20)) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse39 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse33 (not (= |old(~p_dw_st~0)| 0))) (.cse40 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse0 (< |old(~p_num_write~0)| .cse48)) (.cse1 (or .cse29 .cse12 .cse34 .cse37)) (.cse36 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (< .cse48 |old(~p_num_write~0)|)) (.cse3 (and .cse41 .cse42 .cse43 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse4 (and .cse41 .cse42 .cse18 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse14 (and .cse21 .cse46 .cse43 (= 1 ~p_num_write~0) .cse20 .cse44)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse6 (and .cse46 .cse8 .cse43 (<= ~p_num_write~0 .cse47) .cse45 .cse35 .cse20 .cse44)) (.cse27 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse32 (and .cse25 (not (= ~p_dw_st~0 1)) .cse10 .cse45 .cse20 .cse44)) (.cse38 (= |old(~p_dw_st~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse5 (and .cse8 .cse9 .cse10) .cse2 .cse11 .cse7) (or .cse12 .cse13 .cse14 .cse15 .cse4 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) .cse6 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse3 .cse33) (or .cse12 .cse34 .cse13 (and .cse17 .cse18 .cse19 .cse35 .cse20 .cse21 .cse22 .cse23 .cse24) .cse15 .cse4 .cse36 .cse6 .cse27 .cse28 .cse29 .cse31 .cse3 .cse33) (or .cse19 .cse16 .cse29 .cse12 .cse36 .cse15 .cse33 .cse28) (or .cse16 .cse29 .cse12 .cse36 .cse37 .cse19 .cse38) (or .cse16 .cse29 .cse12 .cse30 .cse11 .cse15 .cse33 .cse32 .cse28) (or .cse1 .cse39 .cse36 .cse40 .cse7 (and .cse41 .cse42 .cse9 .cse43 .cse19 .cse35 .cse20 .cse44)) (or .cse39 .cse36 (or .cse29 .cse12 .cse34 .cse37 .cse33) .cse6 .cse40 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse36 .cse2 .cse19 .cse7) (or .cse29 .cse12 .cse37 .cse3 .cse32 .cse4 .cse14 .cse5 (not (= 1 |old(~p_num_write~0)|)) .cse6 .cse27 .cse7) (or .cse16 .cse29 .cse12 .cse11 .cse37 .cse32 .cse38))))) [2018-12-02 14:22:17,835 INFO L444 ceAbstractionStarter]: At program point L269(line 269) the Hoare annotation is: (let ((.cse19 (= |old(~p_dw_pc~0)| 1)) (.cse31 (= ~p_dw_i~0 1))) (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse31)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse28 (not .cse19)) (.cse10 (= ~q_free~0 0)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~c_dr_st~0 0))) (.cse17 (= 1 ~c_dr_pc~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= 1 ~p_dw_pc~0)) (.cse32 (+ |old(~c_num_read~0)| 1))) (let ((.cse8 (= |old(~p_dw_pc~0)| 2)) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse16 (not (= 0 |old(~p_num_write~0)|))) (.cse6 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse22 (< |old(~p_num_write~0)| .cse32)) (.cse25 (< .cse32 |old(~p_num_write~0)|)) (.cse5 (not (= |old(~p_dw_st~0)| 0))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse7 (let ((.cse30 (+ ~c_num_read~0 1))) (and .cse10 (<= .cse30 ~p_num_write~0) .cse11 (<= ~p_num_write~0 .cse30) .cse13 .cse31 .cse17 .cse14 .cse15))) (.cse24 (not (= |old(~q_free~0)| 0))) (.cse9 (= ~c_num_read~0 0)) (.cse12 (= 1 ~p_num_write~0)) (.cse18 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse20 (not (= 0 |old(~c_num_read~0)|))) (.cse23 (or .cse1 .cse2 (not .cse0) .cse28)) (.cse27 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse21 (not (= 2 |old(~c_dr_st~0)|))) (.cse29 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse26 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse1 .cse2 .cse8 .cse4 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse0 (and (not .cse17) (= ~q_free~0 1) (= ~p_dw_st~0 0) .cse14 .cse9 (= ~c_last_read~0 ~p_last_write~0) .cse13 .cse18 (= 0 ~p_num_write~0)) .cse5 .cse19 .cse20 .cse6) (or .cse7 .cse1 .cse2 .cse8 .cse4 .cse16 .cse21 .cse5 .cse20 .cse6) (or .cse22 .cse23 .cse7 .cse24 .cse25 .cse26) (or .cse22 .cse23 .cse24 .cse25 .cse3 .cse26) (or .cse7 .cse27 .cse21 (or .cse1 .cse2 .cse28 .cse5) .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse28 (= |old(~p_dw_st~0)| 1)) (or .cse7 .cse1 .cse2 .cse24 .cse28 (not (= 1 |old(~p_num_write~0)|)) (and .cse11 .cse14 .cse9 .cse10 .cse12 .cse13 .cse18) .cse20 .cse26) (or .cse23 .cse27 .cse21 .cse29 .cse26))))) [2018-12-02 14:22:17,835 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2018-12-02 14:22:17,836 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2018-12-02 14:22:17,836 INFO L448 ceAbstractionStarter]: For program point L247(lines 237 277) no Hoare annotation was computed. [2018-12-02 14:22:17,836 INFO L444 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse35 (= 1 ~c_dr_pc~0)) (.cse26 (= |old(~p_dw_pc~0)| 1)) (.cse16 (= 1 |old(~c_dr_pc~0)|)) (.cse45 (= ~p_dw_i~0 1)) (.cse47 (+ ~c_num_read~0 1))) (let ((.cse8 (<= .cse47 ~p_num_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse46 (= ~q_free~0 0)) (.cse41 (<= ~c_num_read~0 ~p_num_write~0)) (.cse42 (<= ~p_num_write~0 ~c_num_read~0)) (.cse43 (<= 2 ~p_dw_st~0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse44 (= 1 ~p_dw_pc~0)) (.cse29 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse12 (not .cse45)) (.cse34 (not .cse16)) (.cse37 (not .cse26)) (.cse48 (+ |old(~c_num_read~0)| 1)) (.cse25 (not .cse35)) (.cse17 (= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse20 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (= |old(~p_dw_pc~0)| 2)) (.cse23 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse24 (= 0 ~p_num_write~0)) (.cse31 (not (= 0 |old(~p_num_write~0)|))) (.cse30 (and .cse25 .cse17 .cse22 .cse18 .cse10 .cse45 .cse20)) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse39 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse33 (not (= |old(~p_dw_st~0)| 0))) (.cse40 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse0 (< |old(~p_num_write~0)| .cse48)) (.cse1 (or .cse29 .cse12 .cse34 .cse37)) (.cse36 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (< .cse48 |old(~p_num_write~0)|)) (.cse3 (and .cse41 .cse42 .cse43 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse4 (and .cse41 .cse42 .cse18 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse14 (and .cse21 .cse46 .cse43 (= 1 ~p_num_write~0) .cse20 .cse44)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse6 (and .cse46 .cse8 .cse43 (<= ~p_num_write~0 .cse47) .cse45 .cse35 .cse20 .cse44)) (.cse27 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse32 (and .cse25 (not (= ~p_dw_st~0 1)) .cse10 .cse45 .cse20 .cse44)) (.cse38 (= |old(~p_dw_st~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse5 (and .cse8 .cse9 .cse10) .cse2 .cse11 .cse7) (or .cse12 .cse13 .cse14 .cse15 .cse4 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) .cse6 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse3 .cse33) (or .cse12 .cse34 .cse13 (and .cse17 .cse18 .cse19 .cse35 .cse20 .cse21 .cse22 .cse23 .cse24) .cse15 .cse4 .cse36 .cse6 .cse27 .cse28 .cse29 .cse31 .cse3 .cse33) (or .cse19 .cse16 .cse29 .cse12 .cse36 .cse15 .cse33 .cse28) (or .cse16 .cse29 .cse12 .cse36 .cse37 .cse19 .cse38) (or .cse16 .cse29 .cse12 .cse30 .cse11 .cse15 .cse33 .cse32 .cse28) (or .cse1 .cse39 .cse36 .cse40 .cse7 (and .cse41 .cse42 .cse9 .cse43 .cse19 .cse35 .cse20 .cse44)) (or .cse39 .cse36 (or .cse29 .cse12 .cse34 .cse37 .cse33) .cse6 .cse40 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse36 .cse2 .cse19 .cse7) (or .cse29 .cse12 .cse37 .cse3 .cse32 .cse4 .cse14 .cse5 (not (= 1 |old(~p_num_write~0)|)) .cse6 .cse27 .cse7) (or .cse16 .cse29 .cse12 .cse11 .cse37 .cse32 .cse38))))) [2018-12-02 14:22:17,836 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2018-12-02 14:22:17,836 INFO L444 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse35 (= 1 ~c_dr_pc~0)) (.cse26 (= |old(~p_dw_pc~0)| 1)) (.cse16 (= 1 |old(~c_dr_pc~0)|)) (.cse45 (= ~p_dw_i~0 1)) (.cse47 (+ ~c_num_read~0 1))) (let ((.cse8 (<= .cse47 ~p_num_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse46 (= ~q_free~0 0)) (.cse41 (<= ~c_num_read~0 ~p_num_write~0)) (.cse42 (<= ~p_num_write~0 ~c_num_read~0)) (.cse43 (<= 2 ~p_dw_st~0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse44 (= 1 ~p_dw_pc~0)) (.cse29 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse12 (not .cse45)) (.cse34 (not .cse16)) (.cse37 (not .cse26)) (.cse48 (+ |old(~c_num_read~0)| 1)) (.cse25 (not .cse35)) (.cse17 (= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse20 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (= |old(~p_dw_pc~0)| 2)) (.cse23 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse24 (= 0 ~p_num_write~0)) (.cse31 (not (= 0 |old(~p_num_write~0)|))) (.cse30 (and .cse25 .cse17 .cse22 .cse18 .cse10 .cse45 .cse20)) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse39 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse33 (not (= |old(~p_dw_st~0)| 0))) (.cse40 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse0 (< |old(~p_num_write~0)| .cse48)) (.cse1 (or .cse29 .cse12 .cse34 .cse37)) (.cse36 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (< .cse48 |old(~p_num_write~0)|)) (.cse3 (and .cse41 .cse42 .cse43 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse4 (and .cse41 .cse42 .cse18 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse14 (and .cse21 .cse46 .cse43 (= 1 ~p_num_write~0) .cse20 .cse44)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse6 (and .cse46 .cse8 .cse43 (<= ~p_num_write~0 .cse47) .cse45 .cse35 .cse20 .cse44)) (.cse27 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse32 (and .cse25 (not (= ~p_dw_st~0 1)) .cse10 .cse45 .cse20 .cse44)) (.cse38 (= |old(~p_dw_st~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse5 (and .cse8 .cse9 .cse10) .cse2 .cse11 .cse7) (or .cse12 .cse13 .cse14 .cse15 .cse4 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) .cse6 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse3 .cse33) (or .cse12 .cse34 .cse13 (and .cse17 .cse18 .cse19 .cse35 .cse20 .cse21 .cse22 .cse23 .cse24) .cse15 .cse4 .cse36 .cse6 .cse27 .cse28 .cse29 .cse31 .cse3 .cse33) (or .cse19 .cse16 .cse29 .cse12 .cse36 .cse15 .cse33 .cse28) (or .cse16 .cse29 .cse12 .cse36 .cse37 .cse19 .cse38) (or .cse16 .cse29 .cse12 .cse30 .cse11 .cse15 .cse33 .cse32 .cse28) (or .cse1 .cse39 .cse36 .cse40 .cse7 (and .cse41 .cse42 .cse9 .cse43 .cse19 .cse35 .cse20 .cse44)) (or .cse39 .cse36 (or .cse29 .cse12 .cse34 .cse37 .cse33) .cse6 .cse40 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse36 .cse2 .cse19 .cse7) (or .cse29 .cse12 .cse37 .cse3 .cse32 .cse4 .cse14 .cse5 (not (= 1 |old(~p_num_write~0)|)) .cse6 .cse27 .cse7) (or .cse16 .cse29 .cse12 .cse11 .cse37 .cse32 .cse38))))) [2018-12-02 14:22:17,836 INFO L444 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse4 (= 0 ~c_dr_st~0)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse5 (= ~p_dw_st~0 2)) (.cse6 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse2 .cse3 .cse1 (not .cse6) (not (= ~q_free~0 1)) .cse0 .cse4 .cse7 (not (= 1 ~c_num_read~0)) (not (= ~c_last_read~0 ~p_last_write~0))) (or (= ~p_dw_st~0 0) .cse0 .cse1 .cse2 .cse3 (= ~p_dw_pc~0 2) (not (= ~q_free~0 0)) .cse7 .cse5 .cse6 (not (= 0 ~c_num_read~0))))) [2018-12-02 14:22:17,836 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2018-12-02 14:22:17,836 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2018-12-02 14:22:17,836 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2018-12-02 14:22:17,836 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2018-12-02 14:22:17,836 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2018-12-02 14:22:17,837 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2018-12-02 14:22:17,837 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) (and (not (= 1 ~c_dr_pc~0)) (= ~q_free~0 1) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-12-02 14:22:17,837 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2018-12-02 14:22:17,837 INFO L448 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2018-12-02 14:22:17,837 INFO L444 ceAbstractionStarter]: At program point L317(line 317) the Hoare annotation is: (let ((.cse15 (= 1 ~c_dr_pc~0))) (let ((.cse0 (= ~c_num_read~0 0)) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse1 (= ~q_free~0 0)) (.cse9 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse13 (not .cse15)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~p_dw_pc~0))) (or (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (and .cse0 .cse1 .cse2 (= 1 ~p_num_write~0) .cse3 .cse4) (not (= |old(~q_free~0)| 1)) (and .cse5 .cse6 .cse7 .cse8 .cse3 .cse4) (= 1 |old(~c_dr_pc~0)|) (and .cse9 .cse7 .cse8 .cse3 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse7 .cse3 .cse0 .cse10 .cse11 .cse12) (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse1 (<= .cse14 ~p_num_write~0) .cse2 (<= ~p_num_write~0 .cse14) .cse15 .cse3 .cse4)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse13 .cse9 .cse10 .cse7 .cse16 .cse3) (not (= 0 |old(~p_num_write~0)|)) (and .cse13 (not (= ~p_dw_st~0 1)) .cse16 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse8 .cse3 .cse4) (not (= |old(~p_dw_st~0)| 0))))) [2018-12-02 14:22:17,837 INFO L444 ceAbstractionStarter]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse15 (= 1 ~c_dr_pc~0))) (let ((.cse0 (= ~c_num_read~0 0)) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse1 (= ~q_free~0 0)) (.cse9 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse13 (not .cse15)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~p_dw_pc~0))) (or (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (and .cse0 .cse1 .cse2 (= 1 ~p_num_write~0) .cse3 .cse4) (not (= |old(~q_free~0)| 1)) (and .cse5 .cse6 .cse7 .cse8 .cse3 .cse4) (= 1 |old(~c_dr_pc~0)|) (and .cse9 .cse7 .cse8 .cse3 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse7 .cse3 .cse0 .cse10 .cse11 .cse12) (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse1 (<= .cse14 ~p_num_write~0) .cse2 (<= ~p_num_write~0 .cse14) .cse15 .cse3 .cse4)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse13 .cse9 .cse10 .cse7 .cse16 .cse3) (not (= 0 |old(~p_num_write~0)|)) (and .cse13 (not (= ~p_dw_st~0 1)) .cse16 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse8 .cse3 .cse4) (not (= |old(~p_dw_st~0)| 0))))) [2018-12-02 14:22:17,837 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2018-12-02 14:22:17,837 INFO L448 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2018-12-02 14:22:17,837 INFO L444 ceAbstractionStarter]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse15 (= 1 ~c_dr_pc~0))) (let ((.cse0 (= ~c_num_read~0 0)) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse1 (= ~q_free~0 0)) (.cse9 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse13 (not .cse15)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~p_dw_pc~0))) (or (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (and .cse0 .cse1 .cse2 (= 1 ~p_num_write~0) .cse3 .cse4) (not (= |old(~q_free~0)| 1)) (and .cse5 .cse6 .cse7 .cse8 .cse3 .cse4) (= 1 |old(~c_dr_pc~0)|) (and .cse9 .cse7 .cse8 .cse3 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse7 .cse3 .cse0 .cse10 .cse11 .cse12) (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse1 (<= .cse14 ~p_num_write~0) .cse2 (<= ~p_num_write~0 .cse14) .cse15 .cse3 .cse4)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse13 .cse9 .cse10 .cse7 .cse16 .cse3) (not (= 0 |old(~p_num_write~0)|)) (and .cse13 (not (= ~p_dw_st~0 1)) .cse16 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse8 .cse3 .cse4) (not (= |old(~p_dw_st~0)| 0))))) [2018-12-02 14:22:17,837 INFO L444 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) (and (not (= 1 ~c_dr_pc~0)) (= ~q_free~0 1) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-12-02 14:22:17,837 INFO L451 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2018-12-02 14:22:17,837 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 14:22:17,837 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~p_dw_pc~0 2)) (= ~c_num_read~0 0) (not (= 1 ~c_dr_pc~0)) (= ~q_free~0 0) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) [2018-12-02 14:22:17,837 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 14:22:17,838 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 14:22:17,838 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-12-02 14:22:17,838 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2018-12-02 14:22:17,838 INFO L448 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2018-12-02 14:22:17,838 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2018-12-02 14:22:17,838 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2018-12-02 14:22:17,838 INFO L444 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (= ~p_dw_st~0 0)) (.cse4 (= ~p_dw_pc~0 2)) (.cse5 (not (= ~q_free~0 0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse6 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse1 (= 1 ~c_dr_pc~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse8 (= ~p_dw_st~0 2)) (.cse9 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse4 .cse5 (not (= 2 ~c_dr_st~0)) .cse7 .cse8 .cse9 .cse10 .cse6) (or .cse6 .cse1 .cse2 .cse3 (= 0 ~c_dr_st~0) .cse8 .cse9))) [2018-12-02 14:22:17,838 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2018-12-02 14:22:17,838 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2018-12-02 14:22:17,838 INFO L444 ceAbstractionStarter]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse18 (= ~p_dw_pc~0 1))) (let ((.cse4 (not .cse18)) (.cse12 (not (= |old(~q_free~0)| 0))) (.cse13 (<= 2 ~p_dw_st~0)) (.cse15 (< |old(~p_dw_st~0)| 2)) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse9 (= 1 ~c_dr_pc~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= 0 |old(~c_dr_st~0)|)) (.cse17 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse5 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) (or .cse1 .cse2 (not .cse3) .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 (and .cse5 .cse6 .cse13 .cse8 .cse9 .cse10 .cse11) (< .cse0 ~p_num_write~0) .cse14 .cse15)) (let ((.cse16 (= ~c_num_read~0 1))) (or .cse1 .cse2 .cse4 (and .cse6 .cse7 .cse8 .cse9 .cse16 .cse11) .cse12 .cse14 (not (= 1 ~p_num_write~0)) (and .cse6 .cse13 .cse8 .cse9 .cse16 .cse11) .cse17 .cse15)) (or .cse3 .cse1 .cse2 (= ~p_dw_pc~0 2) (and .cse6 .cse7 .cse8 .cse9 (= ~c_num_read~0 0) .cse11) .cse14 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse18 .cse17 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-12-02 14:22:17,838 INFO L448 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2018-12-02 14:22:17,838 INFO L444 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse4 (not .cse9)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse6 (< |old(~p_dw_st~0)| 2)) (.cse8 (= 1 |old(~c_dr_pc~0)|)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6) (let ((.cse7 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse7) (or .cse0 .cse1 (not .cse8) .cse4) .cse2 (< .cse7 ~p_num_write~0) .cse3 .cse6)) (or .cse8 .cse0 .cse1 (= ~p_dw_pc~0 2) .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse9 .cse5 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-12-02 14:22:17,838 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse11 (= ~q_free~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse20 (= ~p_dw_i~0 1))) (let ((.cse13 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (= ~c_num_read~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not .cse20)) (.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse5 (not .cse16)) (.cse2 (and .cse11 .cse12 .cse20 (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0))) (.cse3 (= 0 ~p_dw_st~0)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse10 (= 0 |old(~c_dr_st~0)|)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse14 (< |old(~p_dw_st~0)| 2))) (and (let ((.cse4 (= ~c_num_read~0 1))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4) .cse5 (and (not (= 1 ~c_dr_pc~0)) .cse6 .cse7 (= ~q_free~0 0) .cse8) .cse9 .cse10 (and .cse11 .cse6 .cse12 .cse4) (not (= 1 ~p_num_write~0)) .cse13 .cse14)) (or .cse15 .cse0 .cse1 (= ~p_dw_pc~0 2) .cse10 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse16 .cse13 (and .cse11 (= ~p_dw_st~0 0) .cse7 .cse12 .cse8) (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse17 (+ |old(~c_num_read~0)| 1)) (.cse18 (<= ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 ~c_num_read~0))) (or (< ~p_num_write~0 .cse17) (or .cse0 .cse1 (not .cse15) .cse5) (and .cse18 .cse19 .cse2 .cse3) .cse9 (< .cse17 ~p_num_write~0) .cse10 (and .cse18 .cse19 .cse11 .cse6 .cse12) .cse14))))) [2018-12-02 14:22:17,839 INFO L444 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse10 (= ~p_dw_pc~0 1))) (let ((.cse5 (not (= |old(~q_free~0)| 0))) (.cse4 (not .cse10)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse9 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) (or .cse1 .cse2 (not .cse3) .cse4) .cse5 (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) (<= 2 ~p_dw_st~0) (= 1 ~c_dr_pc~0) (= ~q_free~0 0) (<= ~p_num_write~0 .cse6) (not (= ~c_dr_st~0 0)))) (< .cse0 ~p_num_write~0) .cse7 .cse8)) (or .cse3 .cse1 .cse2 .cse5 .cse7 .cse4 (not (= 1 ~p_num_write~0)) .cse9 .cse8) (or .cse3 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse7 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse10 .cse9 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-12-02 14:22:17,839 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2018-12-02 14:22:17,839 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2018-12-02 14:22:17,839 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse8 (= 1 ~c_dr_pc~0)) (.cse16 (= ~p_dw_pc~0 1))) (let ((.cse5 (not (= |old(~q_free~0)| 0))) (.cse4 (not .cse16)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse9 (= ~q_free~0 0)) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse13 (not .cse8)) (.cse14 (= ~c_num_read~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse15 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) (or .cse1 .cse2 (not .cse3) .cse4) .cse5 (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse7 .cse8 .cse9 (<= ~p_num_write~0 .cse6) .cse10)) (< .cse0 ~p_num_write~0) .cse11 .cse12)) (or .cse3 .cse1 .cse2 .cse5 .cse11 .cse4 (not (= 1 ~p_num_write~0)) (and .cse13 .cse7 .cse14 .cse9 .cse10) .cse15 .cse12) (or .cse3 .cse1 .cse2 (and .cse13 (= ~q_free~0 1) (= ~p_dw_st~0 0) .cse14 (= ~c_last_read~0 ~p_last_write~0) .cse10) (= ~p_dw_pc~0 2) .cse11 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse16 .cse15 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-12-02 14:22:17,839 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2018-12-02 14:22:17,839 INFO L444 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse4 (not .cse9)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse6 (< |old(~p_dw_st~0)| 2)) (.cse8 (= 1 |old(~c_dr_pc~0)|)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6) (let ((.cse7 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse7) (or .cse0 .cse1 (not .cse8) .cse4) .cse2 (< .cse7 ~p_num_write~0) .cse3 .cse6)) (or .cse8 .cse0 .cse1 (= ~p_dw_pc~0 2) .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse9 .cse5 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-12-02 14:22:17,839 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2018-12-02 14:22:17,839 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2018-12-02 14:22:17,839 INFO L444 ceAbstractionStarter]: At program point L169(line 169) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1))) (let ((.cse5 (not .cse14)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse7 (= ~q_free~0 1)) (.cse8 (<= 2 ~p_dw_st~0)) (.cse6 (= 1 ~c_dr_pc~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse11 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0)) (and (not .cse6) .cse7 .cse8 (= ~c_num_read~0 1) .cse9 .cse10) .cse11 .cse12) (let ((.cse13 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse13) (or .cse1 .cse2 (not .cse0) .cse5) .cse3 (< .cse13 ~p_num_write~0) .cse4 (and (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse6 (<= ~c_num_read~0 ~p_num_write~0) .cse9 .cse10) .cse12)) (or .cse0 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse4 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse14 .cse11 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-12-02 14:22:17,839 INFO L448 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-12-02 14:22:17,839 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2018-12-02 14:22:17,839 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2018-12-02 14:22:17,839 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= 1 ~c_dr_pc~0)) (not (= ~p_dw_i~0 1)) (= ~c_num_read~0 0) (= ~q_free~0 0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= ~q_buf_0~0 ~p_last_write~0)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (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 (= ~c_last_read~0 ~p_last_write~0))) [2018-12-02 14:22:17,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:22:17 BoogieIcfgContainer [2018-12-02 14:22:17,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:22:17,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:22:17,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:22:17,877 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:22:17,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:21:59" (3/4) ... [2018-12-02 14:22:17,881 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 14:22:17,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-02 14:22:17,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-02 14:22:17,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 14:22:17,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-12-02 14:22:17,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-02 14:22:17,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2018-12-02 14:22:17,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 14:22:17,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-02 14:22:17,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-02 14:22:17,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-12-02 14:22:17,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-02 14:22:17,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-12-02 14:22:17,888 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-12-02 14:22:17,888 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-02 14:22:17,893 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-02 14:22:17,893 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 14:22:17,917 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || (((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || ((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0) [2018-12-02 14:22:17,917 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2)) && (((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((((((((!(p_dw_i == 1) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == 2) || ((((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(c_dr_st))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 1)) && ((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < \old(c_num_read)) || !(2 == \old(c_dr_st))) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) || !(2 == \old(c_dr_st))) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 1) [2018-12-02 14:22:17,917 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2)) && (((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((((((((!(p_dw_i == 1) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == 2) || ((((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(c_dr_st))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 1)) && ((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < \old(c_num_read)) || !(2 == \old(c_dr_st))) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) || !(2 == \old(c_dr_st))) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 1) [2018-12-02 14:22:17,918 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write))) && ((\old(p_dw_st) == 0 || (((q_free == 0 && (!(p_dw_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_st) == 2)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || (((((((q_free == 1 && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(c_last_read == \old(p_last_write))) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || \old(p_dw_st) == 2) || ((((((q_free == 1 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) [2018-12-02 14:22:17,918 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((\old(p_dw_st) == 0 || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write))) [2018-12-02 14:22:17,918 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_st) == 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || ((((!(p_dw_st == 0) && !(p_dw_st == 2)) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((\old(p_dw_st) == 0 || ((!(p_dw_st == 0) && p_num_write == \old(p_num_write) && (!(p_dw_st == 2) && 2 == c_dr_st) && p_last_write == q_buf_0) && \old(p_dw_pc) == p_dw_pc)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((!(p_dw_st == 0) && !(p_dw_st == 2)) && 2 == c_dr_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) [2018-12-02 14:22:17,918 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || ((((((q_free == 1 && c_last_read == p_last_write) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == p_dw_st) && c_num_read == 1)) || !(p_dw_pc == 1)) || ((((!(1 == c_dr_pc) && 2 <= p_dw_st) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || (((q_free == 1 && 2 <= p_dw_st) && c_last_read == p_last_write) && c_num_read == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || ((((q_free == 1 && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write))) && (((((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((q_free == 1 && c_last_read == p_last_write) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == p_dw_st)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write)) || \old(p_dw_st) < 2) [2018-12-02 14:22:17,918 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || ((((((p_num_write <= c_num_read && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || ((((((p_num_write <= c_num_read && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(p_dw_pc == 1)) || (((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 1) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || (((((q_free == 1 && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 1) && c_last_read == p_last_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || (((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 0) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) [2018-12-02 14:22:17,918 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || (((((c_num_read + 1 <= p_num_write && 2 <= p_dw_st) && 1 == c_dr_pc) && q_free == 0) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2) && ((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) [2018-12-02 14:22:17,943 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_42845bf4-524e-4ffb-bc24-a00037901dfd/bin-2019/uautomizer/witness.graphml [2018-12-02 14:22:17,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:22:17,944 INFO L168 Benchmark]: Toolchain (without parser) took 18888.70 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 635.4 MB). Free memory was 962.4 MB in the beginning and 922.2 MB in the end (delta: 40.3 MB). Peak memory consumption was 675.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:22:17,944 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:22:17,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.90 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:22:17,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.04 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:22:17,945 INFO L168 Benchmark]: Boogie Preprocessor took 45.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:22:17,945 INFO L168 Benchmark]: RCFGBuilder took 226.96 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-02 14:22:17,945 INFO L168 Benchmark]: TraceAbstraction took 18388.46 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 511.2 MB). Free memory was 1.1 GB in the beginning and 938.7 MB in the end (delta: 151.8 MB). Peak memory consumption was 823.0 MB. Max. memory is 11.5 GB. [2018-12-02 14:22:17,946 INFO L168 Benchmark]: Witness Printer took 66.54 ms. Allocated memory is still 1.7 GB. Free memory was 938.7 MB in the beginning and 922.2 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2018-12-02 14:22:17,947 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.90 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 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.04 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 226.96 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18388.46 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 511.2 MB). Free memory was 1.1 GB in the beginning and 938.7 MB in the end (delta: 151.8 MB). Peak memory consumption was 823.0 MB. Max. memory is 11.5 GB. * Witness Printer took 66.54 ms. Allocated memory is still 1.7 GB. Free memory was 938.7 MB in the beginning and 922.2 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2)) && (((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((((((((!(p_dw_i == 1) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == 2) || ((((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(c_dr_st))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 1)) && ((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < \old(c_num_read)) || !(2 == \old(c_dr_st))) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) || !(2 == \old(c_dr_st))) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || (((((c_num_read + 1 <= p_num_write && 2 <= p_dw_st) && 1 == c_dr_pc) && q_free == 0) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2) && ((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write))) && ((\old(p_dw_st) == 0 || (((q_free == 0 && (!(p_dw_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_st) == 2)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || (((((((q_free == 1 && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(c_last_read == \old(p_last_write))) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || \old(p_dw_st) == 2) || ((((((q_free == 1 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || ((((((q_free == 1 && c_last_read == p_last_write) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == p_dw_st) && c_num_read == 1)) || !(p_dw_pc == 1)) || ((((!(1 == c_dr_pc) && 2 <= p_dw_st) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || (((q_free == 1 && 2 <= p_dw_st) && c_last_read == p_last_write) && c_num_read == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || ((((q_free == 1 && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write))) && (((((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((q_free == 1 && c_last_read == p_last_write) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == p_dw_st)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write)) || \old(p_dw_st) < 2) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((p_dw_st == 0 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) && ((((((((((p_dw_st == 0 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) || 0 == __retres1)) && ((((((0 == __retres1 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_st == 2) || p_dw_pc == 1) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || (((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || ((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2)) && (((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((((((((!(p_dw_i == 1) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == 2) || ((((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(c_dr_st))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 1)) && ((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < \old(c_num_read)) || !(2 == \old(c_dr_st))) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) || !(2 == \old(c_dr_st))) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 1) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((\old(p_dw_st) == 0 || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((1 == c_dr_pc || 0 == __retres1) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_st == 2) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || 0 == __retres1) || !(p_dw_pc == 1)) || !(q_free == 1)) || 1 == c_dr_pc) || 0 == c_dr_st) || !(1 == p_num_write)) || !(1 == c_num_read)) || !(c_last_read == p_last_write))) && ((((((((((p_dw_st == 0 || 1 == c_dr_pc) || 0 == __retres1) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || ((((((p_num_write <= c_num_read && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || ((((((p_num_write <= c_num_read && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(p_dw_pc == 1)) || (((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 1) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || (((((q_free == 1 && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 1) && c_last_read == p_last_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || (((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 0) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_st) == 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || ((((!(p_dw_st == 0) && !(p_dw_st == 2)) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((\old(p_dw_st) == 0 || ((!(p_dw_st == 0) && p_num_write == \old(p_num_write) && (!(p_dw_st == 2) && 2 == c_dr_st) && p_last_write == q_buf_0) && \old(p_dw_pc) == p_dw_pc)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((!(p_dw_st == 0) && !(p_dw_st == 2)) && 2 == c_dr_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. SAFE Result, 18.3s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 13.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 2262 SDtfs, 3569 SDslu, 3233 SDs, 0 SdLazy, 2630 SolverSat, 1147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 373 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2512occurred in iteration=10, 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: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 534 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3323 PreInvPairs, 4585 NumberOfFragments, 10462 HoareAnnotationTreeSize, 3323 FomulaSimplifications, 76087 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 45 FomulaSimplificationsInter, 43384 FormulaSimplificationTreeSizeReductionInter, 12.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1296 ConstructedInterpolants, 0 QuantifiedInterpolants, 239106 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1919 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 279/320 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...