./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/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_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/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-0cd3be1 [2018-11-28 11:28:35,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:28:35,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:28:35,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:28:35,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:28:35,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:28:35,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:28:35,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:28:35,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:28:35,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:28:35,926 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:28:35,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:28:35,927 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:28:35,928 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:28:35,929 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:28:35,929 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:28:35,930 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:28:35,931 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:28:35,932 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:28:35,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:28:35,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:28:35,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:28:35,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:28:35,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:28:35,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:28:35,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:28:35,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:28:35,938 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:28:35,939 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:28:35,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:28:35,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:28:35,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:28:35,940 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:28:35,940 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:28:35,941 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:28:35,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:28:35,942 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:28:35,949 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:28:35,949 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:28:35,950 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:28:35,950 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:28:35,951 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:28:35,951 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:28:35,951 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:28:35,951 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:28:35,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:28:35,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:28:35,951 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:28:35,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:28:35,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:28:35,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:28:35,952 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:28:35,952 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:28:35,952 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:28:35,953 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:28:35,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:28:35,953 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:28:35,953 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:28:35,953 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:28:35,953 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:28:35,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:28:35,954 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:28:35,954 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:28:35,954 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:28:35,954 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:28:35,954 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:28:35,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:28:35,955 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_35770949-53d3-48fc-9940-b4b0daf9006a/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-11-28 11:28:35,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:28:35,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:28:35,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:28:35,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:28:35,989 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:28:35,989 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-28 11:28:36,025 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/data/1d00f51a0/a439edfa3c0849339cd5a0f16daca83d/FLAG7cacee9e8 [2018-11-28 11:28:36,422 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:28:36,423 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-28 11:28:36,427 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/data/1d00f51a0/a439edfa3c0849339cd5a0f16daca83d/FLAG7cacee9e8 [2018-11-28 11:28:36,437 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/data/1d00f51a0/a439edfa3c0849339cd5a0f16daca83d [2018-11-28 11:28:36,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:28:36,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:28:36,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:28:36,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:28:36,442 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:28:36,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c1b638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36, skipping insertion in model container [2018-11-28 11:28:36,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:28:36,465 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:28:36,582 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:28:36,585 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:28:36,609 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:28:36,619 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:28:36,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36 WrapperNode [2018-11-28 11:28:36,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:28:36,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:28:36,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:28:36,620 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:28:36,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:28:36,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:28:36,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:28:36,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:28:36,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (1/1) ... [2018-11-28 11:28:36,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:28:36,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:28:36,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:28:36,692 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:28:36,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:28:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-28 11:28:36,728 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-28 11:28:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-28 11:28:36,728 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-28 11:28:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:28:36,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:28:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-28 11:28:36,729 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-28 11:28:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-28 11:28:36,729 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-28 11:28:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2018-11-28 11:28:36,729 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2018-11-28 11:28:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:28:36,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:28:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-28 11:28:36,730 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-28 11:28:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-28 11:28:36,730 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-28 11:28:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-28 11:28:36,730 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-28 11:28:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-28 11:28:36,730 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-28 11:28:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:28:36,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:28:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-28 11:28:36,731 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-28 11:28:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-28 11:28:36,731 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-28 11:28:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-28 11:28:36,731 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-28 11:28:36,999 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:28:37,000 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 11:28:37,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:28:37 BoogieIcfgContainer [2018-11-28 11:28:37,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:28:37,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:28:37,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:28:37,004 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:28:37,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:28:36" (1/3) ... [2018-11-28 11:28:37,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8edf799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:28:37, skipping insertion in model container [2018-11-28 11:28:37,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:36" (2/3) ... [2018-11-28 11:28:37,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8edf799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:28:37, skipping insertion in model container [2018-11-28 11:28:37,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:28:37" (3/3) ... [2018-11-28 11:28:37,006 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-28 11:28:37,015 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:28:37,021 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:28:37,035 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:28:37,061 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:28:37,062 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:28:37,062 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:28:37,062 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:28:37,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:28:37,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:28:37,062 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:28:37,062 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:28:37,063 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:28:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-11-28 11:28:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 11:28:37,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:37,085 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-11-28 11:28:37,086 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:37,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:37,090 INFO L82 PathProgramCache]: Analyzing trace with hash 489843548, now seen corresponding path program 1 times [2018-11-28 11:28:37,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:37,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:37,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:37,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:28:37,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:37,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:37,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:37,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:37,282 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2018-11-28 11:28:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:37,342 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2018-11-28 11:28:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:37,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-28 11:28:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:37,354 INFO L225 Difference]: With dead ends: 279 [2018-11-28 11:28:37,354 INFO L226 Difference]: Without dead ends: 175 [2018-11-28 11:28:37,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-28 11:28:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-11-28 11:28:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-28 11:28:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-11-28 11:28:37,397 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2018-11-28 11:28:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:37,398 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-11-28 11:28:37,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-11-28 11:28:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 11:28:37,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:37,401 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-11-28 11:28:37,401 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:37,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash 343031424, now seen corresponding path program 1 times [2018-11-28 11:28:37,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:37,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:37,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:37,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:37,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:28:37,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:37,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:28:37,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:28:37,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:28:37,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:28:37,497 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 4 states. [2018-11-28 11:28:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:37,671 INFO L93 Difference]: Finished difference Result 469 states and 653 transitions. [2018-11-28 11:28:37,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:28:37,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 11:28:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:37,674 INFO L225 Difference]: With dead ends: 469 [2018-11-28 11:28:37,674 INFO L226 Difference]: Without dead ends: 318 [2018-11-28 11:28:37,676 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-11-28 11:28:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-28 11:28:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2018-11-28 11:28:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-28 11:28:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 411 transitions. [2018-11-28 11:28:37,702 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 411 transitions. Word has length 66 [2018-11-28 11:28:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:37,702 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 411 transitions. [2018-11-28 11:28:37,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:28:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 411 transitions. [2018-11-28 11:28:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 11:28:37,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:37,705 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-11-28 11:28:37,705 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:37,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1783380965, now seen corresponding path program 1 times [2018-11-28 11:28:37,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:37,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:37,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:28:37,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:37,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:28:37,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:28:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:28:37,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:28:37,760 INFO L87 Difference]: Start difference. First operand 314 states and 411 transitions. Second operand 4 states. [2018-11-28 11:28:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:37,836 INFO L93 Difference]: Finished difference Result 565 states and 734 transitions. [2018-11-28 11:28:37,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:28:37,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 11:28:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:37,839 INFO L225 Difference]: With dead ends: 565 [2018-11-28 11:28:37,839 INFO L226 Difference]: Without dead ends: 268 [2018-11-28 11:28:37,841 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-11-28 11:28:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-28 11:28:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-11-28 11:28:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-28 11:28:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 341 transitions. [2018-11-28 11:28:37,862 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 341 transitions. Word has length 66 [2018-11-28 11:28:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:37,863 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 341 transitions. [2018-11-28 11:28:37,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:28:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 341 transitions. [2018-11-28 11:28:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 11:28:37,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:37,865 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-11-28 11:28:37,865 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:37,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash 229644767, now seen corresponding path program 1 times [2018-11-28 11:28:37,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:37,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:37,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:37,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:28:37,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:37,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:28:37,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:28:37,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:28:37,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:28:37,949 INFO L87 Difference]: Start difference. First operand 268 states and 341 transitions. Second operand 6 states. [2018-11-28 11:28:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:37,998 INFO L93 Difference]: Finished difference Result 529 states and 694 transitions. [2018-11-28 11:28:37,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:28:37,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 11:28:37,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:38,001 INFO L225 Difference]: With dead ends: 529 [2018-11-28 11:28:38,001 INFO L226 Difference]: Without dead ends: 278 [2018-11-28 11:28:38,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:28:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-28 11:28:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-11-28 11:28:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-28 11:28:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 349 transitions. [2018-11-28 11:28:38,021 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 349 transitions. Word has length 66 [2018-11-28 11:28:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:38,021 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 349 transitions. [2018-11-28 11:28:38,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:28:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 349 transitions. [2018-11-28 11:28:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 11:28:38,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:38,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-11-28 11:28:38,023 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:38,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash -791423587, now seen corresponding path program 1 times [2018-11-28 11:28:38,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:38,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:38,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:38,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:38,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:28:38,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:38,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:28:38,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:28:38,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:28:38,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:28:38,102 INFO L87 Difference]: Start difference. First operand 278 states and 349 transitions. Second operand 6 states. [2018-11-28 11:28:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:38,492 INFO L93 Difference]: Finished difference Result 850 states and 1130 transitions. [2018-11-28 11:28:38,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:28:38,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 11:28:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:38,495 INFO L225 Difference]: With dead ends: 850 [2018-11-28 11:28:38,495 INFO L226 Difference]: Without dead ends: 589 [2018-11-28 11:28:38,496 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-11-28 11:28:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-11-28 11:28:38,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 577. [2018-11-28 11:28:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-11-28 11:28:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2018-11-28 11:28:38,524 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 66 [2018-11-28 11:28:38,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:38,525 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2018-11-28 11:28:38,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:28:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2018-11-28 11:28:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 11:28:38,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:38,527 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-11-28 11:28:38,527 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:38,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:38,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2070748322, now seen corresponding path program 1 times [2018-11-28 11:28:38,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:38,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:38,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:38,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:38,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:28:38,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:38,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:28:38,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:28:38,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:28:38,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:28:38,580 INFO L87 Difference]: Start difference. First operand 577 states and 713 transitions. Second operand 6 states. [2018-11-28 11:28:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:38,633 INFO L93 Difference]: Finished difference Result 1140 states and 1459 transitions. [2018-11-28 11:28:38,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:28:38,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 11:28:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:38,638 INFO L225 Difference]: With dead ends: 1140 [2018-11-28 11:28:38,638 INFO L226 Difference]: Without dead ends: 616 [2018-11-28 11:28:38,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:28:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-11-28 11:28:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2018-11-28 11:28:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-11-28 11:28:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 735 transitions. [2018-11-28 11:28:38,663 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 735 transitions. Word has length 66 [2018-11-28 11:28:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:38,663 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 735 transitions. [2018-11-28 11:28:38,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:28:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 735 transitions. [2018-11-28 11:28:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 11:28:38,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:38,665 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-11-28 11:28:38,665 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:38,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:38,665 INFO L82 PathProgramCache]: Analyzing trace with hash -295740960, now seen corresponding path program 1 times [2018-11-28 11:28:38,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:38,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:38,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:38,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:28:38,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:38,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:28:38,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:28:38,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:28:38,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:28:38,725 INFO L87 Difference]: Start difference. First operand 604 states and 735 transitions. Second operand 4 states. [2018-11-28 11:28:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:38,809 INFO L93 Difference]: Finished difference Result 842 states and 1059 transitions. [2018-11-28 11:28:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:28:38,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 11:28:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:38,811 INFO L225 Difference]: With dead ends: 842 [2018-11-28 11:28:38,812 INFO L226 Difference]: Without dead ends: 839 [2018-11-28 11:28:38,812 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-11-28 11:28:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-11-28 11:28:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 675. [2018-11-28 11:28:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-11-28 11:28:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 829 transitions. [2018-11-28 11:28:38,840 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 829 transitions. Word has length 66 [2018-11-28 11:28:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:38,841 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 829 transitions. [2018-11-28 11:28:38,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:28:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 829 transitions. [2018-11-28 11:28:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 11:28:38,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:38,842 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-11-28 11:28:38,842 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:38,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash -578339491, now seen corresponding path program 1 times [2018-11-28 11:28:38,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:38,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:38,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:38,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:38,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:28:38,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:38,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:38,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:38,893 INFO L87 Difference]: Start difference. First operand 675 states and 829 transitions. Second operand 3 states. [2018-11-28 11:28:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:38,928 INFO L93 Difference]: Finished difference Result 1249 states and 1576 transitions. [2018-11-28 11:28:38,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:38,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-11-28 11:28:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:38,931 INFO L225 Difference]: With dead ends: 1249 [2018-11-28 11:28:38,931 INFO L226 Difference]: Without dead ends: 655 [2018-11-28 11:28:38,933 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-11-28 11:28:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-11-28 11:28:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 567. [2018-11-28 11:28:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-11-28 11:28:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 677 transitions. [2018-11-28 11:28:38,957 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 677 transitions. Word has length 67 [2018-11-28 11:28:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:38,957 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 677 transitions. [2018-11-28 11:28:38,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 677 transitions. [2018-11-28 11:28:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 11:28:38,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:38,959 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-11-28 11:28:38,959 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:38,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:38,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1082734469, now seen corresponding path program 1 times [2018-11-28 11:28:38,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:38,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:38,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:38,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:38,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:28:39,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:39,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:28:39,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:39,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:28:39,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:28:39,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-28 11:28:39,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:28:39,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:28:39,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:28:39,135 INFO L87 Difference]: Start difference. First operand 567 states and 677 transitions. Second operand 7 states. [2018-11-28 11:28:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:39,392 INFO L93 Difference]: Finished difference Result 1850 states and 2333 transitions. [2018-11-28 11:28:39,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:28:39,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-11-28 11:28:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:39,396 INFO L225 Difference]: With dead ends: 1850 [2018-11-28 11:28:39,396 INFO L226 Difference]: Without dead ends: 930 [2018-11-28 11:28:39,398 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-11-28 11:28:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-11-28 11:28:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 759. [2018-11-28 11:28:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-28 11:28:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 948 transitions. [2018-11-28 11:28:39,435 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 948 transitions. Word has length 87 [2018-11-28 11:28:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:39,435 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 948 transitions. [2018-11-28 11:28:39,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:28:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 948 transitions. [2018-11-28 11:28:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 11:28:39,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:39,438 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-11-28 11:28:39,438 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:39,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:39,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1369387122, now seen corresponding path program 1 times [2018-11-28 11:28:39,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:39,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:39,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:39,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:39,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 11:28:39,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:39,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:28:39,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:39,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:28:39,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:28:39,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-11-28 11:28:39,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:28:39,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:28:39,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:28:39,691 INFO L87 Difference]: Start difference. First operand 759 states and 948 transitions. Second operand 12 states. [2018-11-28 11:28:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:40,715 INFO L93 Difference]: Finished difference Result 2594 states and 4274 transitions. [2018-11-28 11:28:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 11:28:40,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-11-28 11:28:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:40,725 INFO L225 Difference]: With dead ends: 2594 [2018-11-28 11:28:40,725 INFO L226 Difference]: Without dead ends: 2591 [2018-11-28 11:28:40,727 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-11-28 11:28:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2018-11-28 11:28:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2512. [2018-11-28 11:28:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2018-11-28 11:28:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 4092 transitions. [2018-11-28 11:28:40,873 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 4092 transitions. Word has length 99 [2018-11-28 11:28:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:40,873 INFO L480 AbstractCegarLoop]: Abstraction has 2512 states and 4092 transitions. [2018-11-28 11:28:40,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:28:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 4092 transitions. [2018-11-28 11:28:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-28 11:28:40,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:40,876 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-11-28 11:28:40,876 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:40,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash 509314117, now seen corresponding path program 2 times [2018-11-28 11:28:40,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:40,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:40,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:40,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-28 11:28:40,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:40,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:40,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:40,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:40,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:40,909 INFO L87 Difference]: Start difference. First operand 2512 states and 4092 transitions. Second operand 3 states. [2018-11-28 11:28:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:41,053 INFO L93 Difference]: Finished difference Result 4236 states and 7499 transitions. [2018-11-28 11:28:41,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:41,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-11-28 11:28:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:41,063 INFO L225 Difference]: With dead ends: 4236 [2018-11-28 11:28:41,063 INFO L226 Difference]: Without dead ends: 2365 [2018-11-28 11:28:41,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2018-11-28 11:28:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2365. [2018-11-28 11:28:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2018-11-28 11:28:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3821 transitions. [2018-11-28 11:28:41,229 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3821 transitions. Word has length 125 [2018-11-28 11:28:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:41,229 INFO L480 AbstractCegarLoop]: Abstraction has 2365 states and 3821 transitions. [2018-11-28 11:28:41,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:41,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3821 transitions. [2018-11-28 11:28:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-28 11:28:41,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:41,233 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:28:41,233 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:41,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:41,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1052041084, now seen corresponding path program 1 times [2018-11-28 11:28:41,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:41,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:41,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:41,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:28:41,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-28 11:28:41,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:41,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:28:41,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:41,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-28 11:28:41,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:28:41,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-11-28 11:28:41,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:28:41,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:28:41,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:28:41,450 INFO L87 Difference]: Start difference. First operand 2365 states and 3821 transitions. Second operand 12 states. [2018-11-28 11:28:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:41,652 INFO L93 Difference]: Finished difference Result 4557 states and 7151 transitions. [2018-11-28 11:28:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:28:41,653 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 175 [2018-11-28 11:28:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:41,660 INFO L225 Difference]: With dead ends: 4557 [2018-11-28 11:28:41,660 INFO L226 Difference]: Without dead ends: 2209 [2018-11-28 11:28:41,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:28:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2018-11-28 11:28:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1824. [2018-11-28 11:28:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-11-28 11:28:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2351 transitions. [2018-11-28 11:28:41,763 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2351 transitions. Word has length 175 [2018-11-28 11:28:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:41,764 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2351 transitions. [2018-11-28 11:28:41,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:28:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2351 transitions. [2018-11-28 11:28:41,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-28 11:28:41,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:41,766 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-11-28 11:28:41,766 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:41,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:41,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1972759988, now seen corresponding path program 1 times [2018-11-28 11:28:41,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:41,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:41,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:41,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:41,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 11:28:41,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:41,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:28:41,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:41,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 11:28:41,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:28:41,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-28 11:28:41,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:28:41,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:28:41,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:28:41,968 INFO L87 Difference]: Start difference. First operand 1824 states and 2351 transitions. Second operand 9 states. [2018-11-28 11:28:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:42,459 INFO L93 Difference]: Finished difference Result 2162 states and 2792 transitions. [2018-11-28 11:28:42,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:28:42,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2018-11-28 11:28:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:42,461 INFO L225 Difference]: With dead ends: 2162 [2018-11-28 11:28:42,461 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:28:42,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:28:42,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:28:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:28:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:28:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:28:42,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2018-11-28 11:28:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:42,469 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:28:42,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:28:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:28:42,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:28:42,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 11:28:42,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:42,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:42,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:42,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:42,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:42,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:43,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:43,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:43,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:43,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:43,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:43,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:43,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:43,796 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 1 [2018-11-28 11:28:44,051 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2018-11-28 11:28:44,371 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2018-11-28 11:28:44,565 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2018-11-28 11:28:45,110 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2018-11-28 11:28:45,628 WARN L180 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2018-11-28 11:28:45,965 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2018-11-28 11:28:46,299 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2018-11-28 11:28:46,419 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 38 [2018-11-28 11:28:46,543 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2018-11-28 11:28:47,266 WARN L180 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 115 [2018-11-28 11:28:47,631 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2018-11-28 11:28:47,881 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-11-28 11:28:48,273 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 63 [2018-11-28 11:28:48,829 WARN L180 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 98 [2018-11-28 11:28:49,188 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2018-11-28 11:28:49,401 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 95 [2018-11-28 11:28:49,773 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 86 [2018-11-28 11:28:50,098 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-11-28 11:28:50,780 WARN L180 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 115 [2018-11-28 11:28:50,895 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2018-11-28 11:28:51,083 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2018-11-28 11:28:51,276 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 44 [2018-11-28 11:28:51,681 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 101 [2018-11-28 11:28:52,003 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2018-11-28 11:28:52,304 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2018-11-28 11:28:52,307 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2018-11-28 11:28:52,307 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-11-28 11:28:52,307 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2018-11-28 11:28:52,307 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2018-11-28 11:28:52,307 INFO L444 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse10 (= 1 ~c_dr_pc~0))) (let ((.cse2 (not (= ~q_free~0 1))) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse4 (not (= 0 ~p_num_write~0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse14 (not (= ~q_free~0 0))) (.cse8 (not (= 0 ~c_num_read~0))) (.cse15 (not (= ~c_dr_st~0 0))) (.cse16 (< ~p_dw_st~0 2)) (.cse6 (= 1 exists_runnable_thread_~__retres1~2)) (.cse5 (not (= 2 ~c_dr_st~0))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse12 (not .cse10)) (.cse13 (not (= ~p_dw_pc~0 1))) (.cse7 (not (= ~p_dw_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse3 .cse4 .cse9) (let ((.cse11 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse11) (or .cse0 .cse1 .cse12 .cse13) .cse14 .cse15 (< .cse11 ~p_num_write~0) .cse6 .cse16)) (or .cse6 .cse0 .cse1 .cse14 .cse13 (not (= 1 ~p_num_write~0)) .cse8 .cse15 .cse16) (or (< ~p_num_write~0 ~c_num_read~0) .cse6 .cse5 (or .cse0 .cse1 .cse12 .cse13 .cse7) (< ~c_num_read~0 ~p_num_write~0))))) [2018-11-28 11:28:52,307 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2018-11-28 11:28:52,307 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2018-11-28 11:28:52,307 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2018-11-28 11:28:52,308 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (= ~p_dw_st~0 0) (= 1 ~c_dr_pc~0) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= ~p_dw_i~0 1)) (not (= ~q_free~0 1)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 ~c_num_read~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2018-11-28 11:28:52,308 INFO L448 ceAbstractionStarter]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2018-11-28 11:28:52,308 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) (not (= |old(~q_free~0)| 0)) (and (not (= 1 ~c_dr_pc~0)) (= ~p_dw_pc~0 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) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 11:28:52,308 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 349 360) 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) (not (= |old(~q_free~0)| 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(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 11:28:52,308 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2018-11-28 11:28:52,308 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2018-11-28 11:28:52,308 INFO L448 ceAbstractionStarter]: For program point L355(line 355) no Hoare annotation was computed. [2018-11-28 11:28:52,308 INFO L444 ceAbstractionStarter]: At program point L354(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) (not (= |old(~q_free~0)| 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(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 11:28:52,309 INFO L444 ceAbstractionStarter]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse11 (= 1 ~c_dr_pc~0)) (.cse23 (= ~p_dw_i~0 1))) (let ((.cse1 (= ~q_free~0 0)) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not .cse23)) (.cse8 (not (= |old(~p_dw_pc~0)| 1))) (.cse7 (not .cse11)) (.cse22 (not (= ~p_dw_st~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~p_dw_pc~0))) (let ((.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse14 (and .cse7 .cse22 (not (= ~c_dr_st~0 0)) .cse23 .cse2 .cse4)) (.cse20 (or .cse11 .cse5 .cse6 .cse8)) (.cse9 (not (= 2 |old(~c_dr_st~0)|))) (.cse21 (and .cse7 .cse22 (= 2 ~c_dr_st~0) .cse23 .cse2 .cse4)) (.cse13 (not (= |old(~q_free~0)| 1))) (.cse17 (not (= |old(~p_dw_pc~0)| 0))) (.cse18 (not (= 0 |old(~p_num_write~0)|))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse16 (and .cse1 (= 2 ~p_dw_st~0) (= 1 ~p_num_write~0) .cse2 .cse4)) (.cse10 (= |old(~p_dw_st~0)| 2)) (.cse19 (not (= 0 ~c_num_read~0))) (.cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 (let ((.cse3 (+ |old(~p_num_write~0)| 1))) (and .cse1 (<= 2 ~p_dw_st~0) .cse2 (<= .cse3 ~p_num_write~0) .cse4 (<= ~p_num_write~0 .cse3))) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse11 .cse5 .cse6 .cse12 .cse13 .cse10 .cse14 .cse15) (or .cse6 .cse5 .cse16 .cse13 .cse17 .cse18 .cse0 .cse9 .cse10 .cse19 .cse15) (or .cse20 .cse12 .cse10 .cse14) (or .cse20 .cse9 .cse10 .cse21) (or .cse11 .cse5 .cse6 .cse9 .cse13 .cse10 .cse21 .cse15) (or .cse5 .cse6 .cse13 .cse17 .cse18 .cse0 .cse11 .cse16 .cse10 .cse19 .cse15))))) [2018-11-28 11:28:52,309 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse23 (= |old(~p_dw_pc~0)| 1))) (let ((.cse10 (= 1 ~c_dr_pc~0)) (.cse4 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse5 (not (= ~p_dw_i~0 1))) (.cse20 (not .cse23))) (let ((.cse7 (not (= |old(~p_dw_pc~0)| 0))) (.cse8 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (= |old(~p_dw_st~0)| 0)) (.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse18 (not (= 0 ~c_num_read~0))) (.cse2 (= 2 ~c_dr_st~0)) (.cse13 (not (= ~p_dw_st~0 0))) (.cse16 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse17 (= 0 ~p_num_write~0)) (.cse0 (or .cse10 .cse4 .cse5 .cse20)) (.cse22 (= 0 |old(~c_dr_st~0)|)) (.cse11 (= ~q_free~0 1)) (.cse14 (not (= ~p_dw_st~0 2))) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (not (= ~c_dr_st~0 0))) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= |old(~q_free~0)| 1))) (.cse3 (= |old(~p_dw_st~0)| 2)) (.cse19 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse3 .cse18 .cse19) (or .cse9 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse4 .cse5 (not .cse10) .cse20) .cse1 .cse3 (< ~c_num_read~0 |old(~p_num_write~0)|)) (and (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse14 .cse2 .cse12) .cse13 .cse16)) (or .cse10 .cse2 .cse4 .cse5 .cse1 .cse6 .cse3 .cse19) (or .cse5 .cse4 .cse6 .cse7 .cse8 .cse9 .cse1 .cse3 .cse18 (and .cse11 .cse2 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse19) (or (and .cse14 .cse21 .cse12 (= 1 ~p_dw_pc~0)) .cse0 .cse22 .cse3) (or .cse10 .cse4 .cse5 .cse22 (and .cse11 .cse14 (not (= ~p_dw_pc~0 1)) .cse15 .cse21 .cse12) .cse6 .cse3 .cse23 .cse19))))) [2018-11-28 11:28:52,309 INFO L444 ceAbstractionStarter]: At program point L124(line 124) the Hoare annotation is: (let ((.cse15 (= |old(~p_dw_pc~0)| 1))) (let ((.cse3 (= 1 ~c_dr_pc~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (not .cse15))) (let ((.cse7 (= 2 ~c_dr_st~0)) (.cse9 (not (= ~p_dw_st~0 0))) (.cse10 (= ~q_free~0 0)) (.cse19 (= 1 ~p_num_write~0)) (.cse12 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse20 (not (= |old(~p_dw_pc~0)| 0))) (.cse21 (not (= 0 |old(~p_num_write~0)|))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse5 (not (= 2 |old(~c_dr_st~0)|))) (.cse22 (not (= 0 ~c_num_read~0))) (.cse17 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse11 (not (= ~p_dw_st~0 2))) (.cse16 (not (= ~c_dr_st~0 0))) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (or .cse3 .cse1 .cse2 .cse4)) (.cse13 (= 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 (not .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 .cse3 .cse1 .cse2 .cse13 .cse14 .cse6 .cse15 (and .cse11 (not (= ~p_dw_pc~0 1)) .cse16 .cse8) .cse17) (or .cse18 .cse5 .cse7 .cse6) (or (and .cse8 .cse9 .cse10 .cse11 .cse19 .cse12) .cse1 .cse2 .cse14 .cse20 .cse21 .cse0 .cse3 .cse6 .cse22 .cse17) (or .cse3 .cse1 .cse2 .cse5 .cse14 .cse7 .cse6 .cse17) (or .cse2 .cse1 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12) .cse14 .cse20 .cse21 .cse0 .cse5 .cse6 .cse22 .cse17) (or (and .cse11 .cse16 .cse8 (= 1 ~p_dw_pc~0)) .cse18 .cse13 .cse6))))) [2018-11-28 11:28:52,309 INFO L448 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-11-28 11:28:52,309 INFO L448 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2018-11-28 11:28:52,309 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2018-11-28 11:28:52,310 INFO L444 ceAbstractionStarter]: At program point L109(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))) (.cse21 (not .cse6))) (let ((.cse11 (not (= |old(~p_dw_pc~0)| 0))) (.cse14 (not (= ~p_dw_st~0 0))) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse16 (= 0 ~p_num_write~0)) (.cse12 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (= |old(~p_dw_st~0)| 0)) (.cse17 (not (= 0 ~c_num_read~0))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse20 (= 2 ~c_dr_st~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)) (.cse18 (or .cse0 .cse1 .cse2 .cse21)) (.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 .cse1 .cse2 .cse4 .cse11 .cse12 .cse13 .cse0 (and .cse14 .cse7 .cse15 .cse9 .cse16) .cse5 .cse17 .cse10) (or .cse18 .cse19 .cse20 .cse5) (or .cse13 (and .cse14 (and (= ~p_num_write~0 |old(~p_num_write~0)|) (and .cse7 .cse20 .cse9)) .cse15) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse2 (not .cse0) .cse21) .cse19 .cse5 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse2 .cse1 .cse4 .cse11 (and .cse20 .cse9 .cse14 .cse7 .cse15 .cse16) .cse12 .cse13 .cse19 .cse5 .cse17 .cse10) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse5 .cse10) (or (and .cse7 .cse8 .cse9 (= 1 ~p_dw_pc~0)) .cse18 .cse3 .cse5))))) [2018-11-28 11:28:52,310 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)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.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))) (let ((.cse4 (not (= |old(~q_free~0)| 1))) (.cse20 (not (= |old(~p_dw_pc~0)| 0))) (.cse21 (not (= 0 |old(~p_num_write~0)|))) (.cse11 (= |old(~p_dw_st~0)| 0)) (.cse19 (and .cse9 .cse23 .cse12 .cse7 (= 1 ~p_num_write~0) .cse25)) (.cse22 (= ~q_free~0 1)) (.cse18 (= 2 ~c_dr_st~0)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (= 0 ~p_num_write~0)) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse27 (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 .cse19 .cse1 .cse2 .cse4 .cse20 .cse21 (and .cse22 .cse9 .cse23 .cse7 .cse24 .cse25 .cse26) .cse11 .cse0 .cse5 .cse27 .cse10) (or .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse10) (or .cse2 .cse1 .cse4 .cse20 .cse21 .cse11 .cse19 (and .cse22 .cse18 .cse9 .cse23 .cse7 .cse24 .cse25 .cse26) .cse16 .cse5 .cse27 .cse10) (or (and .cse7 .cse8 .cse9 .cse13) .cse17 .cse3 .cse5))))) [2018-11-28 11:28:52,310 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2018-11-28 11:28:52,310 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-11-28 11:28:52,310 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-11-28 11:28:52,310 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-11-28 11:28:52,310 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-11-28 11:28:52,311 INFO L444 ceAbstractionStarter]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse13 (= ~p_dw_st~0 0))) (let ((.cse12 (not (= ~c_dr_st~0 0))) (.cse1 (= 1 ~c_dr_pc~0)) (.cse23 (= 2 ~c_dr_st~0)) (.cse9 (not .cse13)) (.cse10 (not (= ~p_dw_st~0 2)))) (let ((.cse5 (not (= 1 ~p_num_write~0))) (.cse7 (not (= 0 ~c_num_read~0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse4 (not (= ~q_free~0 0))) (.cse20 (and .cse23 .cse9 .cse10)) (.cse22 (not .cse1)) (.cse16 (and (<= 2 ~p_dw_st~0) .cse12)) (.cse14 (not (= ~p_dw_pc~0 1))) (.cse15 (not (= ~q_free~0 1))) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse17 (< |old(~p_dw_st~0)| 2)) (.cse18 (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))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse6 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10)) (or .cse1 .cse2 .cse3 .cse11 .cse6 (and .cse10 .cse12)) (or .cse13 (or .cse1 .cse2 .cse3 .cse14) .cse11 (not .cse0)) (or .cse2 .cse3 .cse14 .cse15 .cse16 .cse11 .cse5 (not (= 1 ~c_num_read~0)) .cse17 .cse18) (or .cse0 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse20) (let ((.cse21 (+ ~c_num_read~0 1))) (or .cse0 (< ~p_num_write~0 .cse21) (or .cse19 (or .cse2 .cse3 .cse22 .cse14) .cse6) .cse4 (< .cse21 ~p_num_write~0) .cse20)) (or .cse2 .cse3 .cse22 .cse16 .cse14 .cse15 (< ~p_num_write~0 ~c_num_read~0) .cse11 (< ~c_num_read~0 ~p_num_write~0) .cse17 .cse18) (or .cse1 .cse2 .cse3 .cse19 .cse23 .cse6))))) [2018-11-28 11:28:52,311 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2018-11-28 11:28:52,311 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-28 11:28:52,311 INFO L448 ceAbstractionStarter]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2018-11-28 11:28:52,311 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2018-11-28 11:28:52,311 INFO L448 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2018-11-28 11:28:52,311 INFO L444 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (let ((.cse13 (= ~p_dw_st~0 0))) (let ((.cse12 (not (= ~c_dr_st~0 0))) (.cse1 (= 1 ~c_dr_pc~0)) (.cse23 (= 2 ~c_dr_st~0)) (.cse9 (not .cse13)) (.cse10 (not (= ~p_dw_st~0 2)))) (let ((.cse5 (not (= 1 ~p_num_write~0))) (.cse7 (not (= 0 ~c_num_read~0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse4 (not (= ~q_free~0 0))) (.cse20 (and .cse23 .cse9 .cse10)) (.cse22 (not .cse1)) (.cse16 (and (<= 2 ~p_dw_st~0) .cse12)) (.cse14 (not (= ~p_dw_pc~0 1))) (.cse15 (not (= ~q_free~0 1))) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse17 (< |old(~p_dw_st~0)| 2)) (.cse18 (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))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse6 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10)) (or .cse1 .cse2 .cse3 .cse11 .cse6 (and .cse10 .cse12)) (or .cse13 (or .cse1 .cse2 .cse3 .cse14) .cse11 (not .cse0)) (or .cse2 .cse3 .cse14 .cse15 .cse16 .cse11 .cse5 (not (= 1 ~c_num_read~0)) .cse17 .cse18) (or .cse0 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse20) (let ((.cse21 (+ ~c_num_read~0 1))) (or .cse0 (< ~p_num_write~0 .cse21) (or .cse19 (or .cse2 .cse3 .cse22 .cse14) .cse6) .cse4 (< .cse21 ~p_num_write~0) .cse20)) (or .cse2 .cse3 .cse22 .cse16 .cse14 .cse15 (< ~p_num_write~0 ~c_num_read~0) .cse11 (< ~c_num_read~0 ~p_num_write~0) .cse17 .cse18) (or .cse1 .cse2 .cse3 .cse19 .cse23 .cse6))))) [2018-11-28 11:28:52,312 INFO L444 ceAbstractionStarter]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse24 (= ~p_dw_pc~0 1))) (let ((.cse10 (= immediate_notify_threads_~tmp~0 0)) (.cse17 (not (= ~c_dr_st~0 0))) (.cse1 (= 1 ~c_dr_pc~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse18 (not .cse24)) (.cse16 (= ~p_dw_st~0 0))) (let ((.cse7 (not (= 0 ~c_num_read~0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not .cse16)) (.cse5 (not (= 1 ~p_num_write~0))) (.cse14 (or .cse1 .cse2 .cse3 .cse18)) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse11 (not (= ~p_dw_st~0 2))) (.cse13 (= 2 ~c_dr_st~0)) (.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse6 (= |old(~p_dw_st~0)| 2)) (.cse4 (not (= ~q_free~0 0))) (.cse21 (and (<= 2 ~p_dw_st~0) .cse10 .cse17)) (.cse19 (not (= ~q_free~0 1))) (.cse15 (= 0 |old(~c_dr_st~0)|)) (.cse20 (and .cse16 .cse17)) (.cse22 (< |old(~p_dw_st~0)| 2)) (.cse23 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11)) (or .cse0 .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 (and .cse13 .cse9 .cse10 .cse11)) (or .cse14 .cse15 .cse6 (and (or .cse10 .cse16) .cse11 .cse17)) (or .cse2 .cse3 .cse18 .cse19 .cse20 .cse21 .cse15 .cse5 (not (= 1 ~c_num_read~0)) .cse22 .cse23) (or .cse1 .cse2 .cse3 .cse12 .cse6 .cse13) (or .cse16 .cse14 .cse15 (not .cse0)) (or (and .cse10 .cse11 .cse17) .cse1 .cse2 .cse3 .cse15 .cse6 .cse24) (let ((.cse25 (+ ~c_num_read~0 1))) (or .cse0 (< ~p_num_write~0 .cse25) (and (or .cse16 .cse10) .cse11 .cse13) (or .cse12 (or .cse2 .cse3 .cse18) .cse6) .cse4 (< .cse25 ~p_num_write~0))) (or .cse21 .cse2 .cse3 (not .cse1) .cse18 .cse19 (< ~p_num_write~0 ~c_num_read~0) .cse15 .cse20 (< ~c_num_read~0 ~p_num_write~0) .cse22 .cse23))))) [2018-11-28 11:28:52,312 INFO L448 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2018-11-28 11:28:52,312 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:28:52,312 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-11-28 11:28:52,312 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:28:52,312 INFO L448 ceAbstractionStarter]: For program point L290-1(line 290) no Hoare annotation was computed. [2018-11-28 11:28:52,312 INFO L451 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: true [2018-11-28 11:28:52,312 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2018-11-28 11:28:52,312 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2018-11-28 11:28:52,313 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2018-11-28 11:28:52,313 INFO L451 ceAbstractionStarter]: At program point L290(line 290) the Hoare annotation is: true [2018-11-28 11:28:52,313 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2018-11-28 11:28:52,313 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse28 (= |old(~p_dw_pc~0)| 1))) (let ((.cse18 (= 1 ~c_dr_pc~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse4 (not .cse28)) (.cse29 (+ |old(~c_num_read~0)| 1))) (let ((.cse9 (= |old(~p_dw_st~0)| 1)) (.cse19 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse16 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse17 (<= 2 ~p_dw_st~0)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse12 (< |old(~p_num_write~0)| .cse29)) (.cse13 (or .cse1 .cse2 (not .cse0) .cse4)) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse22 (not (= 2 |old(~c_dr_st~0)|))) (.cse20 (< .cse29 |old(~p_num_write~0)|)) (.cse23 (= 2 ~c_dr_st~0)) (.cse21 (< |old(~p_dw_st~0)| 2)) (.cse5 (not .cse18)) (.cse26 (= ~q_free~0 1)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse24 (not (= |old(~q_free~0)| 1))) (.cse11 (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 (and .cse5 (not (= ~p_dw_st~0 1)) .cse6 .cse7 .cse8) .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse11) (or .cse12 .cse13 .cse14 (let ((.cse15 (+ ~c_num_read~0 1))) (and (<= .cse15 ~p_num_write~0) .cse16 .cse17 .cse18 .cse7 (= ~q_free~0 0) (<= ~p_num_write~0 .cse15) .cse6 .cse19)) .cse20 .cse3 .cse21) (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse23 .cse9) (or .cse23 .cse0 .cse1 .cse2 .cse22 .cse24 .cse11 .cse25) (or (and .cse5 .cse26 .cse10 .cse7 (= ~c_num_read~0 0) .cse27 .cse19 (= 0 ~p_num_write~0)) .cse0 .cse1 .cse2 .cse24 .cse11 (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) .cse25) (or .cse13 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse22 (< |old(~c_num_read~0)| |old(~p_num_write~0)|) .cse21 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse16 .cse17 .cse23 .cse18 .cse7 .cse8)) (or .cse12 .cse13 .cse14 .cse22 .cse20 .cse23 .cse21) (or .cse0 .cse1 .cse2 (and .cse5 .cse26 (not (= ~p_dw_pc~0 1)) .cse27 .cse10 .cse6 .cse7) .cse3 .cse24 .cse11 .cse28 .cse25))))) [2018-11-28 11:28:52,313 INFO L444 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (let ((.cse28 (= ~p_dw_i~0 1))) (let ((.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse28)) (.cse1 (= 1 |old(~c_dr_pc~0)|)) (.cse10 (not (= |old(~p_dw_pc~0)| 1))) (.cse12 (= ~q_free~0 1)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (not (= 1 ~c_dr_pc~0))) (.cse16 (not (= ~p_dw_st~0 2))) (.cse27 (not (= ~c_dr_st~0 0))) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= 1 ~p_dw_pc~0))) (let ((.cse0 (= 2 ~c_dr_st~0)) (.cse11 (= |old(~p_dw_st~0)| 1)) (.cse8 (and .cse23 .cse16 .cse27 .cse28 .cse13 .cse21)) (.cse22 (and .cse23 .cse12 .cse16 (not (= ~p_dw_pc~0 1)) .cse18 .cse27 .cse28 .cse13)) (.cse5 (not (= |old(~q_free~0)| 1))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse7 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse25 (or .cse2 .cse3 (not .cse1) .cse10)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse26 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11) (let ((.cse14 (= ~c_num_read~0 0)) (.cse15 (not (= ~p_dw_st~0 0))) (.cse17 (<= 1 eval_~tmp___1~0)) (.cse19 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse20 (= 0 ~p_num_write~0))) (or .cse2 .cse3 (and .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse15 (and (not (= 0 eval_~tmp___1~0)) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse16 .cse0 .cse13 .cse21))) .cse22 .cse5 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) .cse8 .cse1 (and .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse6 (not (= 0 |old(~c_num_read~0)|)) .cse7)) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse10 .cse11) (or .cse8 .cse1 .cse2 .cse3 .cse22 .cse9 .cse5 .cse6 .cse7) (let ((.cse24 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse24) .cse25 (not (= |old(~q_free~0)| 0)) (< .cse24 |old(~p_num_write~0)|) .cse9 .cse26)) (or .cse25 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse4 (< |old(~c_num_read~0)| |old(~p_num_write~0)|) .cse26))))) [2018-11-28 11:28:52,313 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2018-11-28 11:28:52,313 INFO L448 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2018-11-28 11:28:52,313 INFO L448 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-11-28 11:28:52,314 INFO L444 ceAbstractionStarter]: At program point L238(line 238) the Hoare annotation is: (let ((.cse39 (= ~p_dw_i~0 1)) (.cse11 (= 1 ~c_dr_pc~0))) (let ((.cse30 (= 1 ~p_dw_pc~0)) (.cse38 (not .cse11)) (.cse31 (= ~q_free~0 1)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse32 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse40 (+ ~c_num_read~0 1)) (.cse17 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse18 (not .cse39)) (.cse16 (= 1 |old(~c_dr_pc~0)|)) (.cse23 (not (= |old(~p_dw_pc~0)| 1))) (.cse41 (+ |old(~c_num_read~0)| 1))) (let ((.cse0 (< |old(~p_num_write~0)| .cse41)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse3 (< .cse41 |old(~p_num_write~0)|)) (.cse1 (or .cse17 .cse18 (not .cse16) .cse23)) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse14 (< |old(~p_dw_st~0)| 2)) (.cse8 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse7 (<= .cse40 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 .cse40)) (.cse20 (not (= |old(~q_free~0)| 1))) (.cse5 (<= 2 ~p_dw_st~0)) (.cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse25 (and .cse38 .cse31 .cse35 .cse32 .cse10 .cse39 .cse12)) (.cse6 (= ~q_free~0 0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse27 (<= ~c_num_read~0 ~p_num_write~0)) (.cse28 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 2 ~c_dr_st~0)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse26 (and .cse38 (not (= ~p_dw_st~0 1)) .cse10 .cse39 .cse12 .cse30)) (.cse24 (= |old(~p_dw_st~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) .cse14) (or .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse16 .cse17 .cse18 .cse19 .cse23 .cse15 .cse24) (or .cse0 .cse1 .cse15 .cse2 .cse19 .cse3 .cse14) (or .cse16 .cse17 .cse18 .cse25 .cse4 .cse20 .cse21 .cse26 .cse22) (or .cse1 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse19 (< |old(~c_num_read~0)| |old(~p_num_write~0)|) .cse14 (and .cse5 (and .cse27 .cse28 .cse8 .cse15 .cse11 .cse12) .cse13)) (let ((.cse29 (not (= 0 eval_~tmp___1~0)))) (let ((.cse37 (and .cse27 .cse28 .cse29 .cse15 .cse12 .cse30)) (.cse34 (<= 1 eval_~tmp___1~0)) (.cse33 (= ~c_num_read~0 0)) (.cse36 (= 0 ~p_num_write~0))) (or .cse18 (and .cse5 (and .cse6 .cse7 .cse29 .cse9 .cse11 .cse12 .cse30)) .cse20 (and .cse31 .cse32 .cse15 .cse12 .cse33 .cse34 .cse35 .cse13 .cse36) .cse16 (not (= 0 |old(~c_num_read~0)|)) (and .cse5 .cse37) .cse22 .cse17 (and .cse37 (= 0 ~p_dw_st~0)) .cse25 (not (= |old(~p_dw_pc~0)| 0)) .cse26 (not (= 0 |old(~p_num_write~0)|)) (and .cse33 .cse6 (= 2 ~p_dw_st~0) (= 1 ~p_num_write~0) .cse34 .cse12 .cse30) (and .cse38 .cse31 .cse32 .cse12 .cse33 .cse35 .cse13 .cse36) .cse21))) (or .cse16 .cse17 .cse18 .cse4 .cse23 .cse26 .cse24))))) [2018-11-28 11:28:52,314 INFO L444 ceAbstractionStarter]: At program point L269(line 269) the Hoare annotation is: (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse18 (not (= |old(~p_dw_pc~0)| 1)))) (let ((.cse4 (not (= |old(~q_free~0)| 1))) (.cse5 (not (= |old(~p_dw_st~0)| 0))) (.cse6 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse16 (or .cse1 .cse2 (not .cse0) .cse18)) (.cse17 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse7 (= 1 ~c_dr_pc~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= 1 ~p_dw_pc~0)) (.cse9 (= ~c_num_read~0 0)) (.cse12 (= ~q_free~0 0)) (.cse10 (<= 1 eval_~tmp___1~0)) (.cse11 (not (= ~c_dr_st~0 0)))) (or .cse1 .cse2 (and (not .cse7) (= ~q_free~0 1) (= ~p_dw_st~0 0) .cse8 .cse9 .cse10 (= ~c_last_read~0 ~p_last_write~0) .cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) .cse4 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (and (<= 2 ~p_dw_st~0) (let ((.cse13 (+ ~c_num_read~0 1))) (and .cse12 (<= .cse13 ~p_num_write~0) (not (= 0 eval_~tmp___1~0)) (<= ~p_num_write~0 .cse13) .cse11 .cse7 .cse8 .cse14))) .cse0 .cse5 (not (= 0 |old(~c_num_read~0)|)) .cse6 (and .cse8 .cse14 .cse9 .cse12 (= 2 ~p_dw_st~0) (= 1 ~p_num_write~0) .cse10 .cse11))) (let ((.cse15 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse15) .cse16 (not (= |old(~q_free~0)| 0)) (< .cse15 |old(~p_num_write~0)|) .cse3 .cse17)) (or .cse0 .cse1 .cse2 .cse3 .cse18 (= |old(~p_dw_st~0)| 1)) (or .cse16 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) (not (= 2 |old(~c_dr_st~0)|)) (< |old(~c_num_read~0)| |old(~p_num_write~0)|) .cse17)))) [2018-11-28 11:28:52,314 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2018-11-28 11:28:52,314 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2018-11-28 11:28:52,314 INFO L448 ceAbstractionStarter]: For program point L247(lines 237 277) no Hoare annotation was computed. [2018-11-28 11:28:52,314 INFO L444 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse6 (= 1 ~c_dr_pc~0)) (.cse30 (= ~p_dw_i~0 1))) (let ((.cse26 (= 1 ~p_dw_pc~0)) (.cse16 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse17 (not .cse30)) (.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse22 (not (= |old(~p_dw_pc~0)| 1))) (.cse31 (+ |old(~c_num_read~0)| 1)) (.cse29 (not .cse6)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (+ ~c_num_read~0 1))) (let ((.cse8 (= ~q_free~0 0)) (.cse3 (<= .cse32 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 .cse32)) (.cse27 (and .cse29 (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) .cse10 .cse30 .cse7)) (.cse19 (not (= |old(~q_free~0)| 1))) (.cse20 (not (= |old(~p_dw_st~0)| 0))) (.cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse24 (<= ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse0 (< |old(~p_num_write~0)| .cse31)) (.cse1 (or .cse16 .cse17 (not .cse15) .cse22)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse18 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (< .cse31 |old(~p_num_write~0)|)) (.cse14 (= 2 ~c_dr_st~0)) (.cse13 (< |old(~p_dw_st~0)| 2)) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse28 (and .cse29 (not (= ~p_dw_st~0 1)) .cse10 .cse30 .cse7 .cse26)) (.cse23 (= |old(~p_dw_st~0)| 1))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) .cse11 .cse12 .cse13) (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse15 .cse16 .cse17 .cse18 .cse22 .cse14 .cse23) (or .cse16 .cse17 (and .cse24 .cse25 .cse5 .cse14 .cse7 .cse26) .cse27 .cse19 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) .cse28 .cse15 (and .cse8 .cse3 .cse5 .cse9 .cse10 .cse7 .cse26) .cse20 (not (= 0 |old(~c_num_read~0)|)) .cse21) (or .cse15 .cse16 .cse17 .cse27 .cse12 .cse19 .cse20 .cse28 .cse21) (or .cse1 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse18 (< |old(~c_num_read~0)| |old(~p_num_write~0)|) .cse13 (and .cse24 .cse25 .cse4 .cse5 .cse14 .cse6 .cse7 .cse26)) (or .cse0 .cse1 .cse2 .cse18 .cse11 .cse14 .cse13) (or .cse15 .cse16 .cse17 .cse12 .cse22 .cse28 .cse23))))) [2018-11-28 11:28:52,314 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2018-11-28 11:28:52,315 INFO L444 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse39 (= ~p_dw_i~0 1)) (.cse11 (= 1 ~c_dr_pc~0))) (let ((.cse30 (= 1 ~p_dw_pc~0)) (.cse38 (not .cse11)) (.cse31 (= ~q_free~0 1)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse32 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse40 (+ ~c_num_read~0 1)) (.cse17 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse18 (not .cse39)) (.cse16 (= 1 |old(~c_dr_pc~0)|)) (.cse23 (not (= |old(~p_dw_pc~0)| 1))) (.cse41 (+ |old(~c_num_read~0)| 1))) (let ((.cse0 (< |old(~p_num_write~0)| .cse41)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse3 (< .cse41 |old(~p_num_write~0)|)) (.cse1 (or .cse17 .cse18 (not .cse16) .cse23)) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse14 (< |old(~p_dw_st~0)| 2)) (.cse8 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse7 (<= .cse40 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 .cse40)) (.cse20 (not (= |old(~q_free~0)| 1))) (.cse5 (<= 2 ~p_dw_st~0)) (.cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse25 (and .cse38 .cse31 .cse35 .cse32 .cse10 .cse39 .cse12)) (.cse6 (= ~q_free~0 0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse27 (<= ~c_num_read~0 ~p_num_write~0)) (.cse28 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 2 ~c_dr_st~0)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse26 (and .cse38 (not (= ~p_dw_st~0 1)) .cse10 .cse39 .cse12 .cse30)) (.cse24 (= |old(~p_dw_st~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) .cse14) (or .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse16 .cse17 .cse18 .cse19 .cse23 .cse15 .cse24) (or .cse0 .cse1 .cse15 .cse2 .cse19 .cse3 .cse14) (or .cse16 .cse17 .cse18 .cse25 .cse4 .cse20 .cse21 .cse26 .cse22) (or .cse1 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse19 (< |old(~c_num_read~0)| |old(~p_num_write~0)|) .cse14 (and .cse5 (and .cse27 .cse28 .cse8 .cse15 .cse11 .cse12) .cse13)) (let ((.cse29 (not (= 0 eval_~tmp___1~0)))) (let ((.cse37 (and .cse27 .cse28 .cse29 .cse15 .cse12 .cse30)) (.cse34 (<= 1 eval_~tmp___1~0)) (.cse33 (= ~c_num_read~0 0)) (.cse36 (= 0 ~p_num_write~0))) (or .cse18 (and .cse5 (and .cse6 .cse7 .cse29 .cse9 .cse11 .cse12 .cse30)) .cse20 (and .cse31 .cse32 .cse15 .cse12 .cse33 .cse34 .cse35 .cse13 .cse36) .cse16 (not (= 0 |old(~c_num_read~0)|)) (and .cse5 .cse37) .cse22 .cse17 (and .cse37 (= 0 ~p_dw_st~0)) .cse25 (not (= |old(~p_dw_pc~0)| 0)) .cse26 (not (= 0 |old(~p_num_write~0)|)) (and .cse33 .cse6 (= 2 ~p_dw_st~0) (= 1 ~p_num_write~0) .cse34 .cse12 .cse30) (and .cse38 .cse31 .cse32 .cse12 .cse33 .cse35 .cse13 .cse36) .cse21))) (or .cse16 .cse17 .cse18 .cse4 .cse23 .cse26 .cse24))))) [2018-11-28 11:28:52,315 INFO L444 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse5 (= ~p_dw_st~0 2)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse1 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse4 (= 0 ~c_dr_st~0)) (.cse6 (not (= 1 ~p_num_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or (= ~p_dw_st~0 0) .cse0 .cse2 .cse3 .cse1 (not (= ~q_free~0 0)) .cse6 .cse5 (not (= 0 ~c_num_read~0)) (not (= ~p_dw_pc~0 0))) (or .cse2 .cse3 .cse1 (not (= ~p_dw_pc~0 1)) (not (= ~q_free~0 1)) .cse0 .cse4 .cse6 (not (= 1 ~c_num_read~0)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2018-11-28 11:28:52,315 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2018-11-28 11:28:52,315 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2018-11-28 11:28:52,315 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2018-11-28 11:28:52,315 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2018-11-28 11:28:52,315 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2018-11-28 11:28:52,315 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2018-11-28 11:28:52,315 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (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)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 11:28:52,316 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2018-11-28 11:28:52,316 INFO L448 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2018-11-28 11:28:52,316 INFO L444 ceAbstractionStarter]: At program point L317(line 317) the Hoare annotation is: (let ((.cse0 (<= 2 ~p_dw_st~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse2 (= 1 ~p_dw_pc~0)) (.cse5 (not (= 1 ~c_dr_pc~0))) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0))) (or (not (= ~p_dw_i~0 1)) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 (= 2 ~c_dr_st~0) .cse1 .cse2) (not (= |old(~q_free~0)| 1)) (= 1 |old(~c_dr_pc~0)|) (let ((.cse3 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse3 ~p_num_write~0) .cse0 (<= ~p_num_write~0 .cse3) .cse4 .cse1 .cse2)) (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 .cse5 .cse6 .cse7 .cse8 .cse4 .cse1) (not (= |old(~p_dw_pc~0)| 0)) (and .cse5 (not (= ~p_dw_st~0 1)) .cse4 .cse1 .cse2) (not (= 0 |old(~p_num_write~0)|)) (and .cse5 .cse6 .cse8 .cse1 (= ~c_num_read~0 0) .cse7 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)))) [2018-11-28 11:28:52,316 INFO L444 ceAbstractionStarter]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse0 (<= 2 ~p_dw_st~0)) (.cse5 (not (= 1 ~c_dr_pc~0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= 1 ~p_dw_pc~0))) (or (not (= ~p_dw_i~0 1)) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 (= 2 ~c_dr_st~0) .cse1 .cse2) (not (= |old(~q_free~0)| 1)) (= 1 |old(~c_dr_pc~0)|) (let ((.cse3 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse3 ~p_num_write~0) .cse0 (<= ~p_num_write~0 .cse3) .cse4 .cse1 .cse2)) (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 .cse5 (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) .cse4 .cse1) (not (= |old(~p_dw_pc~0)| 0)) (and .cse5 (not (= ~p_dw_st~0 1)) .cse4 .cse1 .cse2) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)))) [2018-11-28 11:28:52,316 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2018-11-28 11:28:52,316 INFO L448 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2018-11-28 11:28:52,316 INFO L444 ceAbstractionStarter]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse0 (<= 2 ~p_dw_st~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse2 (= 1 ~p_dw_pc~0)) (.cse5 (not (= 1 ~c_dr_pc~0))) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0))) (or (not (= ~p_dw_i~0 1)) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 (= 2 ~c_dr_st~0) .cse1 .cse2) (not (= |old(~q_free~0)| 1)) (= 1 |old(~c_dr_pc~0)|) (let ((.cse3 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse3 ~p_num_write~0) .cse0 (<= ~p_num_write~0 .cse3) .cse4 .cse1 .cse2)) (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 .cse5 .cse6 .cse7 .cse8 .cse4 .cse1) (not (= |old(~p_dw_pc~0)| 0)) (and .cse5 (not (= ~p_dw_st~0 1)) .cse4 .cse1 .cse2) (not (= 0 |old(~p_num_write~0)|)) (and .cse5 .cse6 .cse8 .cse1 (= ~c_num_read~0 0) .cse7 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)))) [2018-11-28 11:28:52,317 INFO L444 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (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)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 11:28:52,317 INFO L451 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2018-11-28 11:28:52,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:28:52,317 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~c_num_read~0 0) (not (= 1 ~c_dr_pc~0)) (= ~q_free~0 0) (= ~p_dw_pc~0 0) (= ~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-11-28 11:28:52,317 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:28:52,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:28:52,317 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-11-28 11:28:52,317 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2018-11-28 11:28:52,317 INFO L448 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2018-11-28 11:28:52,317 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2018-11-28 11:28:52,317 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2018-11-28 11:28:52,318 INFO L444 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (= ~p_dw_st~0 0)) (.cse4 (not (= ~q_free~0 0))) (.cse6 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 0 ~c_num_read~0))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse5 (= 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))) (.cse7 (= ~p_dw_st~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse5 .cse2 .cse3 .cse4 (not (= 2 ~c_dr_st~0)) .cse6 .cse7 .cse8 .cse9) (or .cse5 .cse1 .cse2 .cse3 (= 0 ~c_dr_st~0) .cse7 (= ~p_dw_pc~0 1)))) [2018-11-28 11:28:52,318 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2018-11-28 11:28:52,318 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2018-11-28 11:28:52,318 INFO L444 ceAbstractionStarter]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse4 (not (= ~p_dw_pc~0 1))) (.cse12 (not (= |old(~q_free~0)| 0))) (.cse13 (<= 2 ~p_dw_st~0)) (.cse15 (< |old(~p_dw_st~0)| 2)) (.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)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (= 1 |old(~c_dr_pc~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 (and .cse6 .cse7 .cse8 .cse9 (= ~c_num_read~0 0) .cse11) .cse1 .cse2 (not (= |old(~q_free~0)| 1)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse3 .cse14 (not (= |old(~p_dw_st~0)| 0)) .cse17 (not (= |old(~c_last_read~0)| ~p_last_write~0))))) [2018-11-28 11:28:52,318 INFO L448 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2018-11-28 11:28:52,318 INFO L444 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (let ((.cse4 (not (= ~p_dw_pc~0 1))) (.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 .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse5 (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0))))) [2018-11-28 11:28:52,319 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)) (.cse19 (= ~p_dw_i~0 1))) (let ((.cse7 (= ~c_num_read~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse13 (not (= 0 |old(~c_num_read~0)|))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not .cse19)) (.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse2 (and .cse11 .cse12 .cse19 (= ~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 .cse0 .cse1 (not (= |old(~q_free~0)| 1)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse15 .cse10 (and .cse11 (= ~p_dw_st~0 0) .cse7 .cse12 .cse8) (not (= |old(~p_dw_st~0)| 0)) .cse13 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse16 (+ |old(~c_num_read~0)| 1)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0))) (or (< ~p_num_write~0 .cse16) (or .cse0 .cse1 (not .cse15) .cse5) (and .cse17 .cse18 .cse2 .cse3) .cse9 (< .cse16 ~p_num_write~0) .cse10 (and .cse17 .cse18 .cse11 .cse6 .cse12) .cse14))))) [2018-11-28 11:28:52,319 INFO L444 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse9 (not (= 0 |old(~c_num_read~0)|))) (.cse8 (< |old(~p_dw_st~0)| 2))) (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 .cse7 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse9 (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse3 .cse1 .cse2 .cse5 .cse7 .cse4 (not (= 1 ~p_num_write~0)) .cse9 .cse8))) [2018-11-28 11:28:52,319 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2018-11-28 11:28:52,319 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2018-11-28 11:28:52,319 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse8 (= 1 ~c_dr_pc~0))) (let ((.cse5 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse7 (<= 2 ~p_dw_st~0)) (.cse9 (= ~q_free~0 0)) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse15 (not (= 0 |old(~c_num_read~0)|))) (.cse13 (not .cse8)) (.cse14 (= ~c_num_read~0 0)) (.cse10 (not (= ~c_dr_st~0 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 .cse1 .cse2 (not (= |old(~q_free~0)| 1)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse3 .cse11 (not (= |old(~p_dw_st~0)| 0)) .cse15 (and .cse13 (= ~q_free~0 1) (= ~p_dw_st~0 0) .cse14 (= ~c_last_read~0 ~p_last_write~0) .cse10) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-11-28 11:28:52,319 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2018-11-28 11:28:52,319 INFO L444 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (let ((.cse4 (not (= ~p_dw_pc~0 1))) (.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 .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse5 (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0))))) [2018-11-28 11:28:52,320 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2018-11-28 11:28:52,320 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2018-11-28 11:28:52,320 INFO L444 ceAbstractionStarter]: At program point L169(line 169) the Hoare annotation is: (let ((.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse4 (= 0 |old(~c_dr_st~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))) (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) (or .cse0 .cse1 .cse2 .cse4 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse11 (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (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)))) [2018-11-28 11:28:52,320 INFO L448 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-11-28 11:28:52,320 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2018-11-28 11:28:52,320 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2018-11-28 11:28:52,320 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= ~q_buf_0~0 ~p_last_write~0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 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 (= ~p_dw_st~0 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~c_last_read~0 ~p_last_write~0))) [2018-11-28 11:28:52,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:28:52 BoogieIcfgContainer [2018-11-28 11:28:52,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:28:52,366 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:28:52,366 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:28:52,366 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:28:52,366 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:28:37" (3/4) ... [2018-11-28 11:28:52,371 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:28:52,377 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-28 11:28:52,377 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-28 11:28:52,377 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:28:52,377 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-28 11:28:52,377 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-28 11:28:52,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2018-11-28 11:28:52,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:28:52,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-28 11:28:52,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-28 11:28:52,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-28 11:28:52,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-28 11:28:52,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-28 11:28:52,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-28 11:28:52,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-28 11:28:52,384 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-28 11:28:52,384 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 11:28:52,409 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(p_dw_i == 1) || (((((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(q_free) == 1)) || 1 == \old(c_dr_pc)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && 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))) || (((((!(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)) || !(\old(p_dw_pc) == 0)) || ((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(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)) || !(\old(p_dw_st) == 0) [2018-11-28 11:28:52,409 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(q_free) == 0)) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || ((2 <= p_dw_st && (((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write == \old(p_num_write)) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_dw_pc) == p_dw_pc)) || \old(p_dw_st) < 2) && (((((((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)) && ((((((\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)) || 2 == c_dr_st) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_st) < 2)) && ((((((((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) || ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_dw_pc) == p_dw_pc))) && ((((((((((((((((!(p_dw_i == 1) || (2 <= p_dw_st && (((((q_free == 0 && c_num_read + 1 <= p_num_write) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || ((((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && 1 <= tmp___1) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || 1 == \old(c_dr_pc)) || !(0 == \old(c_num_read))) || (2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && !(0 == tmp___1)) && 2 == c_dr_st) && 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))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && !(0 == tmp___1)) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == p_dw_st)) || ((((((!(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)) || !(\old(p_dw_pc) == 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)) || !(0 == \old(p_num_write))) || ((((((c_num_read == 0 && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) && 1 <= tmp___1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((!(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)) || !(\old(p_dw_st) == 0))) && ((((((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-11-28 11:28:52,409 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(q_free) == 0)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2) && (((((((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)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || (((((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)) || ((((((!(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)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) == 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)) || 1 == \old(c_dr_pc)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\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)) || ((((((!(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) + 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)) && ((((((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-11-28 11:28:52,410 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)) && ((((((((((((((((p_last_write == q_buf_0 && !(p_dw_st == 0)) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || ((((((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_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_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)))) && (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || (((((p_last_write == q_buf_0 && !(p_dw_st == 0)) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc)) || (((((((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)) || !(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-11-28 11:28:52,410 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\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)))) && ((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || ((((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)) || !(\old(p_dw_pc) == 0)) || !(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)))) && ((((((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(q_free) == 1)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || ((((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))) [2018-11-28 11:28:52,410 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(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) == 0)) || !(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) || !(0 == c_num_read)) || !(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(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))) && ((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) == 0)) || (((((2 == c_dr_st && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && \old(p_dw_pc) == p_dw_pc) && 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)))) && (((((((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)))) && ((((((!(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-11-28 11:28:52,410 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) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || 1 == \old(c_dr_pc)) || 0 == \old(c_dr_st)) || ((((q_free == 1 && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\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-11-28 11:28:52,410 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)) && (((((((((((((((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) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || 1 == \old(c_dr_pc)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == p_last_write)) [2018-11-28 11:28:52,410 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)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write))) && ((((((((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) [2018-11-28 11:28:52,445 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_35770949-53d3-48fc-9940-b4b0daf9006a/bin-2019/uautomizer/witness.graphml [2018-11-28 11:28:52,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:28:52,446 INFO L168 Benchmark]: Toolchain (without parser) took 16007.17 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 708.8 MB). Free memory was 958.7 MB in the beginning and 1.0 GB in the end (delta: -62.7 MB). Peak memory consumption was 646.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:52,447 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:28:52,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.25 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 945.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:52,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.79 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:28:52,447 INFO L168 Benchmark]: Boogie Preprocessor took 57.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 945.3 MB in the beginning and 1.2 GB in the end (delta: -208.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:52,447 INFO L168 Benchmark]: RCFGBuilder took 309.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:52,448 INFO L168 Benchmark]: TraceAbstraction took 15364.51 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 551.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.5 MB). Peak memory consumption was 755.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:52,448 INFO L168 Benchmark]: Witness Printer took 79.80 ms. Allocated memory is still 1.7 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:52,449 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 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 179.25 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 945.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.79 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 945.3 MB in the beginning and 1.2 GB in the end (delta: -208.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 309.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15364.51 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 551.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.5 MB). Peak memory consumption was 755.5 MB. Max. memory is 11.5 GB. * Witness Printer took 79.80 ms. Allocated memory is still 1.7 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 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(q_free) == 0)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2) && (((((((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)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || (((((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)) || ((((((!(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)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) == 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)) || 1 == \old(c_dr_pc)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\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)) || ((((((!(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) + 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)) && ((((((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)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write))) && ((((((((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) - 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)) && ((((((((((((((((p_last_write == q_buf_0 && !(p_dw_st == 0)) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || ((((((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_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_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)))) && (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || (((((p_last_write == q_buf_0 && !(p_dw_st == 0)) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc)) || (((((((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)) || !(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) - 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) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || 1 == \old(c_dr_pc)) || 0 == \old(c_dr_st)) || ((((q_free == 1 && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\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)) || !(q_free == 0)) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_st == 2) || !(0 == c_num_read)) || !(p_dw_pc == 0)) && (((((((((p_dw_st == 0 || 0 == __retres1) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == p_num_write)) || p_dw_st == 2) || !(0 == c_num_read)) || !(p_dw_pc == 0))) && ((((((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) || (((((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(q_free) == 1)) || 1 == \old(c_dr_pc)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && 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))) || (((((!(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)) || !(\old(p_dw_pc) == 0)) || ((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(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)) || !(\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(q_free) == 0)) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || ((2 <= p_dw_st && (((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write == \old(p_num_write)) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_dw_pc) == p_dw_pc)) || \old(p_dw_st) < 2) && (((((((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)) && ((((((\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)) || 2 == c_dr_st) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_st) < 2)) && ((((((((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) || ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_dw_pc) == p_dw_pc))) && ((((((((((((((((!(p_dw_i == 1) || (2 <= p_dw_st && (((((q_free == 0 && c_num_read + 1 <= p_num_write) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || ((((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && 1 <= tmp___1) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || 1 == \old(c_dr_pc)) || !(0 == \old(c_num_read))) || (2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && !(0 == tmp___1)) && 2 == c_dr_st) && 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))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && !(0 == tmp___1)) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == p_dw_st)) || ((((((!(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)) || !(\old(p_dw_pc) == 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)) || !(0 == \old(p_num_write))) || ((((((c_num_read == 0 && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) && 1 <= tmp___1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((!(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)) || !(\old(p_dw_st) == 0))) && ((((((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(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)))) && ((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || ((((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)) || !(\old(p_dw_pc) == 0)) || !(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)))) && ((((((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(q_free) == 1)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || ((((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))) - 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) && (((((((((p_dw_st == 0 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || !(q_free == 0)) || !(1 == p_num_write)) || p_dw_st == 2) || !(0 == c_num_read)) || !(p_dw_pc == 0))) && (((((((((!(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)) - 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)) && (((((((((((((((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) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || 1 == \old(c_dr_pc)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == p_last_write)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_free == 1)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(2 == c_dr_st)) || 1 == __retres1) || !(p_dw_st == 0)) || !(0 == c_num_read)) || !(c_last_read == p_last_write)) && (((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 == __retres1) || !(p_dw_st == 0)) || !(0 == c_num_read)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(c_last_read == p_last_write))) && ((((((p_num_write < c_num_read + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(p_dw_pc == 1)) || !(q_free == 0)) || !(c_dr_st == 0)) || c_num_read + 1 < p_num_write) || 1 == __retres1) || p_dw_st < 2)) && ((((((((1 == __retres1 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(c_dr_st == 0)) || p_dw_st < 2)) && ((((p_num_write < c_num_read || 1 == __retres1) || !(2 == c_dr_st)) || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(p_dw_pc == 1)) || !(p_dw_st == 0)) || c_num_read < p_num_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(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) == 0)) || !(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) || !(0 == c_num_read)) || !(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(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))) && ((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) == 0)) || (((((2 == c_dr_st && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && \old(p_dw_pc) == p_dw_pc) && 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)))) && (((((((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)))) && ((((((!(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, 15.2s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 9.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 2356 SDtfs, 3645 SDslu, 4004 SDs, 0 SdLazy, 2358 SolverSat, 1061 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 646 GetRequests, 545 SyntacticMatches, 10 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s 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.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 919 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3698 PreInvPairs, 4119 NumberOfFragments, 7927 HoareAnnotationTreeSize, 3698 FomulaSimplifications, 17296 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 29143 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1661 NumberOfCodeBlocks, 1661 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1644 ConstructedInterpolants, 0 QuantifiedInterpolants, 310620 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2782 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 497/570 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...