./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/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_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/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-5842f4b [2018-11-18 16:56:10,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:56:10,997 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:56:11,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:56:11,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:56:11,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:56:11,005 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:56:11,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:56:11,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:56:11,008 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:56:11,009 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:56:11,009 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:56:11,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:56:11,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:56:11,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:56:11,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:56:11,012 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:56:11,013 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:56:11,014 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:56:11,016 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:56:11,017 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:56:11,018 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:56:11,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:56:11,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:56:11,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:56:11,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:56:11,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:56:11,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:56:11,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:56:11,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:56:11,022 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:56:11,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:56:11,023 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:56:11,023 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:56:11,024 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:56:11,025 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:56:11,025 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 16:56:11,035 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:56:11,035 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:56:11,036 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:56:11,036 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 16:56:11,036 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:56:11,036 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:56:11,036 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:56:11,037 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:56:11,037 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:56:11,037 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:56:11,037 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:56:11,037 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:56:11,037 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:56:11,037 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:56:11,038 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:56:11,038 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:56:11,038 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:56:11,038 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:56:11,038 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:56:11,038 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:56:11,039 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:56:11,039 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:56:11,040 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:56:11,040 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:56:11,040 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:56:11,040 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:56:11,040 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:56:11,040 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:56:11,040 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:56:11,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:56:11,041 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_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/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-18 16:56:11,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:56:11,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:56:11,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:56:11,078 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:56:11,078 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:56:11,079 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-18 16:56:11,120 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/data/d645d7694/f311ef89766d49338c4c9b013202af43/FLAGbb6b85c96 [2018-11-18 16:56:11,531 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:56:11,532 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-18 16:56:11,538 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/data/d645d7694/f311ef89766d49338c4c9b013202af43/FLAGbb6b85c96 [2018-11-18 16:56:11,549 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/data/d645d7694/f311ef89766d49338c4c9b013202af43 [2018-11-18 16:56:11,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:56:11,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:56:11,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:56:11,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:56:11,555 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:56:11,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:56:11" (1/1) ... [2018-11-18 16:56:11,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af2b395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11, skipping insertion in model container [2018-11-18 16:56:11,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:56:11" (1/1) ... [2018-11-18 16:56:11,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:56:11,584 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:56:11,713 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:56:11,716 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:56:11,735 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:56:11,744 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:56:11,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11 WrapperNode [2018-11-18 16:56:11,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:56:11,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:56:11,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:56:11,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:56:11,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11" (1/1) ... [2018-11-18 16:56:11,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11" (1/1) ... [2018-11-18 16:56:11,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11" (1/1) ... [2018-11-18 16:56:11,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11" (1/1) ... [2018-11-18 16:56:11,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11" (1/1) ... [2018-11-18 16:56:11,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11" (1/1) ... [2018-11-18 16:56:11,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11" (1/1) ... [2018-11-18 16:56:11,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:56:11,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:56:11,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:56:11,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:56:11,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:56:11,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:56:11,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:56:11,847 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 16:56:11,847 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-18 16:56:11,847 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-18 16:56:11,847 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2018-11-18 16:56:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-18 16:56:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-18 16:56:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 16:56:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 16:56:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 16:56:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 16:56:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 16:56:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 16:56:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:56:11,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:56:11,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 16:56:11,849 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 16:56:11,849 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-18 16:56:11,849 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-18 16:56:11,849 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2018-11-18 16:56:11,849 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-18 16:56:11,849 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-18 16:56:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 16:56:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 16:56:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 16:56:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 16:56:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 16:56:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 16:56:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:56:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:56:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:56:12,114 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:56:12,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:56:12 BoogieIcfgContainer [2018-11-18 16:56:12,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:56:12,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:56:12,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:56:12,118 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:56:12,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:56:11" (1/3) ... [2018-11-18 16:56:12,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d05485e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:56:12, skipping insertion in model container [2018-11-18 16:56:12,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:56:11" (2/3) ... [2018-11-18 16:56:12,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d05485e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:56:12, skipping insertion in model container [2018-11-18 16:56:12,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:56:12" (3/3) ... [2018-11-18 16:56:12,121 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-18 16:56:12,129 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:56:12,134 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:56:12,143 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:56:12,163 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:56:12,164 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:56:12,164 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:56:12,164 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:56:12,164 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:56:12,164 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:56:12,164 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:56:12,164 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:56:12,164 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:56:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-11-18 16:56:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 16:56:12,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:12,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:12,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:12,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:12,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1866970747, now seen corresponding path program 1 times [2018-11-18 16:56:12,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:12,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:12,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:12,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:12,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:12,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:56:12,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:56:12,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:56:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:56:12,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:56:12,385 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-11-18 16:56:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:12,481 INFO L93 Difference]: Finished difference Result 291 states and 407 transitions. [2018-11-18 16:56:12,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:56:12,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-11-18 16:56:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:12,494 INFO L225 Difference]: With dead ends: 291 [2018-11-18 16:56:12,494 INFO L226 Difference]: Without dead ends: 183 [2018-11-18 16:56:12,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:56:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-18 16:56:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-11-18 16:56:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-18 16:56:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2018-11-18 16:56:12,545 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 67 [2018-11-18 16:56:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:12,546 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2018-11-18 16:56:12,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:56:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2018-11-18 16:56:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 16:56:12,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:12,548 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:12,549 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:12,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1595400249, now seen corresponding path program 1 times [2018-11-18 16:56:12,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:12,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:12,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:12,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:12,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:12,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:56:12,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:56:12,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:56:12,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:56:12,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:56:12,603 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand 4 states. [2018-11-18 16:56:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:12,669 INFO L93 Difference]: Finished difference Result 338 states and 439 transitions. [2018-11-18 16:56:12,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:56:12,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-18 16:56:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:12,670 INFO L225 Difference]: With dead ends: 338 [2018-11-18 16:56:12,670 INFO L226 Difference]: Without dead ends: 176 [2018-11-18 16:56:12,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:56:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-18 16:56:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-11-18 16:56:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 16:56:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 226 transitions. [2018-11-18 16:56:12,688 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 226 transitions. Word has length 68 [2018-11-18 16:56:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:12,689 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 226 transitions. [2018-11-18 16:56:12,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:56:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 226 transitions. [2018-11-18 16:56:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 16:56:12,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:12,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:12,691 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:12,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2132750401, now seen corresponding path program 1 times [2018-11-18 16:56:12,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:12,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:12,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:12,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:12,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:12,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:56:12,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:56:12,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:56:12,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:56:12,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:56:12,787 INFO L87 Difference]: Start difference. First operand 176 states and 226 transitions. Second operand 6 states. [2018-11-18 16:56:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:13,250 INFO L93 Difference]: Finished difference Result 578 states and 837 transitions. [2018-11-18 16:56:13,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:56:13,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-18 16:56:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:13,255 INFO L225 Difference]: With dead ends: 578 [2018-11-18 16:56:13,256 INFO L226 Difference]: Without dead ends: 419 [2018-11-18 16:56:13,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:56:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-18 16:56:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 369. [2018-11-18 16:56:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-18 16:56:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 534 transitions. [2018-11-18 16:56:13,306 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 534 transitions. Word has length 75 [2018-11-18 16:56:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:13,307 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 534 transitions. [2018-11-18 16:56:13,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:56:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 534 transitions. [2018-11-18 16:56:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 16:56:13,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:13,309 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:13,309 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:13,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1143366072, now seen corresponding path program 1 times [2018-11-18 16:56:13,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:13,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:13,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:13,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:13,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:13,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:56:13,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:56:13,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:56:13,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:56:13,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:56:13,391 INFO L87 Difference]: Start difference. First operand 369 states and 534 transitions. Second operand 3 states. [2018-11-18 16:56:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:13,469 INFO L93 Difference]: Finished difference Result 922 states and 1444 transitions. [2018-11-18 16:56:13,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:56:13,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-18 16:56:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:13,474 INFO L225 Difference]: With dead ends: 922 [2018-11-18 16:56:13,474 INFO L226 Difference]: Without dead ends: 570 [2018-11-18 16:56:13,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:56:13,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-18 16:56:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 566. [2018-11-18 16:56:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-11-18 16:56:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 847 transitions. [2018-11-18 16:56:13,525 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 847 transitions. Word has length 68 [2018-11-18 16:56:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:13,525 INFO L480 AbstractCegarLoop]: Abstraction has 566 states and 847 transitions. [2018-11-18 16:56:13,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:56:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 847 transitions. [2018-11-18 16:56:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 16:56:13,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:13,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:13,528 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:13,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:13,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1204627774, now seen corresponding path program 1 times [2018-11-18 16:56:13,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:13,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:13,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:13,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:13,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:13,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:56:13,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:56:13,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:56:13,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:56:13,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:56:13,638 INFO L87 Difference]: Start difference. First operand 566 states and 847 transitions. Second operand 4 states. [2018-11-18 16:56:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:13,826 INFO L93 Difference]: Finished difference Result 1384 states and 2206 transitions. [2018-11-18 16:56:13,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:56:13,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-11-18 16:56:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:13,831 INFO L225 Difference]: With dead ends: 1384 [2018-11-18 16:56:13,831 INFO L226 Difference]: Without dead ends: 835 [2018-11-18 16:56:13,835 INFO L604 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-18 16:56:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-11-18 16:56:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2018-11-18 16:56:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-11-18 16:56:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1186 transitions. [2018-11-18 16:56:13,885 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1186 transitions. Word has length 69 [2018-11-18 16:56:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:13,886 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1186 transitions. [2018-11-18 16:56:13,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:56:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1186 transitions. [2018-11-18 16:56:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 16:56:13,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:13,887 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:13,888 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:13,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:13,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1091241117, now seen corresponding path program 1 times [2018-11-18 16:56:13,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:13,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:13,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:13,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:56:13,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:56:13,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:56:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:56:13,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:56:13,952 INFO L87 Difference]: Start difference. First operand 827 states and 1186 transitions. Second operand 6 states. [2018-11-18 16:56:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:14,017 INFO L93 Difference]: Finished difference Result 1569 states and 2368 transitions. [2018-11-18 16:56:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:56:14,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-18 16:56:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:14,023 INFO L225 Difference]: With dead ends: 1569 [2018-11-18 16:56:14,024 INFO L226 Difference]: Without dead ends: 845 [2018-11-18 16:56:14,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:56:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-11-18 16:56:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2018-11-18 16:56:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-11-18 16:56:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1201 transitions. [2018-11-18 16:56:14,075 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1201 transitions. Word has length 69 [2018-11-18 16:56:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:14,075 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1201 transitions. [2018-11-18 16:56:14,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:56:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1201 transitions. [2018-11-18 16:56:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 16:56:14,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:14,077 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:14,077 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:14,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 70172763, now seen corresponding path program 1 times [2018-11-18 16:56:14,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:14,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:14,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:14,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:56:14,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:56:14,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:56:14,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:56:14,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:56:14,129 INFO L87 Difference]: Start difference. First operand 845 states and 1201 transitions. Second operand 6 states. [2018-11-18 16:56:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:14,207 INFO L93 Difference]: Finished difference Result 1619 states and 2439 transitions. [2018-11-18 16:56:14,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:56:14,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-18 16:56:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:14,213 INFO L225 Difference]: With dead ends: 1619 [2018-11-18 16:56:14,213 INFO L226 Difference]: Without dead ends: 877 [2018-11-18 16:56:14,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:56:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-11-18 16:56:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 867. [2018-11-18 16:56:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2018-11-18 16:56:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1219 transitions. [2018-11-18 16:56:14,264 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1219 transitions. Word has length 69 [2018-11-18 16:56:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:14,264 INFO L480 AbstractCegarLoop]: Abstraction has 867 states and 1219 transitions. [2018-11-18 16:56:14,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:56:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1219 transitions. [2018-11-18 16:56:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 16:56:14,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:14,266 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:14,266 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:14,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1845180125, now seen corresponding path program 1 times [2018-11-18 16:56:14,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:14,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:14,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:14,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:56:14,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:56:14,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:56:14,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:56:14,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:56:14,323 INFO L87 Difference]: Start difference. First operand 867 states and 1219 transitions. Second operand 4 states. [2018-11-18 16:56:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:14,475 INFO L93 Difference]: Finished difference Result 1247 states and 1753 transitions. [2018-11-18 16:56:14,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:56:14,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-11-18 16:56:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:14,484 INFO L225 Difference]: With dead ends: 1247 [2018-11-18 16:56:14,484 INFO L226 Difference]: Without dead ends: 1244 [2018-11-18 16:56:14,485 INFO L604 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-18 16:56:14,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2018-11-18 16:56:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1143. [2018-11-18 16:56:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2018-11-18 16:56:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1619 transitions. [2018-11-18 16:56:14,568 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1619 transitions. Word has length 69 [2018-11-18 16:56:14,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:14,569 INFO L480 AbstractCegarLoop]: Abstraction has 1143 states and 1619 transitions. [2018-11-18 16:56:14,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:56:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1619 transitions. [2018-11-18 16:56:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 16:56:14,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:14,570 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:14,570 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:14,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:14,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1365704798, now seen corresponding path program 1 times [2018-11-18 16:56:14,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:14,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:14,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:14,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:14,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:14,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:56:14,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:56:14,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:56:14,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:56:14,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:56:14,622 INFO L87 Difference]: Start difference. First operand 1143 states and 1619 transitions. Second operand 3 states. [2018-11-18 16:56:14,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:14,682 INFO L93 Difference]: Finished difference Result 1980 states and 2895 transitions. [2018-11-18 16:56:14,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:56:14,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-18 16:56:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:14,688 INFO L225 Difference]: With dead ends: 1980 [2018-11-18 16:56:14,688 INFO L226 Difference]: Without dead ends: 943 [2018-11-18 16:56:14,693 INFO L604 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-18 16:56:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-11-18 16:56:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 895. [2018-11-18 16:56:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-11-18 16:56:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1239 transitions. [2018-11-18 16:56:14,739 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1239 transitions. Word has length 70 [2018-11-18 16:56:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:14,740 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1239 transitions. [2018-11-18 16:56:14,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:56:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1239 transitions. [2018-11-18 16:56:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 16:56:14,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:14,741 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:14,742 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:14,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash -432744713, now seen corresponding path program 1 times [2018-11-18 16:56:14,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:14,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:14,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:14,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:14,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:56:14,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:56:14,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:56:14,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:14,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:56:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:14,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:56:14,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-18 16:56:14,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:56:14,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:56:14,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:56:14,958 INFO L87 Difference]: Start difference. First operand 895 states and 1239 transitions. Second operand 7 states. [2018-11-18 16:56:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:15,320 INFO L93 Difference]: Finished difference Result 2518 states and 3738 transitions. [2018-11-18 16:56:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:56:15,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-18 16:56:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:15,327 INFO L225 Difference]: With dead ends: 2518 [2018-11-18 16:56:15,327 INFO L226 Difference]: Without dead ends: 1212 [2018-11-18 16:56:15,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 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-18 16:56:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2018-11-18 16:56:15,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 956. [2018-11-18 16:56:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2018-11-18 16:56:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1300 transitions. [2018-11-18 16:56:15,400 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1300 transitions. Word has length 91 [2018-11-18 16:56:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:15,401 INFO L480 AbstractCegarLoop]: Abstraction has 956 states and 1300 transitions. [2018-11-18 16:56:15,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:56:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1300 transitions. [2018-11-18 16:56:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 16:56:15,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:15,403 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:15,403 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:15,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:15,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1329265355, now seen corresponding path program 1 times [2018-11-18 16:56:15,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:15,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:15,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:15,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:15,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:56:15,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:56:15,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:56:15,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:15,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:56:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:56:15,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:56:15,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-11-18 16:56:15,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:56:15,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:56:15,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:56:15,753 INFO L87 Difference]: Start difference. First operand 956 states and 1300 transitions. Second operand 12 states. [2018-11-18 16:56:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:16,950 INFO L93 Difference]: Finished difference Result 3410 states and 6158 transitions. [2018-11-18 16:56:16,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 16:56:16,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2018-11-18 16:56:16,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:16,964 INFO L225 Difference]: With dead ends: 3410 [2018-11-18 16:56:16,964 INFO L226 Difference]: Without dead ends: 3407 [2018-11-18 16:56:16,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-11-18 16:56:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2018-11-18 16:56:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3336. [2018-11-18 16:56:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-18 16:56:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 5960 transitions. [2018-11-18 16:56:17,147 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 5960 transitions. Word has length 104 [2018-11-18 16:56:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:17,148 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 5960 transitions. [2018-11-18 16:56:17,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:56:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 5960 transitions. [2018-11-18 16:56:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 16:56:17,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:17,151 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:17,151 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:17,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:17,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1300373116, now seen corresponding path program 2 times [2018-11-18 16:56:17,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:17,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:17,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:17,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-18 16:56:17,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:56:17,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:56:17,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:56:17,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:56:17,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:56:17,185 INFO L87 Difference]: Start difference. First operand 3336 states and 5960 transitions. Second operand 3 states. [2018-11-18 16:56:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:17,310 INFO L93 Difference]: Finished difference Result 5349 states and 10253 transitions. [2018-11-18 16:56:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:56:17,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-11-18 16:56:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:17,321 INFO L225 Difference]: With dead ends: 5349 [2018-11-18 16:56:17,321 INFO L226 Difference]: Without dead ends: 2790 [2018-11-18 16:56:17,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:56:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2018-11-18 16:56:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2760. [2018-11-18 16:56:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2018-11-18 16:56:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4478 transitions. [2018-11-18 16:56:17,494 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 4478 transitions. Word has length 131 [2018-11-18 16:56:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:17,494 INFO L480 AbstractCegarLoop]: Abstraction has 2760 states and 4478 transitions. [2018-11-18 16:56:17,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:56:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 4478 transitions. [2018-11-18 16:56:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 16:56:17,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:56:17,498 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:56:17,499 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:56:17,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:56:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash -546509726, now seen corresponding path program 1 times [2018-11-18 16:56:17,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:56:17,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:56:17,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:17,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:56:17,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:56:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:17,621 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 23 proven. 23 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 16:56:17,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:56:17,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:56:17,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:56:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:56:17,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:56:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 16:56:17,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:56:17,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-18 16:56:17,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:56:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:56:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:56:17,798 INFO L87 Difference]: Start difference. First operand 2760 states and 4478 transitions. Second operand 9 states. [2018-11-18 16:56:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:56:18,512 INFO L93 Difference]: Finished difference Result 3599 states and 6279 transitions. [2018-11-18 16:56:18,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 16:56:18,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 182 [2018-11-18 16:56:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:56:18,514 INFO L225 Difference]: With dead ends: 3599 [2018-11-18 16:56:18,514 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:56:18,532 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-18 16:56:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:56:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:56:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:56:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:56:18,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2018-11-18 16:56:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:56:18,533 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:56:18,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:56:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:56:18,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:56:18,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 16:56:18,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:18,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:18,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:18,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:18,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:18,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:18,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:18,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:18,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:18,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:18,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:19,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:20,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:21,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:21,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:21,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:56:21,468 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2018-11-18 16:56:21,729 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2018-11-18 16:56:22,176 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 78 [2018-11-18 16:56:22,546 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 80 [2018-11-18 16:56:22,913 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 72 [2018-11-18 16:56:23,259 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-11-18 16:56:23,383 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 36 [2018-11-18 16:56:23,693 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2018-11-18 16:56:24,728 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 175 DAG size of output: 117 [2018-11-18 16:56:24,991 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-11-18 16:56:25,131 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2018-11-18 16:56:25,663 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 87 [2018-11-18 16:56:26,643 WARN L180 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 117 [2018-11-18 16:56:27,190 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2018-11-18 16:56:27,476 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 93 [2018-11-18 16:56:27,690 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2018-11-18 16:56:28,696 WARN L180 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 117 [2018-11-18 16:56:28,969 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-11-18 16:56:29,214 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 44 [2018-11-18 16:56:30,057 WARN L180 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 106 [2018-11-18 16:56:30,454 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 72 [2018-11-18 16:56:30,780 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2018-11-18 16:56:30,783 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2018-11-18 16:56:30,783 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-11-18 16:56:30,783 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2018-11-18 16:56:30,783 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2018-11-18 16:56:30,783 INFO L428 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: true [2018-11-18 16:56:30,783 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2018-11-18 16:56:30,783 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2018-11-18 16:56:30,783 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2018-11-18 16:56:30,783 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= ~p_dw_i~0 1)) (= ~p_dw_pc~0 2) (= ~p_dw_st~0 0) (not (= ~q_free~0 1)) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_pc~0 1) (not (= 0 ~c_num_read~0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2018-11-18 16:56:30,783 INFO L425 ceAbstractionStarter]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2018-11-18 16:56:30,784 INFO L421 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) (and (not (= ~c_dr_pc~0 1)) (= ~q_free~0 1) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (not (= ~p_dw_pc~0 2)) (= ~c_num_read~0 0) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-18 16:56:30,784 INFO L421 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) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and (not (= ~c_dr_pc~0 1)) (= ~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)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-18 16:56:30,784 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2018-11-18 16:56:30,784 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2018-11-18 16:56:30,784 INFO L425 ceAbstractionStarter]: For program point L355(line 355) no Hoare annotation was computed. [2018-11-18 16:56:30,784 INFO L421 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) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and (not (= ~c_dr_pc~0 1)) (= ~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)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-18 16:56:30,784 INFO L421 ceAbstractionStarter]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse24 (= ~p_dw_i~0 1))) (let ((.cse16 (= ~q_free~0 0)) (.cse17 (<= 2 ~p_dw_st~0)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse24)) (.cse21 (not .cse7)) (.cse22 (not (= ~c_dr_pc~0 1))) (.cse23 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse18 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= 1 ~p_dw_pc~0))) (let ((.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (and .cse22 .cse23 (not (= ~c_dr_st~0 0)) .cse24 .cse18 .cse20)) (.cse9 (or .cse0 .cse1 .cse2 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) .cse21)) (.cse11 (= |old(~p_dw_pc~0)| 2)) (.cse10 (and .cse16 .cse17 (= 1 ~p_num_write~0) .cse18 .cse20)) (.cse13 (not (= 0 ~c_num_read~0))) (.cse12 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (not (= 2 |old(~c_dr_st~0)|))) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse6 (= |old(~p_dw_st~0)| 2)) (.cse15 (and .cse22 .cse23 (= 2 ~c_dr_st~0) .cse24 .cse18 .cse20)) (.cse8 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse3 .cse5 .cse6) (or .cse10 .cse1 .cse2 .cse11 .cse4 .cse12 .cse0 .cse6 .cse7 .cse13 .cse8) (or .cse9 .cse14 .cse6 .cse15) (or (let ((.cse19 (+ |old(~p_num_write~0)| 1))) (and .cse16 .cse17 .cse18 (<= .cse19 ~p_num_write~0) .cse20 (<= ~p_num_write~0 .cse19))) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 (or .cse2 .cse21)) .cse14 .cse6 (< ~c_num_read~0 |old(~p_num_write~0)|)) .cse15) (or (or .cse1 .cse2 .cse4 .cse8) .cse11 .cse14 .cse10 .cse6 .cse15 .cse13 .cse12) (or .cse0 .cse1 .cse2 .cse14 .cse4 .cse6 .cse7 .cse15 .cse8))))) [2018-11-18 16:56:30,784 INFO L421 ceAbstractionStarter]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse12 (= |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 .cse12))) (let ((.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse15 (= |old(~p_dw_pc~0)| 2)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= 0 ~p_num_write~0)) (.cse16 (not (= 0 ~c_num_read~0))) (.cse17 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (or .cse0 .cse1 .cse2 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) .cse21)) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse13 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~q_free~0 |old(~q_free~0)|)) (.cse6 (not (= ~p_dw_st~0 2))) (.cse19 (= 2 ~c_dr_st~0)) (.cse9 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse20 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) (or .cse14 .cse3 (and .cse6 .cse8 .cse10 .cse11 (= 1 ~p_dw_pc~0)) .cse5) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse12 .cse16 .cse17 (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse18) .cse13) (or (or .cse1 .cse2 .cse4 .cse12 .cse13) .cse15 (and .cse19 .cse10 .cse11 .cse6 .cse7 .cse9 .cse18) .cse20 .cse5 .cse16 .cse17) (or .cse14 .cse20 .cse19 .cse5) (or .cse0 .cse1 .cse2 .cse20 .cse19 .cse4 .cse5 .cse12 .cse13) (or (and (and (and .cse11 .cse10) (= ~p_num_write~0 |old(~p_num_write~0)|) .cse6 .cse19) .cse9) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 (or .cse2 .cse21)) .cse20 .cse5 (< ~c_num_read~0 |old(~p_num_write~0)|))))))) [2018-11-18 16:56:30,785 INFO L421 ceAbstractionStarter]: At program point L124(line 124) the Hoare annotation is: (let ((.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse24 (= ~p_dw_i~0 1))) (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse24)) (.cse20 (not .cse7)) (.cse10 (not (= ~p_dw_st~0 2))) (.cse1 (= 2 ~c_dr_st~0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= 1 ~p_dw_pc~0))) (let ((.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse19 (and (not (= ~c_dr_pc~0 1)) .cse10 .cse1 .cse24 .cse13 .cse17)) (.cse14 (= |old(~p_dw_pc~0)| 2)) (.cse16 (not (= 0 |old(~p_num_write~0)|))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse9 (= ~q_free~0 0)) (.cse11 (= 1 ~p_num_write~0)) (.cse12 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse5 (not (= |old(~q_free~0)| 1))) (.cse8 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse21 (or .cse0 .cse2 .cse3 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) .cse20)) (.cse23 (not (= ~c_dr_st~0 0))) (.cse22 (= 0 |old(~c_dr_st~0)|)) (.cse6 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (or .cse2 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse1 .cse12 .cse13) .cse14 .cse4 .cse6 .cse15 .cse16) (or (let ((.cse18 (+ |old(~p_num_write~0)| 1))) (and .cse9 (and .cse10 .cse1 .cse13 .cse17) (<= .cse18 ~p_num_write~0) (<= ~p_num_write~0 .cse18))) .cse19 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse2 (or .cse3 .cse20)) .cse4 .cse6 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse21 .cse4 .cse19 .cse6) (or .cse2 .cse3 .cse14 .cse5 .cse16 .cse0 .cse6 .cse7 .cse15 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse8) (or .cse0 .cse2 .cse3 .cse22 .cse5 .cse6 .cse7 .cse8 (and .cse10 (not (= ~p_dw_pc~0 1)) .cse23 .cse13)) (or .cse21 (and .cse10 .cse23 .cse13 .cse17) .cse22 .cse6))))) [2018-11-18 16:56:30,785 INFO L425 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-11-18 16:56:30,785 INFO L425 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2018-11-18 16:56:30,785 INFO L425 ceAbstractionStarter]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2018-11-18 16:56:30,785 INFO L421 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse22 (= ~p_dw_i~0 1))) (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse22)) (.cse13 (not .cse7)) (.cse9 (not (= ~p_dw_st~0 2))) (.cse1 (= 2 ~c_dr_st~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= 1 ~p_dw_pc~0))) (let ((.cse12 (and (not (= ~c_dr_pc~0 1)) .cse9 .cse1 .cse22 .cse10 .cse21)) (.cse16 (= |old(~p_dw_pc~0)| 2)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse15 (= 0 ~p_num_write~0)) (.cse18 (not (= 0 ~c_num_read~0))) (.cse17 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (not (= |old(~q_free~0)| 1))) (.cse8 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse14 (or .cse0 .cse2 .cse3 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) .cse13)) (.cse20 (not (= ~c_dr_st~0 0))) (.cse19 (= 0 |old(~c_dr_st~0)|)) (.cse6 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and (and (= ~p_num_write~0 |old(~p_num_write~0)|) (and .cse9 .cse1 .cse10)) .cse11) .cse12 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse2 (or .cse3 .cse13)) .cse4 .cse6 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse14 .cse4 .cse12 .cse6) (or .cse2 .cse3 (and .cse9 .cse11 .cse10 .cse15) .cse16 .cse5 .cse17 .cse0 .cse6 .cse7 .cse18 .cse8) (or (or .cse2 .cse3 .cse5 .cse7 .cse8) .cse16 .cse4 (and .cse9 .cse1 .cse11 .cse10 .cse15) .cse6 .cse18 .cse17) (or .cse0 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 (and .cse9 (not (= ~p_dw_pc~0 1)) .cse20 .cse10)) (or .cse14 (and .cse9 .cse20 .cse10 .cse21) .cse19 .cse6))))) [2018-11-18 16:56:30,785 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 127) no Hoare annotation was computed. [2018-11-18 16:56:30,785 INFO L421 ceAbstractionStarter]: At program point L107-2(lines 95 132) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_pc~0)| 1)) (.cse27 (= ~p_dw_i~0 1))) (let ((.cse18 (= 1 ~c_dr_pc~0)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse27)) (.cse24 (not .cse3)) (.cse21 (= ~q_free~0 0)) (.cse12 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse9 (not (= ~p_dw_st~0 2))) (.cse11 (= 2 ~c_dr_st~0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (= 1 ~p_dw_pc~0))) (let ((.cse20 (and (not (= ~c_dr_pc~0 1)) .cse9 .cse11 .cse27 .cse13 .cse23)) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (= |old(~p_dw_pc~0)| 2)) (.cse17 (not (= 0 |old(~p_num_write~0)|))) (.cse8 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= 0 ~p_num_write~0)) (.cse16 (not (= 0 ~c_num_read~0))) (.cse7 (and .cse21 .cse9 (= 1 ~p_num_write~0) .cse12 .cse13)) (.cse2 (not (= |old(~q_free~0)| 1))) (.cse4 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse19 (or .cse18 .cse0 .cse1 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) .cse24)) (.cse26 (not (= ~c_dr_st~0 0))) (.cse25 (= 0 |old(~c_dr_st~0)|)) (.cse15 (= |old(~p_dw_st~0)| 2))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16 .cse17) (or .cse18 .cse11 .cse0 .cse1 .cse6 .cse2 .cse15 .cse3 .cse4) (or .cse19 .cse6 .cse20 .cse15) (or (let ((.cse22 (+ |old(~p_num_write~0)| 1))) (and .cse21 (<= .cse22 ~p_num_write~0) (and .cse9 .cse13 .cse23) (<= ~p_num_write~0 .cse22))) .cse20 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse0 (or .cse1 .cse24)) .cse6 .cse15 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse0 .cse1 .cse5 .cse2 .cse17 .cse18 (and .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) .cse15 .cse3 .cse16 .cse7 .cse4) (or .cse18 .cse0 .cse1 .cse25 .cse2 .cse15 .cse3 .cse4 (and .cse9 (not (= ~p_dw_pc~0 1)) .cse26 .cse13)) (or .cse19 (and .cse9 .cse26 .cse13 .cse23) .cse25 .cse15))))) [2018-11-18 16:56:30,785 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2018-11-18 16:56:30,785 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-11-18 16:56:30,785 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-11-18 16:56:30,785 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-11-18 16:56:30,785 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-11-18 16:56:30,786 INFO L421 ceAbstractionStarter]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse5 (not (= ~p_dw_st~0 2))) (.cse16 (= 2 ~c_dr_st~0)) (.cse8 (= ~p_dw_pc~0 1))) (let ((.cse14 (not (= ~c_dr_st~0 0))) (.cse12 (not .cse8)) (.cse15 (= 0 |old(~c_dr_st~0)|)) (.cse13 (and .cse5 .cse16)) (.cse3 (= ~p_dw_pc~0 2)) (.cse4 (not (= ~q_free~0 0))) (.cse6 (not (= 1 ~p_num_write~0))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse11 (not (= 2 |old(~c_dr_st~0)|))) (.cse7 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse10) (or .cse11 (or .cse1 .cse2 .cse12) .cse7) .cse4 (< .cse10 ~p_num_write~0) .cse13)) (or (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 (and (<= 2 ~p_dw_st~0) .cse14) .cse15 .cse12 (not (= ~q_free~0 1)) (< ~c_num_read~0 ~p_num_write~0) (< |old(~p_dw_st~0)| 2) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 .cse1 .cse2 .cse15 .cse7 (and .cse5 .cse14)) (or (= ~p_dw_st~0 0) (or .cse0 .cse1 .cse2 .cse12) .cse15 (not (= |old(~p_dw_st~0)| 0))) (or .cse1 .cse2 .cse13 .cse3 .cse4 .cse11 .cse6 .cse7 .cse9) (or .cse0 .cse1 .cse2 .cse16 .cse11 .cse7)))) [2018-11-18 16:56:30,786 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2018-11-18 16:56:30,786 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-18 16:56:30,786 INFO L425 ceAbstractionStarter]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2018-11-18 16:56:30,786 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2018-11-18 16:56:30,786 INFO L425 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2018-11-18 16:56:30,786 INFO L421 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (let ((.cse5 (not (= ~p_dw_st~0 2))) (.cse16 (= 2 ~c_dr_st~0)) (.cse8 (= ~p_dw_pc~0 1))) (let ((.cse14 (not (= ~c_dr_st~0 0))) (.cse12 (not .cse8)) (.cse15 (= 0 |old(~c_dr_st~0)|)) (.cse13 (and .cse5 .cse16)) (.cse3 (= ~p_dw_pc~0 2)) (.cse4 (not (= ~q_free~0 0))) (.cse6 (not (= 1 ~p_num_write~0))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse11 (not (= 2 |old(~c_dr_st~0)|))) (.cse7 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse10) (or .cse11 (or .cse1 .cse2 .cse12) .cse7) .cse4 (< .cse10 ~p_num_write~0) .cse13)) (or (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 (and (<= 2 ~p_dw_st~0) .cse14) .cse15 .cse12 (not (= ~q_free~0 1)) (< ~c_num_read~0 ~p_num_write~0) (< |old(~p_dw_st~0)| 2) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 .cse1 .cse2 .cse15 .cse7 (and .cse5 .cse14)) (or (= ~p_dw_st~0 0) (or .cse0 .cse1 .cse2 .cse12) .cse15 (not (= |old(~p_dw_st~0)| 0))) (or .cse1 .cse2 .cse13 .cse3 .cse4 .cse11 .cse6 .cse7 .cse9) (or .cse0 .cse1 .cse2 .cse16 .cse11 .cse7)))) [2018-11-18 16:56:30,786 INFO L421 ceAbstractionStarter]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse7 (= ~p_dw_pc~0 1))) (let ((.cse9 (= immediate_notify_threads_~tmp~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse13 (not .cse7))) (let ((.cse17 (or .cse0 .cse1 .cse2 .cse13)) (.cse14 (or .cse9 .cse16)) (.cse3 (= ~p_dw_pc~0 2)) (.cse4 (not (= ~q_free~0 0))) (.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 0 ~c_num_read~0))) (.cse15 (= 2 ~c_dr_st~0)) (.cse6 (= |old(~p_dw_st~0)| 2)) (.cse10 (not (= ~p_dw_st~0 2))) (.cse18 (= 0 |old(~c_dr_st~0)|)) (.cse19 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10)) (let ((.cse11 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse11) (or .cse12 (or .cse1 .cse2 .cse13) .cse6) .cse4 (< .cse11 ~p_num_write~0) (and .cse14 .cse10 .cse15))) (or .cse0 .cse1 .cse2 .cse12 .cse6 .cse15) (or .cse16 .cse17 .cse18 (not (= |old(~p_dw_st~0)| 0))) (or .cse17 .cse18 .cse6 (and .cse10 .cse19 .cse14)) (or .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 (and .cse15 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse18 .cse6 .cse7 (and .cse9 .cse10 .cse19)) (or (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 .cse18 .cse13 (not (= ~q_free~0 1)) (and .cse16 .cse19) (and (<= 2 ~p_dw_st~0) .cse9 .cse19) (< ~c_num_read~0 ~p_num_write~0) (< |old(~p_dw_st~0)| 2) (not (= ~c_last_read~0 ~p_last_write~0))))))) [2018-11-18 16:56:30,787 INFO L425 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2018-11-18 16:56:30,787 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:56:30,787 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p_num_write~0 |old(~p_num_write~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_free~0 |old(~q_free~0)|)) [2018-11-18 16:56:30,787 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:56:30,787 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse23 (= |old(~p_dw_pc~0)| 1))) (let ((.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse30 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse6 (not .cse23)) (.cse29 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= 2 ~c_dr_st~0)) (.cse27 (= ~q_free~0 |old(~q_free~0)|)) (.cse28 (= ~p_last_write~0 ~q_buf_0~0)) (.cse39 (+ |old(~c_num_read~0)| 1))) (let ((.cse15 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse12 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse0 (< |old(~p_num_write~0)| .cse39)) (.cse11 (or (and .cse29 .cse22 .cse27 .cse28) (and .cse25 .cse22 .cse27 .cse28))) (.cse4 (< .cse39 |old(~p_num_write~0)|)) (.cse16 (and (or .cse1 .cse2 .cse19 .cse6 .cse24) (or .cse1 .cse2 .cse19 .cse30 .cse6))) (.cse7 (not (= ~c_dr_st~0 0))) (.cse32 (= 1 ~p_dw_pc~0)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse35 (= |old(~p_dw_pc~0)| 2)) (.cse38 (not (= ~c_dr_pc~0 1))) (.cse26 (= ~p_dw_st~0 0)) (.cse33 (= ~c_num_read~0 0)) (.cse14 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse34 (= 0 ~p_num_write~0)) (.cse20 (not (= |old(~q_free~0)| 1))) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse36 (not (= 0 |old(~c_num_read~0)|))) (.cse37 (not (= 0 |old(~p_num_write~0)|))) (.cse18 (= 1 |old(~c_dr_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16 .cse17 .cse8) (or .cse18 .cse1 .cse2 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse15 (and .cse9 .cse10 .cse12 (or (and .cse25 .cse26 .cse22 .cse27 .cse28) (and .cse29 .cse26 .cse22 .cse27 .cse28)) .cse14) (and (or .cse1 .cse2 .cse19 .cse6 .cse21 .cse24) (or .cse1 .cse2 .cse19 .cse30 .cse6 .cse21)) .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 (let ((.cse31 (+ ~c_num_read~0 1))) (and (<= .cse31 ~p_num_write~0) .cse12 .cse13 (<= ~p_num_write~0 .cse31) .cse27 .cse28 .cse32))) (or (and .cse26 .cse22 .cse27 .cse28 .cse33 .cse25 .cse14 .cse34) .cse1 .cse2 .cse35 .cse19 .cse20 .cse21 .cse36 .cse37 .cse24) (or .cse0 .cse11 .cse3 .cse4 .cse16 .cse8) (or .cse18 .cse1 .cse2 .cse5 .cse20 .cse21 .cse23 (and .cse38 .cse25 .cse26 .cse7 .cse14 .cse27 .cse28) .cse24) (or .cse18 .cse1 .cse2 .cse30 .cse5 .cse6 (and .cse38 .cse7 .cse27 .cse28 .cse32)) (or .cse38 .cse18 .cse1 .cse2 .cse3 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse36 .cse8) (or .cse18 .cse1 .cse2 .cse26 .cse30 .cse5 .cse6 .cse21) (or .cse18 .cse1 .cse2 .cse35 (and .cse38 .cse26 .cse27 .cse28 .cse33 .cse25 .cse14 .cse34) .cse20 .cse21 .cse23 .cse36 .cse37 .cse24) (or .cse18 .cse1 .cse2 .cse19 .cse30 .cse6 .cse22))))) [2018-11-18 16:56:30,787 INFO L421 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (let ((.cse35 (= 1 ~p_dw_pc~0)) (.cse12 (= |old(~p_dw_pc~0)| 1)) (.cse36 (+ |old(~c_num_read~0)| 1)) (.cse22 (= ~c_num_read~0 0)) (.cse4 (= 2 ~c_dr_st~0)) (.cse25 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse26 (= 0 ~p_num_write~0)) (.cse19 (not (= ~c_dr_pc~0 1))) (.cse20 (= ~q_free~0 1)) (.cse23 (not (= ~p_dw_st~0 2))) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse33 (not (= ~c_dr_st~0 0))) (.cse21 (= ~p_last_write~0 ~q_buf_0~0)) (.cse34 (= ~p_dw_i~0 1))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (and .cse19 .cse20 .cse23 (not (= ~p_dw_pc~0 1)) .cse24 .cse33 .cse21 .cse34)) (.cse17 (= |old(~p_dw_pc~0)| 2)) (.cse10 (not (= |old(~q_free~0)| 1))) (.cse18 (not (= 0 |old(~p_num_write~0)|))) (.cse11 (not (= |old(~p_dw_st~0)| 0))) (.cse27 (and (not (= ~p_dw_pc~0 2)) .cse22 .cse20 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse23 .cse24 .cse4 .cse25 .cse34 .cse21 .cse26)) (.cse28 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse13 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse16 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse30 (< |old(~p_num_write~0)| .cse36)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse34)) (.cse32 (< .cse36 |old(~p_num_write~0)|)) (.cse6 (not .cse12)) (.cse15 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (and .cse21 .cse34 .cse35) .cse23 .cse4)) (.cse31 (not (= |old(~q_free~0)| 0))) (.cse8 (and .cse23 .cse33 (and .cse19 (not (= ~q_free~0 ~p_dw_pc~0)) .cse21 .cse34 .cse35))) (.cse29 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse8 .cse15 (and (or .cse1 .cse2 .cse3 .cse6 .cse11 .cse13) (or .cse1 .cse2 .cse3 .cse5 .cse6 .cse11)) .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse4 .cse13) (or .cse0 .cse1 .cse2 .cse8 .cse5 .cse9 .cse6) (or .cse1 .cse2 .cse17 .cse10 .cse15 .cse18 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse0 .cse7 .cse8 .cse11 .cse27 .cse12 .cse28 .cse13) (or .cse1 .cse2 .cse17 .cse15 .cse10 .cse18 .cse3 .cse8 .cse11 .cse27 .cse28 .cse13) (or .cse14 .cse8 (and (or .cse1 .cse2 .cse3 .cse6 .cse13) (or .cse1 .cse2 .cse3 .cse5 .cse6)) .cse16 .cse29) (or .cse30 .cse1 .cse2 .cse31 .cse32 .cse9 .cse8 .cse6 .cse29) (or .cse30 .cse1 .cse2 .cse32 .cse6 .cse15 .cse31 .cse8 .cse29)))) [2018-11-18 16:56:30,787 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2018-11-18 16:56:30,787 INFO L425 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2018-11-18 16:56:30,787 INFO L425 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-11-18 16:56:30,788 INFO L421 ceAbstractionStarter]: At program point L238(line 238) the Hoare annotation is: (let ((.cse23 (= |old(~p_dw_pc~0)| 1)) (.cse45 (+ ~c_num_read~0 1)) (.cse48 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse39 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= 2 ~c_dr_st~0)) (.cse46 (= ~p_dw_i~0 1)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse47 (= 1 ~p_dw_pc~0))) (let ((.cse25 (<= ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 ~c_num_read~0)) (.cse44 (and .cse39 .cse22 .cse46 .cse37 .cse47)) (.cse43 (and .cse48 .cse22 .cse46 .cse37 .cse47)) (.cse8 (<= .cse45 ~p_num_write~0)) (.cse28 (<= 2 ~p_dw_st~0)) (.cse38 (= ~c_num_read~0 0)) (.cse40 (= 0 ~p_num_write~0)) (.cse34 (not (= ~c_dr_pc~0 1))) (.cse35 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse29 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse46)) (.cse20 (not (= 2 |old(~c_dr_st~0)|))) (.cse30 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse4 (not .cse23)) (.cse36 (= ~q_free~0 |old(~q_free~0)|)) (.cse49 (+ |old(~c_num_read~0)| 1))) (let ((.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse14 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse17 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse0 (< |old(~p_num_write~0)| .cse49)) (.cse27 (or (and .cse48 .cse22 .cse36 .cse37) (and .cse39 .cse22 .cse36 .cse37))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse3 (< .cse49 |old(~p_num_write~0)|)) (.cse12 (and (or .cse1 .cse2 .cse20 .cse4 .cse24) (or .cse1 .cse2 .cse20 .cse30 .cse4))) (.cse11 (< |old(~p_dw_st~0)| 2)) (.cse19 (= 1 |old(~c_dr_pc~0)|)) (.cse31 (and .cse34 (= ~q_free~0 1) (not (= ~p_dw_pc~0 1)) .cse39 .cse35 .cse10 .cse29 .cse36 .cse46 .cse37)) (.cse32 (and .cse35 .cse22 .cse36 .cse37 .cse38 .cse39 .cse29 .cse40)) (.cse33 (= |old(~p_dw_pc~0)| 2)) (.cse5 (and .cse34 .cse48 .cse10 .cse46 .cse37 .cse47)) (.cse21 (not (= |old(~q_free~0)| 1))) (.cse41 (not (= 0 |old(~c_num_read~0)|))) (.cse18 (and (= ~q_free~0 0) .cse8 .cse28 (<= ~p_num_write~0 .cse45) .cse46 .cse37 .cse47)) (.cse42 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (and .cse25 .cse26 (or .cse44 .cse43) (= 0 ~p_dw_st~0))) (.cse16 (and .cse25 .cse26 (or .cse43 .cse44) .cse28)) (.cse15 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10) .cse11) (or .cse5 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse16 .cse11 .cse18) (or .cse19 .cse1 .cse2 .cse20 .cse21 .cse15 .cse22 .cse23 .cse24) (or (and .cse25 .cse26 .cse27 .cse9 .cse28 .cse29) .cse14 .cse12 .cse5 .cse17 .cse11) (or .cse19 .cse1 .cse2 .cse30 .cse7 .cse5 .cse4) (or .cse19 .cse1 .cse2 .cse7 .cse5 .cse21 .cse15 .cse23 .cse31 .cse24) (or .cse19 .cse1 .cse2 .cse20 .cse30 .cse4 .cse22) (or .cse0 .cse27 .cse6 .cse3 .cse12 .cse5 .cse11) (or .cse32 .cse2 .cse33 .cse5 .cse21 .cse19 (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse29 .cse40) .cse23 .cse41 .cse31 .cse18 .cse24 .cse1 .cse42 .cse13 .cse15 .cse16) (or .cse32 .cse2 .cse33 .cse5 .cse21 .cse20 .cse41 .cse18 .cse24 .cse1 .cse42 .cse13 .cse16 .cse15))))) [2018-11-18 16:56:30,788 INFO L421 ceAbstractionStarter]: At program point L269(line 269) the Hoare annotation is: (let ((.cse13 (= |old(~p_dw_pc~0)| 1)) (.cse23 (+ |old(~c_num_read~0)| 1)) (.cse22 (not (= ~c_dr_st~0 0))) (.cse24 (= ~p_dw_i~0 1)) (.cse21 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse0 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse7 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse18 (= |old(~p_dw_pc~0)| 2)) (.cse11 (not (= |old(~q_free~0)| 1))) (.cse14 (let ((.cse25 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse25 ~p_num_write~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse25) .cse22 .cse24 .cse21 (= 1 ~p_dw_pc~0)))) (.cse19 (not (= 0 |old(~p_num_write~0)|))) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse12 (not (= |old(~p_dw_st~0)| 0))) (.cse20 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse9 (= 1 |old(~c_dr_pc~0)|)) (.cse6 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse15 (< |old(~p_num_write~0)| .cse23)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse24)) (.cse16 (not (= |old(~q_free~0)| 0))) (.cse17 (< .cse23 |old(~p_num_write~0)|)) (.cse10 (= 0 |old(~c_dr_st~0)|)) (.cse4 (not .cse13)) (.cse8 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse2 .cse3 .cse6 .cse4)) .cse7 .cse8) (or .cse9 .cse1 .cse2 .cse10 .cse11 .cse12 .cse13 .cse5) (or .cse0 .cse14 (and (or .cse1 .cse2 .cse3 .cse4 .cse12 .cse5) (or .cse1 .cse2 .cse3 .cse6 .cse4 .cse12)) .cse7) (or .cse15 .cse1 .cse2 .cse16 .cse17 .cse4 .cse14 .cse8) (or .cse1 .cse2 .cse18 .cse11 .cse14 .cse19 .cse9 .cse12 .cse13 .cse20 .cse5 (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_st~0 0) (= ~q_free~0 |old(~q_free~0)|) .cse21 (= ~c_num_read~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse22 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0))) (or .cse1 .cse2 .cse18 .cse11 .cse14 .cse19 .cse3 .cse12 .cse20 .cse5) (or .cse9 .cse1 .cse2 .cse6 .cse10 .cse4) (or .cse15 .cse1 .cse2 .cse16 .cse17 .cse10 .cse4 .cse8)))) [2018-11-18 16:56:30,788 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2018-11-18 16:56:30,788 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2018-11-18 16:56:30,788 INFO L425 ceAbstractionStarter]: For program point L247(lines 237 277) no Hoare annotation was computed. [2018-11-18 16:56:30,789 INFO L421 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse23 (= |old(~p_dw_pc~0)| 1)) (.cse45 (+ ~c_num_read~0 1)) (.cse48 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse39 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= 2 ~c_dr_st~0)) (.cse46 (= ~p_dw_i~0 1)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse47 (= 1 ~p_dw_pc~0))) (let ((.cse25 (<= ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 ~c_num_read~0)) (.cse44 (and .cse39 .cse22 .cse46 .cse37 .cse47)) (.cse43 (and .cse48 .cse22 .cse46 .cse37 .cse47)) (.cse8 (<= .cse45 ~p_num_write~0)) (.cse28 (<= 2 ~p_dw_st~0)) (.cse38 (= ~c_num_read~0 0)) (.cse40 (= 0 ~p_num_write~0)) (.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse46)) (.cse20 (not (= 2 |old(~c_dr_st~0)|))) (.cse30 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse4 (not .cse23)) (.cse49 (+ |old(~c_num_read~0)| 1)) (.cse34 (not (= ~c_dr_pc~0 1))) (.cse35 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse29 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= ~q_free~0 |old(~q_free~0)|))) (let ((.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse14 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse17 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse31 (and .cse34 (= ~q_free~0 1) (not (= ~p_dw_pc~0 1)) .cse39 .cse35 .cse10 .cse29 .cse36 .cse46 .cse37)) (.cse19 (= 1 |old(~c_dr_pc~0)|)) (.cse0 (< |old(~p_num_write~0)| .cse49)) (.cse27 (or (and .cse48 .cse22 .cse36 .cse37) (and .cse39 .cse22 .cse36 .cse37))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse3 (< .cse49 |old(~p_num_write~0)|)) (.cse12 (and (or .cse1 .cse2 .cse20 .cse4 .cse24) (or .cse1 .cse2 .cse20 .cse30 .cse4))) (.cse11 (< |old(~p_dw_st~0)| 2)) (.cse32 (and .cse35 .cse22 .cse36 .cse37 .cse38 .cse39 .cse29 .cse40)) (.cse33 (= |old(~p_dw_pc~0)| 2)) (.cse5 (and .cse34 .cse48 .cse10 .cse46 .cse37 .cse47)) (.cse21 (not (= |old(~q_free~0)| 1))) (.cse41 (not (= 0 |old(~c_num_read~0)|))) (.cse18 (and (= ~q_free~0 0) .cse8 .cse28 (<= ~p_num_write~0 .cse45) .cse46 .cse37 .cse47)) (.cse42 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (and .cse25 .cse26 (or .cse44 .cse43) (= 0 ~p_dw_st~0))) (.cse16 (and .cse25 .cse26 (or .cse43 .cse44) .cse28)) (.cse15 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10) .cse11) (or .cse5 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse16 .cse11 .cse18) (or .cse19 .cse1 .cse2 .cse20 .cse21 .cse15 .cse22 .cse23 .cse24) (or (and .cse25 .cse26 .cse27 .cse9 .cse28 .cse29) .cse14 .cse12 .cse5 .cse17 .cse11) (or .cse19 .cse1 .cse2 .cse30 .cse7 .cse5 .cse4) (or .cse19 .cse1 .cse2 .cse7 .cse5 .cse21 .cse15 .cse23 .cse31 .cse24) (or .cse32 .cse2 .cse33 .cse5 .cse21 .cse19 (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse29 .cse40) .cse23 .cse41 .cse31 .cse18 .cse24 .cse1 .cse42 .cse13 .cse15 .cse16) (or .cse19 .cse1 .cse2 .cse20 .cse30 .cse4 .cse22) (or .cse0 .cse27 .cse6 .cse3 .cse12 .cse5 .cse11) (or .cse32 .cse2 .cse33 .cse5 .cse21 .cse20 .cse41 .cse18 .cse24 .cse1 .cse42 .cse13 .cse16 .cse15))))) [2018-11-18 16:56:30,789 INFO L425 ceAbstractionStarter]: For program point L237-1(lines 237 277) no Hoare annotation was computed. [2018-11-18 16:56:30,789 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2018-11-18 16:56:30,789 INFO L421 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse23 (= |old(~p_dw_pc~0)| 1)) (.cse45 (+ ~c_num_read~0 1)) (.cse48 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse39 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= 2 ~c_dr_st~0)) (.cse46 (= ~p_dw_i~0 1)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse47 (= 1 ~p_dw_pc~0))) (let ((.cse25 (<= ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 ~c_num_read~0)) (.cse44 (and .cse39 .cse22 .cse46 .cse37 .cse47)) (.cse43 (and .cse48 .cse22 .cse46 .cse37 .cse47)) (.cse8 (<= .cse45 ~p_num_write~0)) (.cse28 (<= 2 ~p_dw_st~0)) (.cse38 (= ~c_num_read~0 0)) (.cse40 (= 0 ~p_num_write~0)) (.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse46)) (.cse20 (not (= 2 |old(~c_dr_st~0)|))) (.cse30 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse4 (not .cse23)) (.cse49 (+ |old(~c_num_read~0)| 1)) (.cse34 (not (= ~c_dr_pc~0 1))) (.cse35 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse29 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= ~q_free~0 |old(~q_free~0)|))) (let ((.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse14 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse17 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse31 (and .cse34 (= ~q_free~0 1) (not (= ~p_dw_pc~0 1)) .cse39 .cse35 .cse10 .cse29 .cse36 .cse46 .cse37)) (.cse19 (= 1 |old(~c_dr_pc~0)|)) (.cse0 (< |old(~p_num_write~0)| .cse49)) (.cse27 (or (and .cse48 .cse22 .cse36 .cse37) (and .cse39 .cse22 .cse36 .cse37))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse3 (< .cse49 |old(~p_num_write~0)|)) (.cse12 (and (or .cse1 .cse2 .cse20 .cse4 .cse24) (or .cse1 .cse2 .cse20 .cse30 .cse4))) (.cse11 (< |old(~p_dw_st~0)| 2)) (.cse32 (and .cse35 .cse22 .cse36 .cse37 .cse38 .cse39 .cse29 .cse40)) (.cse33 (= |old(~p_dw_pc~0)| 2)) (.cse5 (and .cse34 .cse48 .cse10 .cse46 .cse37 .cse47)) (.cse21 (not (= |old(~q_free~0)| 1))) (.cse41 (not (= 0 |old(~c_num_read~0)|))) (.cse18 (and (= ~q_free~0 0) .cse8 .cse28 (<= ~p_num_write~0 .cse45) .cse46 .cse37 .cse47)) (.cse42 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (and .cse25 .cse26 (or .cse44 .cse43) (= 0 ~p_dw_st~0))) (.cse16 (and .cse25 .cse26 (or .cse43 .cse44) .cse28)) (.cse15 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10) .cse11) (or .cse5 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse16 .cse11 .cse18) (or .cse19 .cse1 .cse2 .cse20 .cse21 .cse15 .cse22 .cse23 .cse24) (or (and .cse25 .cse26 .cse27 .cse9 .cse28 .cse29) .cse14 .cse12 .cse5 .cse17 .cse11) (or .cse19 .cse1 .cse2 .cse30 .cse7 .cse5 .cse4) (or .cse19 .cse1 .cse2 .cse7 .cse5 .cse21 .cse15 .cse23 .cse31 .cse24) (or .cse32 .cse2 .cse33 .cse5 .cse21 .cse19 (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse29 .cse40) .cse23 .cse41 .cse31 .cse18 .cse24 .cse1 .cse42 .cse13 .cse15 .cse16) (or .cse19 .cse1 .cse2 .cse20 .cse30 .cse4 .cse22) (or .cse0 .cse27 .cse6 .cse3 .cse12 .cse5 .cse11) (or .cse32 .cse2 .cse33 .cse5 .cse21 .cse20 .cse41 .cse18 .cse24 .cse1 .cse42 .cse13 .cse16 .cse15))))) [2018-11-18 16:56:30,789 INFO L425 ceAbstractionStarter]: For program point L290-1(line 290) no Hoare annotation was computed. [2018-11-18 16:56:30,789 INFO L428 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: true [2018-11-18 16:56:30,789 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2018-11-18 16:56:30,790 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2018-11-18 16:56:30,790 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2018-11-18 16:56:30,790 INFO L428 ceAbstractionStarter]: At program point L290(line 290) the Hoare annotation is: true [2018-11-18 16:56:30,790 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2018-11-18 16:56:30,790 INFO L421 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse3 (= 0 ~c_dr_st~0)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse5 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse4 (= ~p_dw_st~0 2)) (.cse6 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 .cse5 .cse3 (not .cse6) (not (= ~q_free~0 1)) (< ~c_num_read~0 ~p_num_write~0) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 .cse1 .cse2 (= ~p_dw_pc~0 2) (not (= ~q_free~0 0)) .cse5 (not (= 1 ~p_num_write~0)) .cse4 .cse6 (not (= 0 ~c_num_read~0))))) [2018-11-18 16:56:30,790 INFO L428 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2018-11-18 16:56:30,790 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2018-11-18 16:56:30,790 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2018-11-18 16:56:30,790 INFO L425 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2018-11-18 16:56:30,790 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2018-11-18 16:56:30,790 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2018-11-18 16:56:30,791 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_st~0 0) (= ~q_free~0 |old(~q_free~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)) (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-18 16:56:30,791 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2018-11-18 16:56:30,791 INFO L425 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2018-11-18 16:56:30,791 INFO L421 ceAbstractionStarter]: At program point L317(line 317) the Hoare annotation is: (let ((.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse8 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (let ((.cse3 (not (= ~c_dr_st~0 0))) (.cse1 (not (= ~c_dr_pc~0 1))) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~p_dw_st~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (and .cse2 .cse8 .cse0 .cse4 .cse5)) (.cse17 (and .cse10 .cse8 .cse0 .cse4 .cse5)) (.cse14 (<= 2 ~p_dw_st~0))) (or (not .cse0) (= |old(~p_dw_pc~0)| 2) (and .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~q_free~0)| 1)) (and .cse6 .cse7 .cse8 .cse4 .cse9 .cse10 .cse11 .cse12) (= 1 |old(~c_dr_pc~0)|) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse1 .cse6 (not (= ~p_dw_pc~0 1)) .cse10 .cse3 .cse7 .cse4) (let ((.cse13 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse13 ~p_num_write~0) .cse14 (<= ~p_num_write~0 .cse13) .cse4 .cse5)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse1 .cse6 .cse7 .cse4 .cse9 .cse10 .cse11 .cse12) (not (= 0 |old(~p_num_write~0)|)) (and .cse15 .cse16 (or .cse17 .cse18) (= 0 ~p_dw_st~0)) (not (= |old(~p_dw_st~0)| 0)) (and .cse15 .cse16 (or .cse18 .cse17) .cse14)))) [2018-11-18 16:56:30,791 INFO L421 ceAbstractionStarter]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse8 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (let ((.cse3 (not (= ~c_dr_st~0 0))) (.cse1 (not (= ~c_dr_pc~0 1))) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~p_dw_st~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (and .cse2 .cse8 .cse0 .cse4 .cse5)) (.cse17 (and .cse10 .cse8 .cse0 .cse4 .cse5)) (.cse14 (<= 2 ~p_dw_st~0))) (or (not .cse0) (= |old(~p_dw_pc~0)| 2) (and .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~q_free~0)| 1)) (and .cse6 .cse7 .cse8 .cse4 .cse9 .cse10 .cse11 .cse12) (= 1 |old(~c_dr_pc~0)|) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse1 .cse6 (not (= ~p_dw_pc~0 1)) .cse10 .cse3 .cse7 .cse4) (let ((.cse13 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse13 ~p_num_write~0) .cse14 (<= ~p_num_write~0 .cse13) .cse4 .cse5)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse1 .cse6 .cse7 .cse4 .cse9 .cse10 .cse11 .cse12) (not (= 0 |old(~p_num_write~0)|)) (and .cse15 .cse16 (or .cse17 .cse18) (= 0 ~p_dw_st~0)) (not (= |old(~p_dw_st~0)| 0)) (and .cse15 .cse16 (or .cse18 .cse17) .cse14)))) [2018-11-18 16:56:30,791 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2018-11-18 16:56:30,791 INFO L425 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2018-11-18 16:56:30,792 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 325) no Hoare annotation was computed. [2018-11-18 16:56:30,792 INFO L421 ceAbstractionStarter]: At program point L313-2(lines 310 325) the Hoare annotation is: (let ((.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse8 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (let ((.cse3 (not (= ~c_dr_st~0 0))) (.cse1 (not (= ~c_dr_pc~0 1))) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~p_dw_st~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (and .cse2 .cse8 .cse0 .cse4 .cse5)) (.cse17 (and .cse10 .cse8 .cse0 .cse4 .cse5)) (.cse14 (<= 2 ~p_dw_st~0))) (or (not .cse0) (= |old(~p_dw_pc~0)| 2) (and .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~q_free~0)| 1)) (and .cse6 .cse7 .cse8 .cse4 .cse9 .cse10 .cse11 .cse12) (= 1 |old(~c_dr_pc~0)|) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse1 .cse6 (not (= ~p_dw_pc~0 1)) .cse10 .cse3 .cse7 .cse4) (let ((.cse13 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse13 ~p_num_write~0) .cse14 (<= ~p_num_write~0 .cse13) .cse4 .cse5)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse1 .cse6 .cse7 .cse4 .cse9 .cse10 .cse11 .cse12) (not (= 0 |old(~p_num_write~0)|)) (and .cse15 .cse16 (or .cse17 .cse18) (= 0 ~p_dw_st~0)) (not (= |old(~p_dw_st~0)| 0)) (and .cse15 .cse16 (or .cse18 .cse17) .cse14)))) [2018-11-18 16:56:30,792 INFO L421 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_st~0 0) (= ~q_free~0 |old(~q_free~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)) (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-18 16:56:30,792 INFO L428 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2018-11-18 16:56:30,792 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:56:30,792 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~p_dw_pc~0 2)) (= ~c_num_read~0 0) (= ~q_free~0 0) (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) [2018-11-18 16:56:30,792 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:56:30,792 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:56:30,792 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-11-18 16:56:30,793 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2018-11-18 16:56:30,793 INFO L425 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2018-11-18 16:56:30,793 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2018-11-18 16:56:30,793 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2018-11-18 16:56:30,793 INFO L421 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse6 (= ~p_dw_pc~0 2)) (.cse7 (not (= ~q_free~0 0))) (.cse3 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse8 (not (= 1 ~p_num_write~0))) (.cse4 (= ~p_dw_st~0 2)) (.cse5 (= ~p_dw_pc~0 1)) (.cse9 (not (= 0 ~c_num_read~0)))) (and (or .cse0 .cse1 .cse2 (= 0 ~c_dr_st~0) .cse3 .cse4 .cse5) (or .cse1 .cse2 .cse6 .cse7 (not (= 2 ~c_dr_st~0)) .cse3 .cse8 .cse4 .cse5 .cse9) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse3 .cse8 .cse4 .cse5 .cse9))) [2018-11-18 16:56:30,793 INFO L428 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2018-11-18 16:56:30,793 INFO L425 ceAbstractionStarter]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2018-11-18 16:56:30,793 INFO L421 ceAbstractionStarter]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse0 (= ~p_dw_st~0 0)) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (= 2 ~c_dr_st~0)) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse6 (= ~p_dw_pc~0 1))) (and (or (and .cse0 .cse1 (= ~q_free~0 |old(~q_free~0)|) (= ~c_num_read~0 0) .cse2) .cse3 .cse4 (= ~p_dw_pc~0 2) (not (= |old(~q_free~0)| 1)) (not (= 0 ~p_num_write~0)) (= 1 |old(~c_dr_pc~0)|) .cse5 (not (= |old(~p_dw_st~0)| 0)) .cse6 (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~q_free~0 1)) (.cse7 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse7) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse2) .cse3 .cse4 (and .cse10 .cse8 .cse9 (<= 2 ~p_dw_st~0) .cse2 .cse1) (not (= |old(~q_free~0)| 0)) (< .cse7 ~p_num_write~0) .cse5 (not .cse6) (< |old(~p_dw_st~0)| 2))))) [2018-11-18 16:56:30,793 INFO L425 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2018-11-18 16:56:30,794 INFO L421 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (let ((.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse4 (= ~p_dw_pc~0 1))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) .cse1 .cse2 (not (= |old(~q_free~0)| 0)) (< .cse0 ~p_num_write~0) .cse3 (not .cse4) (< |old(~p_dw_st~0)| 2))) (or (= 1 |old(~c_dr_pc~0)|) .cse1 .cse2 (= ~p_dw_pc~0 2) .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse4 (not (= 0 |old(~c_num_read~0)|)) (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0))))) [2018-11-18 16:56:30,794 INFO L421 ceAbstractionStarter]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse3 (= ~p_dw_pc~0 1)) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse9 (= ~p_dw_st~0 0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (not (= ~c_dr_st~0 0)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1)) (.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~q_free~0 1)) (.cse10 (<= 2 ~p_dw_st~0))) (or (< ~p_num_write~0 .cse0) .cse1 .cse2 (< .cse0 ~p_num_write~0) (not .cse3) (not (= |old(~q_free~0)| 0)) .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9) (< |old(~p_dw_st~0)| 2) (and .cse5 .cse6 .cse7 .cse10 .cse8) (let ((.cse12 (+ ~c_num_read~0 1))) (and .cse11 (<= .cse12 ~p_num_write~0) .cse10 (= ~q_free~0 0) (<= ~p_num_write~0 .cse12) .cse13)))) (or .cse1 .cse2 (= ~p_dw_pc~0 2) (not (= |old(~q_free~0)| 1)) (not (= 0 ~p_num_write~0)) (= 1 |old(~c_dr_pc~0)|) .cse4 (not (= |old(~p_dw_st~0)| 0)) .cse3 (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (and .cse11 .cse9 (= ~q_free~0 |old(~q_free~0)|) (= ~c_num_read~0 0) .cse8 .cse13)))) [2018-11-18 16:56:30,794 INFO L421 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse10 (= ~p_dw_pc~0 1))) (let ((.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (not .cse10)) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse8 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse9 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) .cse1 .cse2 .cse3 (< .cse0 ~p_num_write~0) .cse4 .cse5 (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse6) (not (= ~c_dr_st~0 0)) (= ~q_free~0 |old(~q_free~0)|))) .cse7)) (or .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0)) .cse9 .cse7) (or .cse8 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse4 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse10 .cse9 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-11-18 16:56:30,794 INFO L425 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2018-11-18 16:56:30,794 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2018-11-18 16:56:30,794 INFO L421 ceAbstractionStarter]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse12 (= ~p_dw_pc~0 1))) (let ((.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (not .cse12)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse11 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0)) .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse9) .cse1 .cse2 .cse3 (< .cse9 ~p_num_write~0) .cse4 .cse5 (let ((.cse10 (+ ~c_num_read~0 1))) (and (<= .cse10 ~p_num_write~0) (<= 2 ~p_dw_st~0) (= ~q_free~0 0) (<= ~p_num_write~0 .cse10) .cse11)) .cse8)) (or .cse1 .cse2 (= ~p_dw_pc~0 2) (not (= |old(~q_free~0)| 1)) (not (= 0 ~p_num_write~0)) .cse0 .cse4 (not (= |old(~p_dw_st~0)| 0)) .cse12 .cse6 (not (= |old(~c_last_read~0)| ~p_last_write~0)) (and .cse7 (= ~p_dw_st~0 0) (= ~q_free~0 |old(~q_free~0)|) (= ~c_num_read~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse11))))) [2018-11-18 16:56:30,795 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2018-11-18 16:56:30,795 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 185) no Hoare annotation was computed. [2018-11-18 16:56:30,795 INFO L421 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (let ((.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse4 (= ~p_dw_pc~0 1))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) .cse1 .cse2 (not (= |old(~q_free~0)| 0)) (< .cse0 ~p_num_write~0) .cse3 (not .cse4) (< |old(~p_dw_st~0)| 2))) (or (= 1 |old(~c_dr_pc~0)|) .cse1 .cse2 (= ~p_dw_pc~0 2) .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse4 (not (= 0 |old(~c_num_read~0)|)) (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0))))) [2018-11-18 16:56:30,795 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2018-11-18 16:56:30,795 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2018-11-18 16:56:30,795 INFO L421 ceAbstractionStarter]: At program point L169(line 169) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (not .cse9)) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 1)) (not (= 1 ~p_num_write~0)) .cse6 .cse7) (let ((.cse8 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse8) .cse1 .cse2 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (= ~q_free~0 1) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~c_dr_st~0 0))) .cse3 (< .cse8 ~p_num_write~0) .cse4 .cse5 .cse7)) (or .cse0 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse4 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse9 .cse6 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-11-18 16:56:30,795 INFO L425 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-11-18 16:56:30,795 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2018-11-18 16:56:30,795 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2018-11-18 16:56:30,796 INFO L421 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) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (not (= ~p_dw_st~0 0)) (and (not (= ~c_dr_pc~0 1)) (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)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~c_last_read~0 ~p_last_write~0))) [2018-11-18 16:56:30,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:56:30 BoogieIcfgContainer [2018-11-18 16:56:30,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:56:30,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:56:30,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:56:30,853 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:56:30,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:56:12" (3/4) ... [2018-11-18 16:56:30,857 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:56:30,863 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-18 16:56:30,864 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-18 16:56:30,864 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:56:30,864 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-18 16:56:30,864 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-18 16:56:30,864 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2018-11-18 16:56:30,864 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:56:30,864 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-18 16:56:30,864 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-18 16:56:30,864 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-18 16:56:30,864 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-18 16:56:30,865 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-18 16:56:30,865 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-18 16:56:30,865 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-18 16:56:30,871 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-18 16:56:30,871 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 16:56:30,898 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || ((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && 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) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || 1 == \old(c_dr_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || ((((((!(c_dr_pc == 1) && q_free == 1) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && !(c_dr_st == 0)) && p_dw_st == 0) && p_last_write == q_buf_0)) || (((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 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))) || (((((((!(c_dr_pc == 1) && 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)) || !(0 == \old(p_num_write))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || !(\old(p_dw_st) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st) [2018-11-18 16:56:30,899 WARN L220 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)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(\old(p_dw_pc) == 1)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(p_dw_st) < 2) && ((((((((((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || \old(p_num_write) < \old(c_num_read)) || !(\old(p_dw_st) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || \old(c_num_read) < \old(p_num_write)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(\old(p_dw_pc) == 1)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || !(\old(q_free) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || \old(p_dw_st) < 2) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((((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)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0) || (((c_last_read == p_last_write && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0))) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && \old(p_dw_pc) == p_dw_pc) || \old(p_num_write) < \old(c_num_read)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \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)) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(c_dr_st)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_pc) == 1))) && (((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || (((((((((!(c_dr_pc == 1) && q_free == 1) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && q_free == \old(q_free)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((((((p_dw_st == 0 && 2 == c_dr_st) && q_free == \old(q_free)) && 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) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || 1 == \old(c_dr_pc)) || (((((((!(c_dr_pc == 1) && p_dw_st == 0) && q_free == \old(q_free)) && 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_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((!(c_dr_pc == 1) && q_free == 1) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && q_free == \old(q_free)) && p_dw_i == 1) && p_last_write == q_buf_0)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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))) || !(0 == \old(p_num_write))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || !(\old(p_dw_st) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st))) && ((((((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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st)) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || (((!(q_free == p_dw_pc) && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0) || (((c_last_read == p_last_write && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((p_dw_st == 0 && 2 == c_dr_st) && q_free == \old(q_free)) && 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) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || !(2 == \old(c_dr_st))) || !(0 == \old(c_num_read))) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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))) || !(0 == \old(p_num_write))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || !(\old(p_dw_st) == 0)) [2018-11-18 16:56:30,899 WARN L220 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)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(\old(p_dw_pc) == 1)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(p_dw_st) < 2) && ((((((((((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || \old(p_num_write) < \old(c_num_read)) || !(\old(p_dw_st) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || \old(c_num_read) < \old(p_num_write)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(\old(p_dw_pc) == 1)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || !(\old(q_free) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || \old(p_dw_st) < 2) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((((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)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0) || (((c_last_read == p_last_write && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0))) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && \old(p_dw_pc) == p_dw_pc) || \old(p_num_write) < \old(c_num_read)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \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)) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(c_dr_st)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_pc) == 1))) && (((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || (((((((((!(c_dr_pc == 1) && q_free == 1) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && q_free == \old(q_free)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((((((p_dw_st == 0 && 2 == c_dr_st) && q_free == \old(q_free)) && 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) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || 1 == \old(c_dr_pc)) || (((((((!(c_dr_pc == 1) && p_dw_st == 0) && q_free == \old(q_free)) && 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_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((!(c_dr_pc == 1) && q_free == 1) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && q_free == \old(q_free)) && p_dw_i == 1) && p_last_write == q_buf_0)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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))) || !(0 == \old(p_num_write))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || !(\old(p_dw_st) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st))) && ((((((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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st)) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || (((!(q_free == p_dw_pc) && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0) || (((c_last_read == p_last_write && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((p_dw_st == 0 && 2 == c_dr_st) && q_free == \old(q_free)) && 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) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || !(2 == \old(c_dr_st))) || !(0 == \old(c_num_read))) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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))) || !(0 == \old(p_num_write))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || !(\old(p_dw_st) == 0)) [2018-11-18 16:56:30,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || \old(p_dw_pc) == 1) || !(c_last_read == \old(p_last_write))) || \old(p_dw_pc) == 2) || !(2 == \old(c_dr_st))) || ((((q_free == 0 && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || ((((((q_free == 1 && !(p_dw_st == 2)) && c_last_read == p_last_write) && 2 == c_dr_st) && \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)) || !(0 == \old(p_num_write))) && ((((((((1 == c_dr_pc || 2 == c_dr_st) || !(\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) || \old(p_dw_pc) == 1) || !(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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || (((((!(c_dr_pc == 1) && !(p_dw_st == 2)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2)) && (((((q_free == 0 && \old(p_num_write) + 1 <= p_num_write) && (!(p_dw_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1) || (((((!(c_dr_pc == 1) && !(p_dw_st == 2)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((\old(p_num_write) < c_num_read || !(\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) || c_num_read < \old(p_num_write))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || 1 == c_dr_pc) || (((((q_free == 1 && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || ((((q_free == 0 && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write)))) && ((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(c_last_read == \old(p_last_write))) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || (((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) [2018-11-18 16:56:30,900 WARN L220 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)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2)) && ((((((((((((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((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) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || !(c_last_read == \old(p_last_write))) || \old(p_dw_pc) == 2) || !(2 == \old(c_dr_st))) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == c_num_read)) || !(0 == \old(p_num_write)))) && ((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && 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))) [2018-11-18 16:56:30,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 == c_dr_pc || 2 == c_dr_st) || !(\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) || \old(p_dw_pc) == 1) || !(c_last_read == \old(p_last_write))) && ((((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) || (((((!(c_dr_pc == 1) && !(p_dw_st == 2)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((\old(p_num_write) < c_num_read || !(\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) || 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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || (((((!(c_dr_pc == 1) && !(p_dw_st == 2)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || (((!(p_dw_st == 2) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(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) == 1) || !(c_last_read == \old(p_last_write))) || \old(p_dw_pc) == 2) || !(2 == \old(c_dr_st))) || ((((!(p_dw_st == 2) && 2 == c_dr_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(0 == \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) || \old(p_dw_pc) == 1) || !(c_last_read == \old(p_last_write))) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || (((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) [2018-11-18 16:56:30,901 WARN L220 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)) || \old(c_num_read) + 1 < p_num_write) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0)) || \old(p_dw_st) < 2) || ((((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)) || (((((!(c_dr_pc == 1) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && q_free == 0) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(\old(q_free) == 1)) || !(0 == p_num_write)) || 1 == \old(c_dr_pc)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == p_last_write)) || (((((!(c_dr_pc == 1) && p_dw_st == 0) && q_free == \old(q_free)) && c_num_read == 0) && c_last_read == p_last_write) && !(c_dr_st == 0))) [2018-11-18 16:56:30,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_dw_st == 0 && 2 == c_dr_st) && q_free == \old(q_free)) && c_num_read == 0) && c_last_read == p_last_write) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(\old(q_free) == 1)) || !(0 == p_num_write)) || 1 == \old(c_dr_pc)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == p_last_write)) && (((((((((p_num_write < \old(c_num_read) + 1 || (((((p_num_write <= c_num_read && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || (((((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) && 2 == c_dr_st)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || \old(p_dw_st) < 2) [2018-11-18 16:56:30,901 WARN L220 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)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || ((((c_num_read + 1 <= p_num_write && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && q_free == \old(q_free))) || \old(p_dw_st) < 2) && ((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) [2018-11-18 16:56:30,944 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ff16568f-bf17-4abd-b3aa-04b7281cb8c2/bin-2019/uautomizer/witness.graphml [2018-11-18 16:56:30,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:56:30,945 INFO L168 Benchmark]: Toolchain (without parser) took 19392.74 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 838.3 MB). Free memory was 959.2 MB in the beginning and 1.6 GB in the end (delta: -644.9 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:56:30,945 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:56:30,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.47 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:56:30,947 INFO L168 Benchmark]: Boogie Preprocessor took 61.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:56:30,947 INFO L168 Benchmark]: RCFGBuilder took 308.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:56:30,947 INFO L168 Benchmark]: TraceAbstraction took 18736.97 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 703.6 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -499.9 MB). Peak memory consumption was 851.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:56:30,948 INFO L168 Benchmark]: Witness Printer took 91.11 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-18 16:56:30,949 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 191.47 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 308.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18736.97 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 703.6 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -499.9 MB). Peak memory consumption was 851.0 MB. Max. memory is 11.5 GB. * Witness Printer took 91.11 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(\old(p_dw_pc) == 1)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(p_dw_st) < 2) && ((((((((((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || \old(p_num_write) < \old(c_num_read)) || !(\old(p_dw_st) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || \old(c_num_read) < \old(p_num_write)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(\old(p_dw_pc) == 1)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || !(\old(q_free) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || \old(p_dw_st) < 2) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((((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)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0) || (((c_last_read == p_last_write && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0))) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && \old(p_dw_pc) == p_dw_pc) || \old(p_num_write) < \old(c_num_read)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \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)) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(c_dr_st)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_pc) == 1))) && (((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || (((((((((!(c_dr_pc == 1) && q_free == 1) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && q_free == \old(q_free)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((((((p_dw_st == 0 && 2 == c_dr_st) && q_free == \old(q_free)) && 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) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || 1 == \old(c_dr_pc)) || (((((((!(c_dr_pc == 1) && p_dw_st == 0) && q_free == \old(q_free)) && 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_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((!(c_dr_pc == 1) && q_free == 1) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && q_free == \old(q_free)) && p_dw_i == 1) && p_last_write == q_buf_0)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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))) || !(0 == \old(p_num_write))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || !(\old(p_dw_st) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st))) && ((((((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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st)) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || (((!(q_free == p_dw_pc) && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0) || (((c_last_read == p_last_write && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((p_dw_st == 0 && 2 == c_dr_st) && q_free == \old(q_free)) && 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) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || !(2 == \old(c_dr_st))) || !(0 == \old(c_num_read))) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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))) || !(0 == \old(p_num_write))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || !(\old(p_dw_st) == 0)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || \old(p_dw_pc) == 1) || !(c_last_read == \old(p_last_write))) || \old(p_dw_pc) == 2) || !(2 == \old(c_dr_st))) || ((((q_free == 0 && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || ((((((q_free == 1 && !(p_dw_st == 2)) && c_last_read == p_last_write) && 2 == c_dr_st) && \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)) || !(0 == \old(p_num_write))) && ((((((((1 == c_dr_pc || 2 == c_dr_st) || !(\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) || \old(p_dw_pc) == 1) || !(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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || (((((!(c_dr_pc == 1) && !(p_dw_st == 2)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2)) && (((((q_free == 0 && \old(p_num_write) + 1 <= p_num_write) && (!(p_dw_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1) || (((((!(c_dr_pc == 1) && !(p_dw_st == 2)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((\old(p_num_write) < c_num_read || !(\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) || c_num_read < \old(p_num_write))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || 1 == c_dr_pc) || (((((q_free == 1 && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || ((((q_free == 0 && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write)))) && ((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(c_last_read == \old(p_last_write))) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || (((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) - 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)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || ((((c_num_read + 1 <= p_num_write && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && q_free == \old(q_free))) || \old(p_dw_st) < 2) && ((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 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)) || \old(c_num_read) + 1 < p_num_write) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0)) || \old(p_dw_st) < 2) || ((((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)) || (((((!(c_dr_pc == 1) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && q_free == 0) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(\old(q_free) == 1)) || !(0 == p_num_write)) || 1 == \old(c_dr_pc)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == p_last_write)) || (((((!(c_dr_pc == 1) && p_dw_st == 0) && q_free == \old(q_free)) && c_num_read == 0) && c_last_read == p_last_write) && !(c_dr_st == 0))) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || 0 == __retres1) || p_dw_st == 2) || p_dw_pc == 1) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || !(2 == c_dr_st)) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read))) && (((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || ((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && 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) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || 1 == \old(c_dr_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || ((((((!(c_dr_pc == 1) && q_free == 1) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && !(c_dr_st == 0)) && p_dw_st == 0) && p_last_write == q_buf_0)) || (((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 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))) || (((((((!(c_dr_pc == 1) && 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)) || !(0 == \old(p_num_write))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || !(\old(p_dw_st) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st) - 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)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(\old(p_dw_pc) == 1)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(p_dw_st) < 2) && ((((((((((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || \old(p_num_write) < \old(c_num_read)) || !(\old(p_dw_st) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || \old(c_num_read) < \old(p_num_write)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(\old(p_dw_pc) == 1)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || !(\old(q_free) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || \old(p_dw_st) < 2) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((((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)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0) || (((c_last_read == p_last_write && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0))) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && \old(p_dw_pc) == p_dw_pc) || \old(p_num_write) < \old(c_num_read)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \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)) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(c_dr_st)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_pc) == 1))) && (((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || (((((((((!(c_dr_pc == 1) && q_free == 1) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && q_free == \old(q_free)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((((((p_dw_st == 0 && 2 == c_dr_st) && q_free == \old(q_free)) && 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) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || 1 == \old(c_dr_pc)) || (((((((!(c_dr_pc == 1) && p_dw_st == 0) && q_free == \old(q_free)) && 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_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((!(c_dr_pc == 1) && q_free == 1) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && q_free == \old(q_free)) && p_dw_i == 1) && p_last_write == q_buf_0)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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))) || !(0 == \old(p_num_write))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || !(\old(p_dw_st) == 0)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st))) && ((((((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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st)) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || (((!(q_free == p_dw_pc) && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0) || (((c_last_read == p_last_write && 2 == c_dr_st) && q_free == \old(q_free)) && p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)))) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((p_dw_st == 0 && 2 == c_dr_st) && q_free == \old(q_free)) && 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) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || !(2 == \old(c_dr_st))) || !(0 == \old(c_num_read))) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 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))) || !(0 == \old(p_num_write))) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 0 == p_dw_st)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((((!(q_free == p_dw_pc) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && 2 <= p_dw_st)) || !(\old(p_dw_st) == 0)) - InvariantResult [Line: 91]: 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)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2)) && ((((((((((((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((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) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write)) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || !(c_last_read == \old(p_last_write))) || \old(p_dw_pc) == 2) || !(2 == \old(c_dr_st))) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == c_num_read)) || !(0 == \old(p_num_write)))) && ((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || (((((!(c_dr_pc == 1) && !(q_free == p_dw_pc)) && 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))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_st == 2) || 0 == __retres1) && (((((((((1 == c_dr_pc || p_num_write < c_num_read) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || !(p_dw_pc == 1)) || !(q_free == 1)) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && (((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_st == 0 && 2 == c_dr_st) && q_free == \old(q_free)) && c_num_read == 0) && c_last_read == p_last_write) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(\old(q_free) == 1)) || !(0 == p_num_write)) || 1 == \old(c_dr_pc)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == p_last_write)) && (((((((((p_num_write < \old(c_num_read) + 1 || (((((p_num_write <= c_num_read && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || (((((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) && 2 == c_dr_st)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || \old(p_dw_st) < 2) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((1 == c_dr_pc || 2 == c_dr_st) || !(\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) || \old(p_dw_pc) == 1) || !(c_last_read == \old(p_last_write))) && ((((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) || (((((!(c_dr_pc == 1) && !(p_dw_st == 2)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((\old(p_num_write) < c_num_read || !(\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) || 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) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || (((((!(c_dr_pc == 1) && !(p_dw_st == 2)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || (((!(p_dw_st == 2) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(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) == 1) || !(c_last_read == \old(p_last_write))) || \old(p_dw_pc) == 2) || !(2 == \old(c_dr_st))) || ((((!(p_dw_st == 2) && 2 == c_dr_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(0 == \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) || \old(p_dw_pc) == 1) || !(c_last_read == \old(p_last_write))) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || (((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 111 locations, 1 error locations. SAFE Result, 18.6s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 12.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2315 SDtfs, 3205 SDslu, 3482 SDs, 0 SdLazy, 3361 SolverSat, 881 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 423 SyntacticMatches, 11 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3336occurred in iteration=11, 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.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 582 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 4885 PreInvPairs, 7621 NumberOfFragments, 10899 HoareAnnotationTreeSize, 4885 FomulaSimplifications, 66629 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 45 FomulaSimplificationsInter, 46926 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1509 NumberOfCodeBlocks, 1509 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1493 ConstructedInterpolants, 0 QuantifiedInterpolants, 308006 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2047 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 360/415 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...