./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/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_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/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-1dbac8b [2018-11-10 11:50:57,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:50:57,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:50:57,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:50:57,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:50:57,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:50:57,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:50:57,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:50:57,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:50:57,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:50:57,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:50:57,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:50:57,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:50:57,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:50:57,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:50:57,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:50:57,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:50:57,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:50:57,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:50:57,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:50:57,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:50:57,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:50:57,287 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:50:57,287 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:50:57,287 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:50:57,288 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:50:57,288 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:50:57,289 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:50:57,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:50:57,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:50:57,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:50:57,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:50:57,291 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:50:57,291 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:50:57,291 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:50:57,292 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:50:57,292 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 11:50:57,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:50:57,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:50:57,300 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:50:57,300 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 11:50:57,300 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:50:57,301 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:50:57,301 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:50:57,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:50:57,301 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:50:57,301 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:50:57,301 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:50:57,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:50:57,302 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:50:57,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:50:57,302 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:50:57,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:50:57,302 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:50:57,302 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:50:57,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:50:57,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:50:57,303 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:50:57,303 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:50:57,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:50:57,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:50:57,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:50:57,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:50:57,304 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:50:57,304 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:50:57,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:50:57,304 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_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/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-10 11:50:57,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:50:57,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:50:57,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:50:57,337 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:50:57,338 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:50:57,338 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-10 11:50:57,375 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/bin-2019/uautomizer/data/73b471629/a7a2490f6fac4254b8d12c83f65659e3/FLAGce8a0d197 [2018-11-10 11:50:57,696 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:50:57,697 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-10 11:50:57,702 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/bin-2019/uautomizer/data/73b471629/a7a2490f6fac4254b8d12c83f65659e3/FLAGce8a0d197 [2018-11-10 11:50:57,714 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/bin-2019/uautomizer/data/73b471629/a7a2490f6fac4254b8d12c83f65659e3 [2018-11-10 11:50:57,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:50:57,719 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 11:50:57,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:50:57,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:50:57,723 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:50:57,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:50:57" (1/1) ... [2018-11-10 11:50:57,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edf5c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57, skipping insertion in model container [2018-11-10 11:50:57,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:50:57" (1/1) ... [2018-11-10 11:50:57,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:50:57,756 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:50:57,877 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:50:57,880 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:50:57,901 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:50:57,910 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:50:57,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57 WrapperNode [2018-11-10 11:50:57,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:50:57,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:50:57,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:50:57,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:50:57,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57" (1/1) ... [2018-11-10 11:50:57,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57" (1/1) ... [2018-11-10 11:50:57,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57" (1/1) ... [2018-11-10 11:50:57,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57" (1/1) ... [2018-11-10 11:50:57,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57" (1/1) ... [2018-11-10 11:50:57,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57" (1/1) ... [2018-11-10 11:50:57,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57" (1/1) ... [2018-11-10 11:50:57,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:50:57,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:50:57,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:50:57,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:50:57,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/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-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-10 11:50:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-10 11:50:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-10 11:50:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-10 11:50:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:50:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 11:50:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 11:50:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-10 11:50:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-10 11:50:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-10 11:50:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2018-11-10 11:50:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-10 11:50:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-10 11:50:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-10 11:50:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-10 11:50:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-10 11:50:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-10 11:50:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-10 11:50:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-10 11:50:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:50:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:50:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:50:58,280 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:50:58,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:58 BoogieIcfgContainer [2018-11-10 11:50:58,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:50:58,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:50:58,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:50:58,283 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:50:58,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:50:57" (1/3) ... [2018-11-10 11:50:58,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79063fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:50:58, skipping insertion in model container [2018-11-10 11:50:58,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:57" (2/3) ... [2018-11-10 11:50:58,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79063fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:50:58, skipping insertion in model container [2018-11-10 11:50:58,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:58" (3/3) ... [2018-11-10 11:50:58,286 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-10 11:50:58,292 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:50:58,297 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:50:58,305 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:50:58,324 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:50:58,324 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:50:58,325 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:50:58,325 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:50:58,325 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:50:58,325 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:50:58,325 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:50:58,325 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:50:58,325 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:50:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-11-10 11:50:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 11:50:58,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:58,343 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-10 11:50:58,344 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:58,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:58,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1866970747, now seen corresponding path program 1 times [2018-11-10 11:50:58,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:58,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:58,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:58,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:58,521 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-10 11:50:58,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:58,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:50:58,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:50:58,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:50:58,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:50:58,535 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-11-10 11:50:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:58,614 INFO L93 Difference]: Finished difference Result 291 states and 407 transitions. [2018-11-10 11:50:58,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:50:58,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-11-10 11:50:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:58,624 INFO L225 Difference]: With dead ends: 291 [2018-11-10 11:50:58,625 INFO L226 Difference]: Without dead ends: 183 [2018-11-10 11:50:58,628 INFO L605 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-10 11:50:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-10 11:50:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-11-10 11:50:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-10 11:50:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2018-11-10 11:50:58,668 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 67 [2018-11-10 11:50:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:58,669 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2018-11-10 11:50:58,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:50:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2018-11-10 11:50:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 11:50:58,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:58,673 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-10 11:50:58,673 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:58,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:58,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1143366072, now seen corresponding path program 1 times [2018-11-10 11:50:58,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:58,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:58,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:58,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:58,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:58,785 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-10 11:50:58,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:58,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:50:58,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:50:58,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:50:58,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:50:58,787 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand 3 states. [2018-11-10 11:50:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:58,838 INFO L93 Difference]: Finished difference Result 489 states and 680 transitions. [2018-11-10 11:50:58,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:50:58,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-10 11:50:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:58,842 INFO L225 Difference]: With dead ends: 489 [2018-11-10 11:50:58,842 INFO L226 Difference]: Without dead ends: 330 [2018-11-10 11:50:58,843 INFO L605 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-10 11:50:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-10 11:50:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 326. [2018-11-10 11:50:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-10 11:50:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 441 transitions. [2018-11-10 11:50:58,872 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 441 transitions. Word has length 68 [2018-11-10 11:50:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:58,872 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 441 transitions. [2018-11-10 11:50:58,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:50:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 441 transitions. [2018-11-10 11:50:58,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 11:50:58,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:58,875 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-10 11:50:58,875 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:58,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:58,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1204627774, now seen corresponding path program 1 times [2018-11-10 11:50:58,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:58,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:58,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:58,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:58,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:58,954 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-10 11:50:58,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:58,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:50:58,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:50:58,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:50:58,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:50:58,955 INFO L87 Difference]: Start difference. First operand 326 states and 441 transitions. Second operand 4 states. [2018-11-10 11:50:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:59,101 INFO L93 Difference]: Finished difference Result 930 states and 1370 transitions. [2018-11-10 11:50:59,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:50:59,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-11-10 11:50:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:59,106 INFO L225 Difference]: With dead ends: 930 [2018-11-10 11:50:59,107 INFO L226 Difference]: Without dead ends: 624 [2018-11-10 11:50:59,109 INFO L605 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-10 11:50:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-10 11:50:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 620. [2018-11-10 11:50:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-11-10 11:50:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 841 transitions. [2018-11-10 11:50:59,151 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 841 transitions. Word has length 69 [2018-11-10 11:50:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:59,151 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 841 transitions. [2018-11-10 11:50:59,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:50:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 841 transitions. [2018-11-10 11:50:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 11:50:59,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:59,155 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-10 11:50:59,155 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:59,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:59,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2088831086, now seen corresponding path program 1 times [2018-11-10 11:50:59,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:59,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:59,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:59,203 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-10 11:50:59,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:59,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:50:59,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:50:59,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:50:59,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:50:59,204 INFO L87 Difference]: Start difference. First operand 620 states and 841 transitions. Second operand 4 states. [2018-11-10 11:50:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:59,289 INFO L93 Difference]: Finished difference Result 1131 states and 1518 transitions. [2018-11-10 11:50:59,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:50:59,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-11-10 11:50:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:59,292 INFO L225 Difference]: With dead ends: 1131 [2018-11-10 11:50:59,292 INFO L226 Difference]: Without dead ends: 528 [2018-11-10 11:50:59,294 INFO L605 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-10 11:50:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-11-10 11:50:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-11-10 11:50:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-11-10 11:50:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 695 transitions. [2018-11-10 11:50:59,320 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 695 transitions. Word has length 69 [2018-11-10 11:50:59,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:59,321 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 695 transitions. [2018-11-10 11:50:59,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:50:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 695 transitions. [2018-11-10 11:50:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 11:50:59,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:59,323 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-10 11:50:59,323 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:59,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:59,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1091241117, now seen corresponding path program 1 times [2018-11-10 11:50:59,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:59,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:59,400 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-10 11:50:59,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:59,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:50:59,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:50:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:50:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:50:59,401 INFO L87 Difference]: Start difference. First operand 528 states and 695 transitions. Second operand 6 states. [2018-11-10 11:50:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:59,458 INFO L93 Difference]: Finished difference Result 1019 states and 1398 transitions. [2018-11-10 11:50:59,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:50:59,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-10 11:50:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:59,461 INFO L225 Difference]: With dead ends: 1019 [2018-11-10 11:50:59,461 INFO L226 Difference]: Without dead ends: 546 [2018-11-10 11:50:59,463 INFO L605 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-10 11:50:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-10 11:50:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2018-11-10 11:50:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-11-10 11:50:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 710 transitions. [2018-11-10 11:50:59,488 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 710 transitions. Word has length 69 [2018-11-10 11:50:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:59,488 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 710 transitions. [2018-11-10 11:50:59,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:50:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 710 transitions. [2018-11-10 11:50:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 11:50:59,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:59,490 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-10 11:50:59,490 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:59,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:59,491 INFO L82 PathProgramCache]: Analyzing trace with hash 70172763, now seen corresponding path program 1 times [2018-11-10 11:50:59,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:59,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:59,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:59,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:59,550 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-10 11:50:59,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:59,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:50:59,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:50:59,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:50:59,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:50:59,551 INFO L87 Difference]: Start difference. First operand 546 states and 710 transitions. Second operand 6 states. [2018-11-10 11:50:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:59,600 INFO L93 Difference]: Finished difference Result 1069 states and 1462 transitions. [2018-11-10 11:50:59,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:50:59,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-10 11:50:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:59,602 INFO L225 Difference]: With dead ends: 1069 [2018-11-10 11:50:59,602 INFO L226 Difference]: Without dead ends: 578 [2018-11-10 11:50:59,604 INFO L605 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-10 11:50:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-11-10 11:50:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 568. [2018-11-10 11:50:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-11-10 11:50:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 728 transitions. [2018-11-10 11:50:59,625 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 728 transitions. Word has length 69 [2018-11-10 11:50:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:59,625 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 728 transitions. [2018-11-10 11:50:59,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:50:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 728 transitions. [2018-11-10 11:50:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 11:50:59,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:59,627 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-10 11:50:59,627 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:59,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1845180125, now seen corresponding path program 1 times [2018-11-10 11:50:59,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:59,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:59,689 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-10 11:50:59,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:59,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:50:59,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:50:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:50:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:50:59,690 INFO L87 Difference]: Start difference. First operand 568 states and 728 transitions. Second operand 4 states. [2018-11-10 11:50:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:59,769 INFO L93 Difference]: Finished difference Result 878 states and 1144 transitions. [2018-11-10 11:50:59,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:50:59,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-11-10 11:50:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:59,772 INFO L225 Difference]: With dead ends: 878 [2018-11-10 11:50:59,772 INFO L226 Difference]: Without dead ends: 875 [2018-11-10 11:50:59,773 INFO L605 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-10 11:50:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-11-10 11:50:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 775. [2018-11-10 11:50:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-11-10 11:50:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1013 transitions. [2018-11-10 11:50:59,802 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1013 transitions. Word has length 69 [2018-11-10 11:50:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:59,802 INFO L481 AbstractCegarLoop]: Abstraction has 775 states and 1013 transitions. [2018-11-10 11:50:59,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:50:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1013 transitions. [2018-11-10 11:50:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 11:50:59,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:59,803 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-10 11:50:59,804 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:59,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:59,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1365704798, now seen corresponding path program 1 times [2018-11-10 11:50:59,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:59,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:59,845 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-10 11:50:59,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:59,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:50:59,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:50:59,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:50:59,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:50:59,846 INFO L87 Difference]: Start difference. First operand 775 states and 1013 transitions. Second operand 3 states. [2018-11-10 11:50:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:59,900 INFO L93 Difference]: Finished difference Result 1489 states and 2044 transitions. [2018-11-10 11:50:59,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:50:59,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-10 11:50:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:59,903 INFO L225 Difference]: With dead ends: 1489 [2018-11-10 11:50:59,903 INFO L226 Difference]: Without dead ends: 772 [2018-11-10 11:50:59,906 INFO L605 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-10 11:50:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-11-10 11:50:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 736. [2018-11-10 11:50:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-10 11:50:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 980 transitions. [2018-11-10 11:50:59,934 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 980 transitions. Word has length 70 [2018-11-10 11:50:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:59,934 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 980 transitions. [2018-11-10 11:50:59,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:50:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 980 transitions. [2018-11-10 11:50:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 11:50:59,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:59,936 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-10 11:50:59,936 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:59,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:59,936 INFO L82 PathProgramCache]: Analyzing trace with hash -432744713, now seen corresponding path program 1 times [2018-11-10 11:50:59,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:59,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:59,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:59,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:00,017 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-10 11:51:00,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:00,017 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/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-10 11:51:00,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:00,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:51:00,115 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-10 11:51:00,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:51:00,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-10 11:51:00,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:51:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:51:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:51:00,132 INFO L87 Difference]: Start difference. First operand 736 states and 980 transitions. Second operand 7 states. [2018-11-10 11:51:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:00,452 INFO L93 Difference]: Finished difference Result 2199 states and 3159 transitions. [2018-11-10 11:51:00,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:51:00,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-10 11:51:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:00,455 INFO L225 Difference]: With dead ends: 2199 [2018-11-10 11:51:00,455 INFO L226 Difference]: Without dead ends: 1090 [2018-11-10 11:51:00,459 INFO L605 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-10 11:51:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-11-10 11:51:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 791. [2018-11-10 11:51:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2018-11-10 11:51:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1018 transitions. [2018-11-10 11:51:00,500 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1018 transitions. Word has length 91 [2018-11-10 11:51:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:00,500 INFO L481 AbstractCegarLoop]: Abstraction has 791 states and 1018 transitions. [2018-11-10 11:51:00,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:51:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1018 transitions. [2018-11-10 11:51:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 11:51:00,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:00,502 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-10 11:51:00,502 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:51:00,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:00,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1329265355, now seen corresponding path program 1 times [2018-11-10 11:51:00,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:51:00,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:51:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:00,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:00,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:00,597 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-10 11:51:00,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:00,597 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/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-10 11:51:00,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:00,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:51:00,763 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-10 11:51:00,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:51:00,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-11-10 11:51:00,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 11:51:00,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 11:51:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:51:00,781 INFO L87 Difference]: Start difference. First operand 791 states and 1018 transitions. Second operand 12 states. [2018-11-10 11:51:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:02,129 INFO L93 Difference]: Finished difference Result 2999 states and 5106 transitions. [2018-11-10 11:51:02,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 11:51:02,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2018-11-10 11:51:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:02,146 INFO L225 Difference]: With dead ends: 2999 [2018-11-10 11:51:02,146 INFO L226 Difference]: Without dead ends: 2996 [2018-11-10 11:51:02,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-11-10 11:51:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2018-11-10 11:51:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2925. [2018-11-10 11:51:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2018-11-10 11:51:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 4908 transitions. [2018-11-10 11:51:02,382 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 4908 transitions. Word has length 104 [2018-11-10 11:51:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:02,382 INFO L481 AbstractCegarLoop]: Abstraction has 2925 states and 4908 transitions. [2018-11-10 11:51:02,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 11:51:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 4908 transitions. [2018-11-10 11:51:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 11:51:02,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:02,387 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-10 11:51:02,387 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:51:02,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1300373116, now seen corresponding path program 2 times [2018-11-10 11:51:02,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:51:02,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:51:02,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:02,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:02,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:02,429 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-10 11:51:02,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:02,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:51:02,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:51:02,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:51:02,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:02,431 INFO L87 Difference]: Start difference. First operand 2925 states and 4908 transitions. Second operand 3 states. [2018-11-10 11:51:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:02,616 INFO L93 Difference]: Finished difference Result 4998 states and 9226 transitions. [2018-11-10 11:51:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:51:02,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-11-10 11:51:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:02,632 INFO L225 Difference]: With dead ends: 4998 [2018-11-10 11:51:02,633 INFO L226 Difference]: Without dead ends: 2752 [2018-11-10 11:51:02,652 INFO L605 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-10 11:51:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2018-11-10 11:51:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2722. [2018-11-10 11:51:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2722 states. [2018-11-10 11:51:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 4430 transitions. [2018-11-10 11:51:02,856 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 4430 transitions. Word has length 131 [2018-11-10 11:51:02,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:02,856 INFO L481 AbstractCegarLoop]: Abstraction has 2722 states and 4430 transitions. [2018-11-10 11:51:02,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:51:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 4430 transitions. [2018-11-10 11:51:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 11:51:02,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:02,861 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, 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] [2018-11-10 11:51:02,861 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:51:02,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash 763422451, now seen corresponding path program 1 times [2018-11-10 11:51:02,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:51:02,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:51:02,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:02,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:51:02,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 11:51:02,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:02,951 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/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-10 11:51:02,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:03,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:51:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 11:51:03,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:51:03,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-10 11:51:03,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:51:03,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:51:03,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:51:03,104 INFO L87 Difference]: Start difference. First operand 2722 states and 4430 transitions. Second operand 9 states. [2018-11-10 11:51:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:03,985 INFO L93 Difference]: Finished difference Result 3532 states and 6195 transitions. [2018-11-10 11:51:03,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 11:51:03,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2018-11-10 11:51:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:03,988 INFO L225 Difference]: With dead ends: 3532 [2018-11-10 11:51:03,988 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:51:04,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-11-10 11:51:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:51:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:51:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:51:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:51:04,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2018-11-10 11:51:04,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:04,019 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:51:04,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:51:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:51:04,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:51:04,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:51:04,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:04,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:05,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:06,610 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 1 [2018-11-10 11:51:07,094 WARN L179 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2018-11-10 11:51:07,356 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2018-11-10 11:51:07,738 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2018-11-10 11:51:08,240 WARN L179 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 81 [2018-11-10 11:51:08,536 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 74 [2018-11-10 11:51:08,935 WARN L179 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2018-11-10 11:51:09,069 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 37 [2018-11-10 11:51:09,329 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2018-11-10 11:51:10,431 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 150 DAG size of output: 104 [2018-11-10 11:51:10,714 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2018-11-10 11:51:10,857 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-11-10 11:51:12,078 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 150 DAG size of output: 104 [2018-11-10 11:51:12,535 WARN L179 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 87 [2018-11-10 11:51:13,040 WARN L179 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2018-11-10 11:51:13,311 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2018-11-10 11:51:13,502 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2018-11-10 11:51:14,619 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 150 DAG size of output: 104 [2018-11-10 11:51:14,963 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-10 11:51:15,208 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 45 [2018-11-10 11:51:15,952 WARN L179 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 99 [2018-11-10 11:51:16,248 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 74 [2018-11-10 11:51:16,581 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 80 [2018-11-10 11:51:16,584 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2018-11-10 11:51:16,584 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-11-10 11:51:16,584 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2018-11-10 11:51:16,584 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2018-11-10 11:51:16,584 INFO L428 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: true [2018-11-10 11:51:16,584 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2018-11-10 11:51:16,584 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2018-11-10 11:51:16,584 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2018-11-10 11:51:16,584 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (= ~p_dw_st~0 0) (= 1 ~c_dr_pc~0) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= ~p_dw_i~0 1)) (= ~p_dw_pc~0 2) (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-10 11:51:16,584 INFO L425 ceAbstractionStarter]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2018-11-10 11:51:16,584 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) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and (not (= ~p_dw_pc~0 2)) (= ~c_num_read~0 0) (not (= ~c_dr_pc~0 1)) (= ~q_free~0 1) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (= ~p_dw_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) (= |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-10 11:51:16,585 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)) (= |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)|)) (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))) [2018-11-10 11:51:16,585 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2018-11-10 11:51:16,585 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2018-11-10 11:51:16,585 INFO L425 ceAbstractionStarter]: For program point L355(line 355) no Hoare annotation was computed. [2018-11-10 11:51:16,585 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)) (= |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)|)) (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))) [2018-11-10 11:51:16,585 INFO L421 ceAbstractionStarter]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse17 (= |old(~p_dw_pc~0)| 1)) (.cse24 (= ~p_dw_i~0 1))) (let ((.cse16 (= 1 ~c_dr_pc~0)) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not .cse24)) (.cse10 (not .cse17)) (.cse23 (not (= ~c_dr_pc~0 1))) (.cse1 (= ~q_free~0 0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (let ((.cse12 (= |old(~p_dw_pc~0)| 2)) (.cse15 (and .cse1 .cse2 (= 1 ~p_num_write~0) .cse3 .cse5)) (.cse14 (not (= 0 |old(~p_num_write~0)|))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse18 (not (= 0 ~c_num_read~0))) (.cse21 (and .cse23 (not (= ~c_dr_st~0 0)) .cse24 .cse3 .cse5)) (.cse22 (= 0 |old(~c_dr_st~0)|)) (.cse13 (not (= |old(~q_free~0)| 1))) (.cse19 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse6 (and .cse23 (= 2 ~c_dr_st~0) .cse24 .cse3 .cse5)) (.cse20 (or .cse16 .cse8 .cse9 .cse10)) (.cse7 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 (let ((.cse4 (+ |old(~p_num_write~0)| 1))) (and .cse1 .cse2 .cse3 (<= .cse4 ~p_num_write~0) .cse5 (<= ~p_num_write~0 .cse4))) .cse6 (or (< |old(~p_num_write~0)| ~c_num_read~0) .cse7 (or .cse8 .cse9 .cse10) .cse11 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16 .cse11 .cse17 .cse18 .cse19) (or .cse8 .cse9 .cse12 .cse15 .cse13 .cse14 .cse0 .cse7 .cse11 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse22 .cse11) (or .cse16 .cse8 .cse9 .cse21 .cse22 .cse13 .cse11 .cse19) (or .cse16 .cse6 .cse8 .cse9 .cse7 .cse13 .cse11 .cse19) (or .cse6 .cse20 .cse7 .cse11))))) [2018-11-10 11:51:16,586 INFO L421 ceAbstractionStarter]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse14 (= |old(~p_dw_pc~0)| 1))) (let ((.cse1 (= 1 ~c_dr_pc~0)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse23 (not .cse14))) (let ((.cse0 (= |old(~p_dw_st~0)| 0)) (.cse4 (= |old(~p_dw_pc~0)| 2)) (.cse21 (not (= 2 |old(~c_dr_st~0)|))) (.cse12 (not (= |old(~q_free~0)| 1))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse5 (= ~q_free~0 1)) (.cse22 (= 2 ~c_dr_st~0)) (.cse7 (not (= ~p_dw_st~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse11 (= 0 ~p_num_write~0)) (.cse16 (not (= 0 |old(~p_num_write~0)|))) (.cse17 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse20 (or .cse1 .cse2 .cse3 .cse23)) (.cse8 (not (= ~p_dw_st~0 2))) (.cse19 (not (= ~c_dr_st~0 0))) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= 0 |old(~c_dr_st~0)|)) (.cse13 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse2 .cse3 .cse18 .cse12 .cse13 .cse14 (and .cse5 .cse8 (not (= ~p_dw_pc~0 1)) .cse9 .cse19 .cse6) .cse17) (or .cse20 .cse21 .cse22 .cse13) (or .cse1 .cse2 .cse3 .cse21 .cse22 .cse12 .cse13 .cse17) (or .cse0 (and (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse8 .cse22 .cse6) .cse7 .cse10) (or (< |old(~p_num_write~0)| ~c_num_read~0) .cse21 (or .cse2 .cse3 .cse23) .cse13 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse0 .cse2 .cse3 .cse4 .cse21 .cse12 .cse13 .cse14 .cse15 (and .cse5 .cse22 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse16 .cse17) (or .cse20 (and .cse8 .cse19 .cse6 (= 1 ~p_dw_pc~0)) .cse18 .cse13))))) [2018-11-10 11:51:16,586 INFO L421 ceAbstractionStarter]: At program point L124(line 124) the Hoare annotation is: (let ((.cse15 (= |old(~p_dw_pc~0)| 1)) (.cse25 (= ~p_dw_i~0 1))) (let ((.cse6 (not (= ~p_dw_st~0 2))) (.cse8 (= 2 ~c_dr_st~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= 1 ~p_dw_pc~0)) (.cse20 (= 1 ~c_dr_pc~0)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse25)) (.cse24 (not .cse15))) (let ((.cse2 (= |old(~p_dw_pc~0)| 2)) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (not (= 0 ~c_num_read~0))) (.cse7 (= 1 ~p_num_write~0)) (.cse18 (or .cse20 .cse0 .cse1 .cse24)) (.cse12 (= |old(~p_dw_st~0)| 0)) (.cse19 (and (not (= ~c_dr_pc~0 1)) .cse6 .cse8 .cse25 .cse10 .cse22)) (.cse13 (not (= 2 |old(~c_dr_st~0)|))) (.cse4 (not (= ~p_dw_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse9 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse23 (= 0 |old(~c_dr_st~0)|)) (.cse3 (not (= |old(~q_free~0)| 1))) (.cse14 (= |old(~p_dw_st~0)| 2)) (.cse17 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse21 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse13 .cse19 .cse14) (or .cse20 .cse0 .cse1 .cse8 .cse13 .cse3 .cse14 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse20 .cse14 .cse15 .cse16 (and .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) .cse17) (or .cse18 (and .cse6 .cse21 .cse10 .cse22) .cse23 .cse14) (or .cse12 .cse19 (or (< |old(~p_num_write~0)| ~c_num_read~0) .cse13 (or .cse0 .cse1 .cse24) .cse14 (< ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse8 .cse10 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse4 .cse5 .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse9)) (or .cse20 .cse0 .cse1 .cse23 .cse3 .cse14 .cse15 .cse17 (and .cse6 (not (= ~p_dw_pc~0 1)) .cse21 .cse10)))))) [2018-11-10 11:51:16,586 INFO L425 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-11-10 11:51:16,586 INFO L425 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2018-11-10 11:51:16,586 INFO L425 ceAbstractionStarter]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2018-11-10 11:51:16,586 INFO L421 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse13 (= |old(~p_dw_pc~0)| 1)) (.cse24 (= ~p_dw_i~0 1))) (let ((.cse11 (= 1 ~c_dr_pc~0)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse24)) (.cse20 (not .cse13)) (.cse4 (not (= ~p_dw_st~0 2))) (.cse19 (= 2 ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= 1 ~p_dw_pc~0))) (let ((.cse2 (= |old(~p_dw_pc~0)| 2)) (.cse9 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse14 (not (= 0 ~c_num_read~0))) (.cse10 (= |old(~p_dw_st~0)| 0)) (.cse18 (and (not (= ~c_dr_pc~0 1)) .cse4 .cse19 .cse24 .cse6 .cse21)) (.cse17 (not (= 2 |old(~c_dr_st~0)|))) (.cse3 (not (= ~p_dw_st~0 0))) (.cse16 (or .cse11 .cse0 .cse1 .cse20)) (.cse23 (= 0 |old(~c_dr_st~0)|)) (.cse8 (not (= |old(~q_free~0)| 1))) (.cse12 (= |old(~p_dw_st~0)| 2)) (.cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse22 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse17 .cse18 .cse12) (or .cse11 .cse0 .cse1 .cse19 .cse17 .cse8 .cse12 .cse15) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse10 .cse17 (and .cse3 .cse4 .cse19 .cse5 .cse6 .cse7) .cse12 .cse13 .cse14 .cse15) (or .cse10 .cse18 (or (< |old(~p_num_write~0)| ~c_num_read~0) .cse17 (or .cse0 .cse1 .cse20) .cse12 (< ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse3 (and (= ~p_num_write~0 |old(~p_num_write~0)|) (and .cse4 .cse19 .cse6 .cse21)))) (or .cse16 (and .cse4 .cse22 .cse6 .cse21) .cse23 .cse12) (or .cse11 .cse0 .cse1 .cse23 .cse8 .cse12 .cse13 .cse15 (and .cse4 (not (= ~p_dw_pc~0 1)) .cse22 .cse6)))))) [2018-11-10 11:51:16,587 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 127) no Hoare annotation was computed. [2018-11-10 11:51:16,587 INFO L421 ceAbstractionStarter]: At program point L107-2(lines 95 132) the Hoare annotation is: (let ((.cse21 (= |old(~p_dw_pc~0)| 1)) (.cse29 (= ~p_dw_i~0 1))) (let ((.cse4 (= 1 ~c_dr_pc~0)) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not .cse29)) (.cse26 (not .cse21)) (.cse7 (= 2 ~c_dr_st~0)) (.cse25 (= 1 ~p_dw_pc~0)) (.cse14 (not (= ~p_dw_st~0 0))) (.cse23 (= ~q_free~0 0)) (.cse15 (not (= ~p_dw_st~0 2))) (.cse17 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse10 (= |old(~p_dw_pc~0)| 2)) (.cse12 (= ~q_free~0 1)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= 0 ~p_num_write~0)) (.cse19 (not (= 0 |old(~p_num_write~0)|))) (.cse22 (not (= 0 ~c_num_read~0))) (.cse11 (and .cse14 .cse23 .cse15 (= 1 ~p_num_write~0) .cse17 .cse13)) (.cse20 (= |old(~p_dw_st~0)| 0)) (.cse2 (and (not (= ~c_dr_pc~0 1)) .cse15 .cse7 .cse29 .cse13 .cse25)) (.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse0 (or .cse4 .cse5 .cse6 .cse26)) (.cse28 (= 0 |old(~c_dr_st~0)|)) (.cse8 (not (= |old(~q_free~0)| 1))) (.cse3 (= |old(~p_dw_st~0)| 2)) (.cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse27 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse1 .cse8 .cse3 .cse9) (or .cse5 .cse6 .cse10 .cse8 .cse11 (and .cse12 .cse7 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse20 .cse1 .cse3 .cse21 .cse22 .cse9) (or .cse5 .cse6 .cse10 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse8 .cse19 .cse20 .cse4 .cse3 .cse21 .cse22 .cse11 .cse9) (or .cse20 .cse2 (let ((.cse24 (+ |old(~p_num_write~0)| 1))) (and .cse23 (<= .cse24 ~p_num_write~0) (and .cse15 .cse13 .cse25) (<= ~p_num_write~0 .cse24))) (or (< |old(~p_num_write~0)| ~c_num_read~0) .cse1 (or .cse5 .cse6 .cse26) .cse3 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse0 (and .cse15 .cse27 .cse13 .cse25) .cse28 .cse3) (or .cse4 .cse5 .cse6 .cse28 .cse8 .cse3 .cse21 .cse9 (and .cse15 (not (= ~p_dw_pc~0 1)) .cse27 .cse13)))))) [2018-11-10 11:51:16,587 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2018-11-10 11:51:16,587 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-11-10 11:51:16,587 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-11-10 11:51:16,587 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-11-10 11:51:16,587 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-11-10 11:51:16,587 INFO L421 ceAbstractionStarter]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse10 (= ~p_dw_pc~0 1)) (.cse6 (not .cse19)) (.cse7 (not (= ~p_dw_st~0 2))) (.cse15 (= 2 ~c_dr_st~0))) (let ((.cse12 (not (= ~c_dr_st~0 0))) (.cse4 (= ~p_dw_pc~0 2)) (.cse8 (not (= 1 ~p_num_write~0))) (.cse11 (not (= 0 ~c_num_read~0))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (= |old(~p_dw_st~0)| 2)) (.cse5 (not (= ~q_free~0 0))) (.cse17 (and .cse6 .cse7 .cse15)) (.cse1 (= 1 ~c_dr_pc~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse14 (not .cse10)) (.cse13 (= 0 |old(~c_dr_st~0)|)) (.cse0 (= |old(~p_dw_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or (< ~p_num_write~0 ~c_num_read~0) .cse2 .cse3 (and (<= 2 ~p_dw_st~0) .cse12) .cse13 .cse14 (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 .cse1 .cse2 .cse3 .cse13 .cse9 (and .cse7 .cse12)) (or .cse1 .cse2 .cse3 .cse15 .cse16 .cse9) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse17 .cse8 .cse9 .cse11) (let ((.cse18 (+ ~c_num_read~0 1))) (or .cse0 (< ~p_num_write~0 .cse18) (or .cse16 (or .cse2 .cse3 .cse14) .cse9) .cse5 (< .cse18 ~p_num_write~0) .cse17)) (or (or .cse1 .cse2 .cse3 .cse14) .cse19 .cse13 (not .cse0)))))) [2018-11-10 11:51:16,587 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2018-11-10 11:51:16,587 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-10 11:51:16,587 INFO L425 ceAbstractionStarter]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2018-11-10 11:51:16,587 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2018-11-10 11:51:16,588 INFO L425 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2018-11-10 11:51:16,588 INFO L421 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse10 (= ~p_dw_pc~0 1)) (.cse6 (not .cse19)) (.cse7 (not (= ~p_dw_st~0 2))) (.cse15 (= 2 ~c_dr_st~0))) (let ((.cse12 (not (= ~c_dr_st~0 0))) (.cse4 (= ~p_dw_pc~0 2)) (.cse8 (not (= 1 ~p_num_write~0))) (.cse11 (not (= 0 ~c_num_read~0))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (= |old(~p_dw_st~0)| 2)) (.cse5 (not (= ~q_free~0 0))) (.cse17 (and .cse6 .cse7 .cse15)) (.cse1 (= 1 ~c_dr_pc~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse14 (not .cse10)) (.cse13 (= 0 |old(~c_dr_st~0)|)) (.cse0 (= |old(~p_dw_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or (< ~p_num_write~0 ~c_num_read~0) .cse2 .cse3 (and (<= 2 ~p_dw_st~0) .cse12) .cse13 .cse14 (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 .cse1 .cse2 .cse3 .cse13 .cse9 (and .cse7 .cse12)) (or .cse1 .cse2 .cse3 .cse15 .cse16 .cse9) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse17 .cse8 .cse9 .cse11) (let ((.cse18 (+ ~c_num_read~0 1))) (or .cse0 (< ~p_num_write~0 .cse18) (or .cse16 (or .cse2 .cse3 .cse14) .cse9) .cse5 (< .cse18 ~p_num_write~0) .cse17)) (or (or .cse1 .cse2 .cse3 .cse14) .cse19 .cse13 (not .cse0)))))) [2018-11-10 11:51:16,588 INFO L421 ceAbstractionStarter]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse15 (= ~p_dw_pc~0 1))) (let ((.cse7 (= 1 ~c_dr_pc~0)) (.cse8 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse18 (not .cse15)) (.cse13 (= immediate_notify_threads_~tmp~0 0)) (.cse17 (= ~p_dw_st~0 0))) (let ((.cse10 (= ~p_dw_pc~0 2)) (.cse12 (not .cse17)) (.cse14 (not (= 1 ~p_num_write~0))) (.cse16 (not (= 0 ~c_num_read~0))) (.cse1 (or .cse13 .cse17)) (.cse11 (not (= ~q_free~0 0))) (.cse2 (not (= ~p_dw_st~0 2))) (.cse3 (not (= ~c_dr_st~0 0))) (.cse0 (or .cse7 .cse8 .cse9 .cse18)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse6 (= |old(~p_dw_st~0)| 0)) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse20 (= 2 ~c_dr_st~0)) (.cse5 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse2) .cse14 .cse5 .cse15 .cse16) (or (and .cse17 .cse3) (< ~p_num_write~0 ~c_num_read~0) .cse8 .cse9 .cse4 .cse18 (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)) (and (<= 2 ~p_dw_st~0) .cse13 .cse3)) (or .cse6 .cse8 .cse9 .cse10 .cse11 .cse19 (and .cse20 .cse12 .cse13 .cse2) .cse14 .cse5 .cse15 .cse16) (let ((.cse21 (+ ~c_num_read~0 1))) (or (and .cse2 .cse1 .cse20) .cse6 (< ~p_num_write~0 .cse21) (or .cse19 (or .cse8 .cse9 .cse18) .cse5) .cse11 (< .cse21 ~p_num_write~0))) (or .cse7 (and .cse13 .cse2 .cse3) .cse8 .cse9 .cse4 .cse5 .cse15) (or .cse0 .cse17 .cse4 (not .cse6)) (or .cse7 .cse8 .cse9 .cse19 .cse20 .cse5))))) [2018-11-10 11:51:16,588 INFO L425 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2018-11-10 11:51:16,588 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:51:16,588 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)) [2018-11-10 11:51:16,588 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:51:16,589 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse30 (= |old(~p_dw_pc~0)| 1))) (let ((.cse36 (+ |old(~c_num_read~0)| 1)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse13 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (not .cse30))) (let ((.cse10 (not (= ~c_dr_st~0 0))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse23 (not (= ~c_dr_pc~0 1))) (.cse16 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse33 (or .cse1 .cse2 .cse13 .cse5)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse22 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse7 (< |old(~p_num_write~0)| .cse36)) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse9 (< .cse36 |old(~p_num_write~0)|)) (.cse19 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse34 (<= 2 ~p_dw_st~0)) (.cse21 (= 1 ~p_dw_pc~0)) (.cse11 (< |old(~p_dw_st~0)| 2)) (.cse29 (= |old(~p_dw_pc~0)| 2)) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse24 (= ~q_free~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse12 (= 2 ~c_dr_st~0)) (.cse20 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (= ~c_num_read~0 0)) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse28 (= 0 ~p_num_write~0)) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse31 (not (= 0 |old(~c_num_read~0)|))) (.cse32 (not (= 0 |old(~p_num_write~0)|))) (.cse15 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse12 .cse13 .cse14 .cse6 .cse15) (or .cse16 (and .cse17 .cse18 .cse19 .cse3 .cse12 .cse20 .cse21) (or .cse1 .cse2 .cse13 .cse5 .cse6) .cse22) (or .cse12 .cse0 .cse1 .cse2 .cse13 .cse5) (or (and .cse23 .cse24 .cse3 .cse20 .cse25 .cse26 .cse27 .cse28) .cse0 .cse1 .cse2 .cse29 .cse14 .cse6 .cse30 .cse31 .cse32 .cse15) (or .cse0 (and .cse23 .cse24 (not (= ~p_dw_pc~0 1)) .cse26 .cse3 .cse10 .cse20) .cse1 .cse2 .cse4 .cse14 .cse6 .cse30 .cse15) (or .cse0 .cse1 .cse2 (and .cse23 .cse10 .cse20 .cse21) .cse4 .cse5) (or .cse7 .cse8 .cse9 .cse12 .cse33 .cse11) (or .cse0 .cse1 .cse2 .cse8 .cse5 (not (= 1 |old(~p_num_write~0)|)) .cse31 .cse23 .cse11) (or .cse16 .cse33 (and .cse17 .cse18 .cse19 .cse34 .cse12 .cse20 .cse21) .cse22 .cse11) (or .cse7 .cse1 .cse2 .cse8 .cse9 (let ((.cse35 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse35 ~p_num_write~0) .cse19 .cse34 (<= ~p_num_write~0 .cse35) .cse20 .cse21)) .cse5 .cse11) (or .cse1 .cse2 .cse29 .cse13 .cse14 (and .cse24 .cse3 .cse12 .cse20 .cse25 .cse26 .cse27 .cse28) .cse6 .cse30 .cse31 .cse32 .cse15))))) [2018-11-10 11:51:16,589 INFO L421 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (let ((.cse19 (= |old(~p_dw_pc~0)| 1)) (.cse8 (= ~c_num_read~0 0)) (.cse12 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse13 (= 0 ~p_num_write~0)) (.cse9 (not (= ~p_dw_st~0 0))) (.cse26 (= 2 ~c_dr_st~0)) (.cse35 (= 1 ~p_dw_pc~0)) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse6 (= ~q_free~0 1)) (.cse10 (not (= ~p_dw_st~0 2))) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse34 (not (= ~c_dr_st~0 0))) (.cse33 (= ~p_dw_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse36 (+ |old(~c_num_read~0)| 1))) (let ((.cse27 (< |old(~p_num_write~0)| .cse36)) (.cse28 (not (= |old(~q_free~0)| 0))) (.cse29 (< .cse36 |old(~p_num_write~0)|)) (.cse23 (= 0 |old(~c_dr_st~0)|)) (.cse21 (and .cse5 .cse6 .cse10 (not (= ~p_dw_pc~0 1)) .cse11 .cse34 .cse33 .cse7)) (.cse17 (= 1 |old(~c_dr_pc~0)|)) (.cse0 (and .cse9 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse26 .cse33 .cse7 .cse35))) (.cse4 (= |old(~p_dw_pc~0)| 2)) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse15 (and .cse6 .cse26 .cse7 (not (= ~p_dw_pc~0 2)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse33 .cse13)) (.cse16 (not (= 0 |old(~p_num_write~0)|))) (.cse18 (not (= |old(~p_dw_st~0)| 0))) (.cse20 (not (= 0 |old(~c_num_read~0)|))) (.cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse31 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse3 (and .cse5 .cse10 .cse34 .cse33 .cse7 .cse35)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse33)) (.cse25 (not (= 2 |old(~c_dr_st~0)|))) (.cse24 (not .cse19)) (.cse32 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse30 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse17 .cse1 .cse2 .cse3 .cse23 .cse24) (or .cse17 .cse1 .cse2 .cse25 .cse26 .cse24) (or .cse27 .cse1 .cse2 .cse3 .cse28 .cse29 .cse23 .cse24 .cse30) (or .cse27 .cse1 .cse2 .cse0 .cse3 .cse28 .cse29 .cse24 .cse30) (or .cse17 .cse1 .cse2 .cse3 .cse23 .cse14 .cse18 .cse21 .cse22) (or .cse17 .cse1 .cse2 .cse25 .cse26 .cse14 .cse18 .cse22) (or .cse31 .cse0 .cse3 (or .cse1 .cse2 .cse25 .cse24 .cse18) .cse32) (or .cse1 .cse2 .cse0 .cse3 .cse4 .cse14 .cse15 .cse16 .cse25 .cse18 .cse20 .cse22) (or .cse31 .cse3 (or .cse1 .cse2 .cse25 .cse24) .cse32 .cse30)))) [2018-11-10 11:51:16,589 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2018-11-10 11:51:16,589 INFO L425 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2018-11-10 11:51:16,589 INFO L425 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-11-10 11:51:16,589 INFO L421 ceAbstractionStarter]: At program point L238(line 238) the Hoare annotation is: (let ((.cse40 (= |old(~p_dw_pc~0)| 1)) (.cse43 (= ~p_dw_i~0 1)) (.cse42 (+ ~c_num_read~0 1))) (let ((.cse28 (<= .cse42 ~p_num_write~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse3 (<= ~c_num_read~0 ~p_num_write~0)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 1 ~p_dw_pc~0)) (.cse44 (+ |old(~c_num_read~0)| 1)) (.cse5 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse7 (= 2 ~c_dr_st~0)) (.cse33 (= ~c_num_read~0 0)) (.cse35 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= 0 ~p_num_write~0)) (.cse30 (not (= ~c_dr_pc~0 1))) (.cse31 (= ~q_free~0 1)) (.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse32 (= ~p_dw_st~0 0)) (.cse29 (not (= ~c_dr_st~0 0))) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse15 (not .cse43)) (.cse24 (not (= 2 |old(~c_dr_st~0)|))) (.cse20 (not .cse40))) (let ((.cse0 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse10 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse16 (= 0 |old(~c_dr_st~0)|)) (.cse2 (or .cse14 .cse15 .cse24 .cse20)) (.cse13 (and .cse30 .cse31 .cse34 .cse32 .cse29 .cse8)) (.cse12 (= 1 |old(~c_dr_pc~0)|)) (.cse37 (= |old(~p_dw_pc~0)| 2)) (.cse17 (not (= |old(~q_free~0)| 1))) (.cse38 (not (= 0 |old(~p_num_write~0)|))) (.cse39 (and .cse31 .cse5 .cse32 .cse7 .cse8 (not (= ~p_dw_pc~0 2)) .cse33 .cse34 .cse35 .cse43 .cse36)) (.cse18 (not (= |old(~p_dw_st~0)| 0))) (.cse41 (not (= 0 |old(~c_num_read~0)|))) (.cse19 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse25 (< |old(~p_num_write~0)| .cse44)) (.cse21 (and .cse3 .cse4 .cse32 .cse7 .cse43 .cse8 .cse9)) (.cse27 (< .cse44 |old(~p_num_write~0)|)) (.cse26 (not (= |old(~q_free~0)| 0))) (.cse1 (and .cse30 .cse29 .cse43 .cse8 .cse9)) (.cse22 (and .cse3 .cse4 .cse6 .cse7 .cse43 .cse8 .cse9)) (.cse23 (and (= ~q_free~0 0) .cse28 .cse6 (<= ~p_num_write~0 .cse42) .cse43 .cse8 .cse9)) (.cse11 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) (or .cse12 .cse13 .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19) (or .cse12 .cse14 .cse15 .cse1 .cse16 .cse20) (or .cse21 .cse0 .cse1 .cse22 .cse23 (or .cse14 .cse15 .cse24 .cse20 .cse18) .cse10) (or .cse12 .cse14 .cse15 .cse7 .cse24 .cse17 .cse18 .cse19) (or .cse25 .cse14 .cse15 .cse26 .cse1 .cse27 .cse16 .cse20 (and .cse28 .cse5 .cse29) .cse11) (or .cse25 .cse26 .cse1 .cse27 .cse7 .cse2 .cse11) (or .cse21 (and .cse30 .cse31 .cse32 .cse8 .cse33 .cse34 .cse35 .cse36) .cse13 .cse14 .cse15 .cse37 .cse17 .cse38 .cse12 .cse1 .cse22 .cse23 .cse39 .cse18 .cse40 .cse41 .cse19) (or .cse7 .cse12 .cse14 .cse15 .cse24 .cse20) (or .cse21 .cse14 .cse15 .cse37 .cse17 .cse38 .cse24 .cse1 .cse22 .cse23 .cse39 .cse18 .cse41 .cse19) (or .cse25 .cse21 .cse14 .cse15 .cse27 .cse20 .cse26 .cse1 .cse22 .cse23 .cse11))))) [2018-11-10 11:51:16,590 INFO L421 ceAbstractionStarter]: At program point L269(line 269) the Hoare annotation is: (let ((.cse16 (= |old(~p_dw_pc~0)| 1)) (.cse22 (+ |old(~c_num_read~0)| 1)) (.cse15 (not (= ~c_dr_st~0 0))) (.cse23 (= ~p_dw_i~0 1)) (.cse14 (= ~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)|)) (.cse12 (= |old(~p_dw_pc~0)| 2)) (.cse10 (not (= |old(~q_free~0)| 1))) (.cse1 (let ((.cse24 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse24 ~p_num_write~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse24) .cse15 .cse23 .cse14 (= 1 ~p_dw_pc~0)))) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse8 (= 1 |old(~c_dr_pc~0)|)) (.cse19 (< |old(~p_num_write~0)| .cse22)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse23)) (.cse20 (not (= |old(~q_free~0)| 0))) (.cse21 (< .cse22 |old(~p_num_write~0)|)) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse5 (not .cse16)) (.cse18 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (or .cse8 .cse2 .cse3 .cse9 .cse10 .cse6 .cse11) (or .cse2 .cse3 .cse12 .cse10 .cse1 .cse13 (and (not (= ~c_dr_pc~0 1)) (= ~q_free~0 1) (= ~p_dw_st~0 0) .cse14 (= ~c_num_read~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) .cse8 .cse6 .cse16 .cse17 .cse11) (or .cse0 (or .cse2 .cse3 .cse4 .cse5) .cse7 .cse18) (or .cse19 .cse2 .cse3 .cse20 .cse21 .cse5 .cse1 .cse18) (or .cse2 .cse3 .cse12 .cse10 .cse1 .cse13 .cse4 .cse6 .cse17 .cse11) (or .cse8 .cse2 .cse3 .cse9 .cse5) (or .cse19 .cse2 .cse3 .cse20 .cse21 .cse9 .cse5 .cse18)))) [2018-11-10 11:51:16,590 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2018-11-10 11:51:16,590 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2018-11-10 11:51:16,590 INFO L425 ceAbstractionStarter]: For program point L247(lines 237 277) no Hoare annotation was computed. [2018-11-10 11:51:16,590 INFO L421 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse40 (= |old(~p_dw_pc~0)| 1)) (.cse43 (= ~p_dw_i~0 1)) (.cse42 (+ ~c_num_read~0 1))) (let ((.cse28 (<= .cse42 ~p_num_write~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse3 (<= ~c_num_read~0 ~p_num_write~0)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 1 ~p_dw_pc~0)) (.cse44 (+ |old(~c_num_read~0)| 1)) (.cse5 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse7 (= 2 ~c_dr_st~0)) (.cse33 (= ~c_num_read~0 0)) (.cse35 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= 0 ~p_num_write~0)) (.cse30 (not (= ~c_dr_pc~0 1))) (.cse31 (= ~q_free~0 1)) (.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse32 (= ~p_dw_st~0 0)) (.cse29 (not (= ~c_dr_st~0 0))) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse15 (not .cse43)) (.cse24 (not (= 2 |old(~c_dr_st~0)|))) (.cse20 (not .cse40))) (let ((.cse0 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse10 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse16 (= 0 |old(~c_dr_st~0)|)) (.cse2 (or .cse14 .cse15 .cse24 .cse20)) (.cse13 (and .cse30 .cse31 .cse34 .cse32 .cse29 .cse8)) (.cse12 (= 1 |old(~c_dr_pc~0)|)) (.cse37 (= |old(~p_dw_pc~0)| 2)) (.cse17 (not (= |old(~q_free~0)| 1))) (.cse38 (not (= 0 |old(~p_num_write~0)|))) (.cse39 (and .cse31 .cse5 .cse32 .cse7 .cse8 (not (= ~p_dw_pc~0 2)) .cse33 .cse34 .cse35 .cse43 .cse36)) (.cse18 (not (= |old(~p_dw_st~0)| 0))) (.cse41 (not (= 0 |old(~c_num_read~0)|))) (.cse19 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse25 (< |old(~p_num_write~0)| .cse44)) (.cse21 (and .cse3 .cse4 .cse32 .cse7 .cse43 .cse8 .cse9)) (.cse27 (< .cse44 |old(~p_num_write~0)|)) (.cse26 (not (= |old(~q_free~0)| 0))) (.cse1 (and .cse30 .cse29 .cse43 .cse8 .cse9)) (.cse22 (and .cse3 .cse4 .cse6 .cse7 .cse43 .cse8 .cse9)) (.cse23 (and (= ~q_free~0 0) .cse28 .cse6 (<= ~p_num_write~0 .cse42) .cse43 .cse8 .cse9)) (.cse11 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) (or .cse12 .cse13 .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19) (or .cse12 .cse14 .cse15 .cse1 .cse16 .cse20) (or .cse21 .cse0 .cse1 .cse22 .cse23 (or .cse14 .cse15 .cse24 .cse20 .cse18) .cse10) (or .cse12 .cse14 .cse15 .cse7 .cse24 .cse17 .cse18 .cse19) (or .cse25 .cse14 .cse15 .cse26 .cse1 .cse27 .cse16 .cse20 (and .cse28 .cse5 .cse29) .cse11) (or .cse25 .cse26 .cse1 .cse27 .cse7 .cse2 .cse11) (or .cse21 (and .cse30 .cse31 .cse32 .cse8 .cse33 .cse34 .cse35 .cse36) .cse13 .cse14 .cse15 .cse37 .cse17 .cse38 .cse12 .cse1 .cse22 .cse23 .cse39 .cse18 .cse40 .cse41 .cse19) (or .cse7 .cse12 .cse14 .cse15 .cse24 .cse20) (or .cse21 .cse14 .cse15 .cse37 .cse17 .cse38 .cse24 .cse1 .cse22 .cse23 .cse39 .cse18 .cse41 .cse19) (or .cse25 .cse21 .cse14 .cse15 .cse27 .cse20 .cse26 .cse1 .cse22 .cse23 .cse11))))) [2018-11-10 11:51:16,590 INFO L425 ceAbstractionStarter]: For program point L237-1(lines 237 277) no Hoare annotation was computed. [2018-11-10 11:51:16,590 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2018-11-10 11:51:16,591 INFO L421 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse40 (= |old(~p_dw_pc~0)| 1)) (.cse43 (= ~p_dw_i~0 1)) (.cse42 (+ ~c_num_read~0 1))) (let ((.cse28 (<= .cse42 ~p_num_write~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse3 (<= ~c_num_read~0 ~p_num_write~0)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 1 ~p_dw_pc~0)) (.cse44 (+ |old(~c_num_read~0)| 1)) (.cse5 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse7 (= 2 ~c_dr_st~0)) (.cse33 (= ~c_num_read~0 0)) (.cse35 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= 0 ~p_num_write~0)) (.cse30 (not (= ~c_dr_pc~0 1))) (.cse31 (= ~q_free~0 1)) (.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse32 (= ~p_dw_st~0 0)) (.cse29 (not (= ~c_dr_st~0 0))) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse15 (not .cse43)) (.cse24 (not (= 2 |old(~c_dr_st~0)|))) (.cse20 (not .cse40))) (let ((.cse0 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse10 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse16 (= 0 |old(~c_dr_st~0)|)) (.cse2 (or .cse14 .cse15 .cse24 .cse20)) (.cse13 (and .cse30 .cse31 .cse34 .cse32 .cse29 .cse8)) (.cse12 (= 1 |old(~c_dr_pc~0)|)) (.cse37 (= |old(~p_dw_pc~0)| 2)) (.cse17 (not (= |old(~q_free~0)| 1))) (.cse38 (not (= 0 |old(~p_num_write~0)|))) (.cse39 (and .cse31 .cse5 .cse32 .cse7 .cse8 (not (= ~p_dw_pc~0 2)) .cse33 .cse34 .cse35 .cse43 .cse36)) (.cse18 (not (= |old(~p_dw_st~0)| 0))) (.cse41 (not (= 0 |old(~c_num_read~0)|))) (.cse19 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse25 (< |old(~p_num_write~0)| .cse44)) (.cse21 (and .cse3 .cse4 .cse32 .cse7 .cse43 .cse8 .cse9)) (.cse27 (< .cse44 |old(~p_num_write~0)|)) (.cse26 (not (= |old(~q_free~0)| 0))) (.cse1 (and .cse30 .cse29 .cse43 .cse8 .cse9)) (.cse22 (and .cse3 .cse4 .cse6 .cse7 .cse43 .cse8 .cse9)) (.cse23 (and (= ~q_free~0 0) .cse28 .cse6 (<= ~p_num_write~0 .cse42) .cse43 .cse8 .cse9)) (.cse11 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) (or .cse12 .cse13 .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19) (or .cse12 .cse14 .cse15 .cse1 .cse16 .cse20) (or .cse21 .cse0 .cse1 .cse22 .cse23 (or .cse14 .cse15 .cse24 .cse20 .cse18) .cse10) (or .cse12 .cse14 .cse15 .cse7 .cse24 .cse17 .cse18 .cse19) (or .cse25 .cse14 .cse15 .cse26 .cse1 .cse27 .cse16 .cse20 (and .cse28 .cse5 .cse29) .cse11) (or .cse25 .cse26 .cse1 .cse27 .cse7 .cse2 .cse11) (or .cse21 (and .cse30 .cse31 .cse32 .cse8 .cse33 .cse34 .cse35 .cse36) .cse13 .cse14 .cse15 .cse37 .cse17 .cse38 .cse12 .cse1 .cse22 .cse23 .cse39 .cse18 .cse40 .cse41 .cse19) (or .cse7 .cse12 .cse14 .cse15 .cse24 .cse20) (or .cse21 .cse14 .cse15 .cse37 .cse17 .cse38 .cse24 .cse1 .cse22 .cse23 .cse39 .cse18 .cse41 .cse19) (or .cse25 .cse21 .cse14 .cse15 .cse27 .cse20 .cse26 .cse1 .cse22 .cse23 .cse11))))) [2018-11-10 11:51:16,591 INFO L425 ceAbstractionStarter]: For program point L290-1(line 290) no Hoare annotation was computed. [2018-11-10 11:51:16,591 INFO L428 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: true [2018-11-10 11:51:16,591 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2018-11-10 11:51:16,591 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2018-11-10 11:51:16,591 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2018-11-10 11:51:16,591 INFO L428 ceAbstractionStarter]: At program point L290(line 290) the Hoare annotation is: true [2018-11-10 11:51:16,591 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2018-11-10 11:51:16,591 INFO L421 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse5 (= ~p_dw_pc~0 1)) (.cse1 (= 1 ~c_dr_pc~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse6 (= 0 ~c_dr_st~0)) (.cse0 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse4 (= ~p_dw_st~0 2))) (and (or .cse0 (= ~p_dw_st~0 0) .cse1 .cse2 .cse3 (= ~p_dw_pc~0 2) (not (= ~q_free~0 0)) (not (= 1 ~p_num_write~0)) .cse4 .cse5 (not (= 0 ~c_num_read~0))) (or .cse1 (< ~p_num_write~0 ~c_num_read~0) .cse2 .cse3 .cse6 (not .cse5) (not (= ~q_free~0 1)) (< ~c_num_read~0 ~p_num_write~0) .cse0 (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse1 .cse2 .cse3 .cse6 .cse0 .cse4))) [2018-11-10 11:51:16,591 INFO L428 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2018-11-10 11:51:16,591 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2018-11-10 11:51:16,592 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2018-11-10 11:51:16,592 INFO L425 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2018-11-10 11:51:16,592 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2018-11-10 11:51:16,592 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2018-11-10 11:51:16,592 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (and (not (= ~c_dr_pc~0 1)) (= ~q_free~0 1) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (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-10 11:51:16,592 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2018-11-10 11:51:16,592 INFO L425 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2018-11-10 11:51:16,592 INFO L421 ceAbstractionStarter]: At program point L317(line 317) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= 2 ~c_dr_st~0)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse11 (= 0 ~p_num_write~0)) (.cse7 (= ~q_free~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= ~p_dw_st~0 0)) (.cse6 (not (= ~c_dr_pc~0 1))) (.cse13 (not (= ~c_dr_st~0 0))) (.cse12 (<= 2 ~p_dw_st~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse4 .cse8 .cse9 .cse10 .cse11) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5) (and .cse7 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse6 .cse7 .cse9 .cse2 .cse13 .cse4) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse6 .cse13 .cse4 .cse5) (let ((.cse14 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse14 ~p_num_write~0) .cse12 (<= ~p_num_write~0 .cse14) .cse4 .cse5)) (not (= |old(~p_dw_st~0)| 0)))) [2018-11-10 11:51:16,593 INFO L421 ceAbstractionStarter]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= 2 ~c_dr_st~0)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse11 (= 0 ~p_num_write~0)) (.cse7 (= ~q_free~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= ~p_dw_st~0 0)) (.cse6 (not (= ~c_dr_pc~0 1))) (.cse13 (not (= ~c_dr_st~0 0))) (.cse12 (<= 2 ~p_dw_st~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse4 .cse8 .cse9 .cse10 .cse11) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5) (and .cse7 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse6 .cse7 .cse9 .cse2 .cse13 .cse4) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse6 .cse13 .cse4 .cse5) (let ((.cse14 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse14 ~p_num_write~0) .cse12 (<= ~p_num_write~0 .cse14) .cse4 .cse5)) (not (= |old(~p_dw_st~0)| 0)))) [2018-11-10 11:51:16,593 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2018-11-10 11:51:16,593 INFO L425 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2018-11-10 11:51:16,593 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 325) no Hoare annotation was computed. [2018-11-10 11:51:16,593 INFO L421 ceAbstractionStarter]: At program point L313-2(lines 310 325) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= 2 ~c_dr_st~0)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse11 (= 0 ~p_num_write~0)) (.cse7 (= ~q_free~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= ~p_dw_st~0 0)) (.cse6 (not (= ~c_dr_pc~0 1))) (.cse13 (not (= ~c_dr_st~0 0))) (.cse12 (<= 2 ~p_dw_st~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse4 .cse8 .cse9 .cse10 .cse11) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5) (and .cse7 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse6 .cse7 .cse9 .cse2 .cse13 .cse4) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse6 .cse13 .cse4 .cse5) (let ((.cse14 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse14 ~p_num_write~0) .cse12 (<= ~p_num_write~0 .cse14) .cse4 .cse5)) (not (= |old(~p_dw_st~0)| 0)))) [2018-11-10 11:51:16,593 INFO L421 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (and (not (= ~c_dr_pc~0 1)) (= ~q_free~0 1) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (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-10 11:51:16,593 INFO L428 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2018-11-10 11:51:16,593 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:51:16,594 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-10 11:51:16,594 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:51:16,594 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:51:16,594 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-11-10 11:51:16,594 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2018-11-10 11:51:16,594 INFO L425 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2018-11-10 11:51:16,594 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2018-11-10 11:51:16,594 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2018-11-10 11:51:16,594 INFO L421 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse7 (= ~p_dw_pc~0 2)) (.cse8 (not (= ~q_free~0 0))) (.cse5 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse9 (not (= 1 ~p_num_write~0))) (.cse3 (= ~p_dw_st~0 2)) (.cse4 (= ~p_dw_pc~0 1)) (.cse10 (not (= 0 ~c_num_read~0)))) (and (or .cse0 .cse1 .cse2 (= 0 ~c_dr_st~0) .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse1 .cse2 .cse7 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5) (or .cse6 .cse1 .cse2 .cse7 .cse8 (not (= 2 ~c_dr_st~0)) .cse5 .cse9 .cse3 .cse4 .cse10))) [2018-11-10 11:51:16,594 INFO L428 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2018-11-10 11:51:16,594 INFO L425 ceAbstractionStarter]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2018-11-10 11:51:16,595 INFO L421 ceAbstractionStarter]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse7 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse2 (= ~q_free~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= 2 ~c_dr_st~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~p_dw_pc~0 1))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1)) (.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0))) (or (< ~p_num_write~0 .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 (not (= |old(~q_free~0)| 0)) (< .cse0 ~p_num_write~0) .cse9 (not .cse10) (and .cse5 .cse1 .cse2 (<= 2 ~p_dw_st~0) .cse4) (< |old(~p_dw_st~0)| 2))) (or (= 1 |old(~c_dr_pc~0)|) .cse7 .cse8 (= ~p_dw_pc~0 2) .cse9 (not (= |old(~q_free~0)| 1)) (and .cse2 .cse3 .cse4 (= ~c_num_read~0 0) .cse6) (not (= |old(~p_dw_st~0)| 0)) .cse10 (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-10 11:51:16,595 INFO L425 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2018-11-10 11:51:16,595 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-10 11:51:16,595 INFO L421 ceAbstractionStarter]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse4 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= ~p_dw_i~0 1))) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse12 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_free~0 1)) (.cse10 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (not (= ~c_dr_st~0 0)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1)) (.cse6 (<= ~c_num_read~0 ~p_num_write~0)) (.cse7 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (< ~p_num_write~0 .cse0) (let ((.cse1 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (not (= ~c_dr_pc~0 1)) (<= .cse1 ~p_num_write~0) .cse2 (<= ~p_num_write~0 .cse1) .cse3)) .cse4 .cse5 (not (= |old(~q_free~0)| 0)) (and .cse6 .cse7 .cse8 .cse9 .cse10) (< .cse0 ~p_num_write~0) .cse11 (not .cse12) (< |old(~p_dw_st~0)| 2) (and .cse6 .cse7 .cse8 .cse2 .cse9))) (or (= 1 |old(~c_dr_pc~0)|) .cse4 .cse5 (= ~p_dw_pc~0 2) .cse11 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse12 (not (= 0 |old(~c_num_read~0)|)) (and .cse8 .cse10 (= ~c_num_read~0 0) .cse9 .cse3) (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0))))) [2018-11-10 11:51:16,595 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 (= ~q_free~0 0) (<= .cse6 ~p_num_write~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse6) (not (= ~c_dr_st~0 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-10 11:51:16,595 INFO L425 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2018-11-10 11:51:16,595 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2018-11-10 11:51:16,596 INFO L421 ceAbstractionStarter]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 1))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse5 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (= ~c_dr_pc~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse9 (not .cse4)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse10 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse4 .cse5 (not (= 0 ~p_num_write~0)) (and .cse6 (= ~q_free~0 1) (= ~p_dw_st~0 0) (= ~c_num_read~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse7) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse9 (not (= 1 ~p_num_write~0)) .cse5 .cse6 .cse10) (let ((.cse11 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse11) .cse1 .cse2 .cse8 (< .cse11 ~p_num_write~0) .cse3 .cse9 (let ((.cse12 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (<= .cse12 ~p_num_write~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse12) .cse7)) .cse10))))) [2018-11-10 11:51:16,596 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2018-11-10 11:51:16,596 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 185) no Hoare annotation was computed. [2018-11-10 11:51:16,596 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-10 11:51:16,596 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2018-11-10 11:51:16,596 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2018-11-10 11:51:16,596 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 (not (= ~c_dr_pc~0 1)) .cse5 (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-10 11:51:16,596 INFO L425 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-11-10 11:51:16,597 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2018-11-10 11:51:16,597 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2018-11-10 11:51:16,597 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)) (= |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)) (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))) [2018-11-10 11:51:16,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:51:16 BoogieIcfgContainer [2018-11-10 11:51:16,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:51:16,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:51:16,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:51:16,646 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:51:16,646 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:58" (3/4) ... [2018-11-10 11:51:16,650 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:51:16,655 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-10 11:51:16,655 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-10 11:51:16,655 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:51:16,655 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-10 11:51:16,655 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-10 11:51:16,655 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2018-11-10 11:51:16,655 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:51:16,656 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-10 11:51:16,656 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-10 11:51:16,656 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-10 11:51:16,656 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-10 11:51:16,656 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-10 11:51:16,656 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-10 11:51:16,656 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-10 11:51:16,665 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-10 11:51:16,665 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 11:51:16,690 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((!(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)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || 1 == \old(c_dr_pc)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((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)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || (((((!(c_dr_pc == 1) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((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(p_dw_st) == 0) [2018-11-10 11:51:16,690 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\old(p_num_write) < \old(c_num_read) || ((((!(c_dr_pc == 1) && !(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)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 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) || (((((!(c_dr_pc == 1) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1))) && ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(p_num_write) < \old(c_num_read)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || \old(c_num_read) < \old(p_num_write))) && (((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(p_dw_st) < 2)) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((!(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)) || (((((!(c_dr_pc == 1) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\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 == \old(c_dr_pc)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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)) || ((((((((((q_free == 1 && p_num_write == \old(p_num_write)) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_pc == 2)) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && p_dw_i == 1) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1))) && (((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 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))) || !(2 == \old(c_dr_st))) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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)) || ((((((((((q_free == 1 && p_num_write == \old(p_num_write)) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_pc == 2)) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && p_dw_i == 1) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\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)) || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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_dw_st) < 2) [2018-11-10 11:51:16,691 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\old(p_num_write) < \old(c_num_read) || ((((!(c_dr_pc == 1) && !(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)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 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) || (((((!(c_dr_pc == 1) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1))) && ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(p_num_write) < \old(c_num_read)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || \old(c_num_read) < \old(p_num_write))) && (((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(p_dw_st) < 2)) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((!(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)) || (((((!(c_dr_pc == 1) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\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 == \old(c_dr_pc)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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)) || ((((((((((q_free == 1 && p_num_write == \old(p_num_write)) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_pc == 2)) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && p_dw_i == 1) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1))) && (((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 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))) || !(2 == \old(c_dr_st))) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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)) || ((((((((((q_free == 1 && p_num_write == \old(p_num_write)) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_pc == 2)) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && p_dw_i == 1) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\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)) || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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_dw_st) < 2) [2018-11-10 11:51:16,691 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)) || !(\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) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || (((((((q_free == 1 && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || ((((((q_free == 1 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write)))) && (((\old(p_dw_st) == 0 || (((((!(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)) || (((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)) || (((\old(p_num_write) < c_num_read || !(2 == \old(c_dr_st))) || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((!(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)) && ((((((((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)) [2018-11-10 11:51:16,691 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(p_dw_st) == 0 || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1)) || ((((!(c_dr_pc == 1) && 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 || !(2 == \old(c_dr_st))) || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || \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))) || ((((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) == 0) || 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(p_dw_pc) == 2) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2)) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((1 == c_dr_pc || ((((!(c_dr_pc == 1) && 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)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((!(c_dr_pc == 1) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) [2018-11-10 11:51:16,691 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || ((((!(p_dw_st == 0) && !(p_dw_st == 2)) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || (((((!(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)) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || (((((!(p_dw_st == 0) && !(p_dw_st == 2)) && 2 == c_dr_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && (((\old(p_dw_st) == 0 || (((((!(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 || !(2 == \old(c_dr_st))) || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write)) || (!(p_dw_st == 0) && p_num_write == \old(p_num_write) && ((!(p_dw_st == 2) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((!(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)) && ((((((((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)) [2018-11-10 11:51:16,691 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((p_num_write < \old(c_num_read) + 1 || (((((q_free == 0 && !(c_dr_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_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((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(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || \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)) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || ((((q_free == 1 && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) [2018-11-10 11:51:16,691 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((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)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st)) || \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)) || ((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && c_num_read == 0) && c_last_read == p_last_write)) || !(\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-10 11:51:16,692 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)) || ((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) || \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-10 11:51:16,731 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_88304614-93dd-4ee6-bd73-c03f3d4ca0a6/bin-2019/uautomizer/witness.graphml [2018-11-10 11:51:16,731 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:51:16,732 INFO L168 Benchmark]: Toolchain (without parser) took 19014.26 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 597.2 MB). Free memory was 953.9 MB in the beginning and 946.2 MB in the end (delta: 7.7 MB). Peak memory consumption was 604.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:16,732 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:51:16,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.93 ms. Allocated memory is still 1.0 GB. Free memory was 953.9 MB in the beginning and 940.5 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:16,733 INFO L168 Benchmark]: Boogie Preprocessor took 27.47 ms. Allocated memory is still 1.0 GB. Free memory was 940.5 MB in the beginning and 937.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:16,733 INFO L168 Benchmark]: RCFGBuilder took 342.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:16,733 INFO L168 Benchmark]: TraceAbstraction took 18364.25 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 460.8 MB). Free memory was 1.1 GB in the beginning and 946.2 MB in the end (delta: 162.9 MB). Peak memory consumption was 729.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:16,734 INFO L168 Benchmark]: Witness Printer took 85.59 ms. Allocated memory is still 1.6 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:51:16,735 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.93 ms. Allocated memory is still 1.0 GB. Free memory was 953.9 MB in the beginning and 940.5 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.47 ms. Allocated memory is still 1.0 GB. Free memory was 940.5 MB in the beginning and 937.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 342.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18364.25 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 460.8 MB). Free memory was 1.1 GB in the beginning and 946.2 MB in the end (delta: 162.9 MB). Peak memory consumption was 729.9 MB. Max. memory is 11.5 GB. * Witness Printer took 85.59 ms. Allocated memory is still 1.6 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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) || ((((!(c_dr_pc == 1) && !(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)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 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) || (((((!(c_dr_pc == 1) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1))) && ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(p_num_write) < \old(c_num_read)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || \old(c_num_read) < \old(p_num_write))) && (((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(p_dw_st) < 2)) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((!(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)) || (((((!(c_dr_pc == 1) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\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 == \old(c_dr_pc)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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)) || ((((((((((q_free == 1 && p_num_write == \old(p_num_write)) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_pc == 2)) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && p_dw_i == 1) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1))) && (((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 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))) || !(2 == \old(c_dr_st))) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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)) || ((((((((((q_free == 1 && p_num_write == \old(p_num_write)) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_pc == 2)) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && p_dw_i == 1) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\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)) || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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_dw_st) < 2) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\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) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || (((((((q_free == 1 && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || ((((((q_free == 1 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write)))) && (((\old(p_dw_st) == 0 || (((((!(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)) || (((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)) || (((\old(p_num_write) < c_num_read || !(2 == \old(c_dr_st))) || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((!(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)) && ((((((((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)) - 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)) || ((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) || \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_free == 0 && !(c_dr_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_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((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(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || \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)) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || ((((q_free == 1 && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) - 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) || p_dw_st == 2) || p_dw_pc == 1) || 0 == __retres1) && ((((((((((p_dw_st == 0 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) || 0 == __retres1)) && ((((((((((p_dw_st == 0 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || !(2 == c_dr_st)) || 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: ((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((!(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)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || 1 == \old(c_dr_pc)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((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)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || (((((!(c_dr_pc == 1) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((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(p_dw_st) == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((\old(p_num_write) < \old(c_num_read) || ((((!(c_dr_pc == 1) && !(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)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 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) || (((((!(c_dr_pc == 1) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1))) && ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(p_num_write) < \old(c_num_read)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || \old(c_num_read) < \old(p_num_write))) && (((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(p_dw_st) < 2)) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((!(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)) || (((((!(c_dr_pc == 1) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\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 == \old(c_dr_pc)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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)) || ((((((((((q_free == 1 && p_num_write == \old(p_num_write)) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_pc == 2)) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && p_dw_i == 1) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1))) && (((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 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))) || !(2 == \old(c_dr_st))) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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)) || ((((((((((q_free == 1 && p_num_write == \old(p_num_write)) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_pc == 2)) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && p_dw_i == 1) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\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)) || !(\old(q_free) == 0)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((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_dw_st) < 2) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((\old(p_dw_st) == 0 || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1)) || ((((!(c_dr_pc == 1) && 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 || !(2 == \old(c_dr_st))) || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || \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))) || ((((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) == 0) || 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(p_dw_pc) == 2) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2)) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((1 == c_dr_pc || ((((!(c_dr_pc == 1) && 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)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((!(c_dr_pc == 1) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((((0 == __retres1 || p_dw_st == 0) || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) && (((((((((1 == c_dr_pc || p_num_write < c_num_read) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(p_dw_pc == 1)) || !(q_free == 1)) || c_num_read < p_num_write) || 0 == __retres1) || !(c_last_read == p_last_write))) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || 0 == __retres1) || p_dw_st == 2) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((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)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st)) || \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)) || ((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && c_num_read == 0) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || ((((!(p_dw_st == 0) && !(p_dw_st == 2)) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || (((((!(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)) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || (((((!(p_dw_st == 0) && !(p_dw_st == 2)) && 2 == c_dr_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && (((\old(p_dw_st) == 0 || (((((!(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 || !(2 == \old(c_dr_st))) || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write)) || (!(p_dw_st == 0) && p_num_write == \old(p_num_write) && ((!(p_dw_st == 2) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((!(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)) && ((((((((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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 111 locations, 1 error locations. SAFE Result, 18.2s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 12.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2182 SDtfs, 3026 SDslu, 3174 SDs, 0 SdLazy, 2777 SolverSat, 842 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 463 GetRequests, 384 SyntacticMatches, 12 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2925occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 558 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3909 PreInvPairs, 6476 NumberOfFragments, 9417 HoareAnnotationTreeSize, 3909 FomulaSimplifications, 62736 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 45 FomulaSimplificationsInter, 31446 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1356 ConstructedInterpolants, 0 QuantifiedInterpolants, 268962 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1931 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 288/335 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...