./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa63abe8d244d72d8b78f82e911235dbe511cfc8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:41:45,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:41:45,816 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:41:45,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:41:45,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:41:45,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:41:45,825 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:41:45,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:41:45,827 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:41:45,827 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:41:45,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:41:45,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:41:45,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:41:45,830 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:41:45,831 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:41:45,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:41:45,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:41:45,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:41:45,835 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:41:45,836 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:41:45,837 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:41:45,838 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:41:45,839 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:41:45,840 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:41:45,840 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:41:45,840 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:41:45,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:41:45,841 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:41:45,842 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:41:45,843 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:41:45,843 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:41:45,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:41:45,844 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:41:45,844 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:41:45,844 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:41:45,845 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:41:45,845 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 10:41:45,854 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:41:45,854 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:41:45,855 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:41:45,855 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 10:41:45,855 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 10:41:45,855 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 10:41:45,855 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 10:41:45,855 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 10:41:45,856 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 10:41:45,856 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 10:41:45,856 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 10:41:45,856 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 10:41:45,856 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 10:41:45,856 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:41:45,856 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:41:45,857 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:41:45,857 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:41:45,857 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:41:45,857 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:41:45,857 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:41:45,857 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:41:45,857 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:41:45,858 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:41:45,859 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:41:45,859 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:41:45,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:41:45,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:41:45,859 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:41:45,859 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:41:45,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:41:45,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:41:45,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:41:45,860 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:41:45,860 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 10:41:45,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:41:45,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:41:45,860 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 10:41:45,860 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2018-11-18 10:41:45,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:41:45,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:41:45,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:41:45,895 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:41:45,895 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:41:45,896 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-18 10:41:45,931 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/data/650c60afe/6fe8397007334a2fb1c9363e66947aac/FLAGee25e5129 [2018-11-18 10:41:46,346 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:41:46,346 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-18 10:41:46,351 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/data/650c60afe/6fe8397007334a2fb1c9363e66947aac/FLAGee25e5129 [2018-11-18 10:41:46,360 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/data/650c60afe/6fe8397007334a2fb1c9363e66947aac [2018-11-18 10:41:46,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:41:46,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:41:46,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:41:46,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:41:46,367 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:41:46,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7217af06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46, skipping insertion in model container [2018-11-18 10:41:46,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:41:46,402 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:41:46,530 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:41:46,532 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:41:46,552 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:41:46,563 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:41:46,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46 WrapperNode [2018-11-18 10:41:46,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:41:46,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:41:46,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:41:46,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:41:46,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:41:46,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:41:46,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:41:46,577 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:41:46,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (1/1) ... [2018-11-18 10:41:46,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:41:46,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:41:46,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:41:46,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:41:46,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:41:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 10:41:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 10:41:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 10:41:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 10:41:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:41:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:41:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-18 10:41:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-18 10:41:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 10:41:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 10:41:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2018-11-18 10:41:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2018-11-18 10:41:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:41:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:41:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 10:41:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 10:41:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 10:41:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 10:41:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-18 10:41:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-18 10:41:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 10:41:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 10:41:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:41:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:41:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-18 10:41:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-18 10:41:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-18 10:41:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-18 10:41:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 10:41:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 10:41:46,918 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:41:46,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:41:46 BoogieIcfgContainer [2018-11-18 10:41:46,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:41:46,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:41:46,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:41:46,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:41:46,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:41:46" (1/3) ... [2018-11-18 10:41:46,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72de8948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:41:46, skipping insertion in model container [2018-11-18 10:41:46,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:41:46" (2/3) ... [2018-11-18 10:41:46,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72de8948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:41:46, skipping insertion in model container [2018-11-18 10:41:46,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:41:46" (3/3) ... [2018-11-18 10:41:46,924 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-18 10:41:46,930 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:41:46,935 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:41:46,943 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:41:46,962 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:41:46,962 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:41:46,962 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:41:46,962 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:41:46,962 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:41:46,962 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:41:46,962 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:41:46,963 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:41:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-11-18 10:41:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 10:41:46,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:46,983 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:46,985 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:46,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1985288643, now seen corresponding path program 1 times [2018-11-18 10:41:46,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:47,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:47,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:47,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:41:47,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:41:47,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:41:47,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:47,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:41:47,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:41:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:41:47,175 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-11-18 10:41:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:47,233 INFO L93 Difference]: Finished difference Result 291 states and 407 transitions. [2018-11-18 10:41:47,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:41:47,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-11-18 10:41:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:47,246 INFO L225 Difference]: With dead ends: 291 [2018-11-18 10:41:47,246 INFO L226 Difference]: Without dead ends: 183 [2018-11-18 10:41:47,249 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:41:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-18 10:41:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-11-18 10:41:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-18 10:41:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2018-11-18 10:41:47,288 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 67 [2018-11-18 10:41:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:47,289 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2018-11-18 10:41:47,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:41:47,289 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2018-11-18 10:41:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 10:41:47,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:47,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:47,291 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:47,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash -302906633, now seen corresponding path program 1 times [2018-11-18 10:41:47,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:47,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:47,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:47,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:47,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:41:47,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:41:47,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:41:47,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:47,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:41:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:41:47,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:41:47,347 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand 4 states. [2018-11-18 10:41:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:47,423 INFO L93 Difference]: Finished difference Result 338 states and 439 transitions. [2018-11-18 10:41:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:41:47,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-18 10:41:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:47,426 INFO L225 Difference]: With dead ends: 338 [2018-11-18 10:41:47,426 INFO L226 Difference]: Without dead ends: 176 [2018-11-18 10:41:47,427 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:41:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-18 10:41:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-11-18 10:41:47,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 10:41:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 226 transitions. [2018-11-18 10:41:47,444 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 226 transitions. Word has length 68 [2018-11-18 10:41:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:47,445 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 226 transitions. [2018-11-18 10:41:47,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:41:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 226 transitions. [2018-11-18 10:41:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 10:41:47,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:47,448 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:47,448 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:47,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:47,448 INFO L82 PathProgramCache]: Analyzing trace with hash -766116264, now seen corresponding path program 1 times [2018-11-18 10:41:47,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:47,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:47,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:47,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:47,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:41:47,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:41:47,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:41:47,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:47,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:41:47,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:41:47,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:41:47,556 INFO L87 Difference]: Start difference. First operand 176 states and 226 transitions. Second operand 6 states. [2018-11-18 10:41:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:48,041 INFO L93 Difference]: Finished difference Result 578 states and 837 transitions. [2018-11-18 10:41:48,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:41:48,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-18 10:41:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:48,046 INFO L225 Difference]: With dead ends: 578 [2018-11-18 10:41:48,047 INFO L226 Difference]: Without dead ends: 419 [2018-11-18 10:41:48,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:41:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-18 10:41:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 369. [2018-11-18 10:41:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-18 10:41:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 534 transitions. [2018-11-18 10:41:48,092 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 534 transitions. Word has length 75 [2018-11-18 10:41:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:48,093 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 534 transitions. [2018-11-18 10:41:48,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:41:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 534 transitions. [2018-11-18 10:41:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 10:41:48,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:48,095 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:48,096 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:48,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:48,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1894140671, now seen corresponding path program 1 times [2018-11-18 10:41:48,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:48,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:48,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:48,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:48,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:41:48,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:41:48,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:41:48,179 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:48,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:41:48,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:41:48,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:41:48,180 INFO L87 Difference]: Start difference. First operand 369 states and 534 transitions. Second operand 3 states. [2018-11-18 10:41:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:48,236 INFO L93 Difference]: Finished difference Result 922 states and 1444 transitions. [2018-11-18 10:41:48,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:41:48,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-18 10:41:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:48,240 INFO L225 Difference]: With dead ends: 922 [2018-11-18 10:41:48,240 INFO L226 Difference]: Without dead ends: 570 [2018-11-18 10:41:48,243 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:41:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-18 10:41:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 566. [2018-11-18 10:41:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-11-18 10:41:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 847 transitions. [2018-11-18 10:41:48,280 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 847 transitions. Word has length 68 [2018-11-18 10:41:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:48,281 INFO L480 AbstractCegarLoop]: Abstraction has 566 states and 847 transitions. [2018-11-18 10:41:48,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:41:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 847 transitions. [2018-11-18 10:41:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 10:41:48,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:48,283 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:48,283 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:48,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:48,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1531199253, now seen corresponding path program 1 times [2018-11-18 10:41:48,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:48,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:48,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:41:48,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:41:48,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:41:48,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:48,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:41:48,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:41:48,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:41:48,357 INFO L87 Difference]: Start difference. First operand 566 states and 847 transitions. Second operand 4 states. [2018-11-18 10:41:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:48,469 INFO L93 Difference]: Finished difference Result 1384 states and 2206 transitions. [2018-11-18 10:41:48,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:41:48,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-11-18 10:41:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:48,473 INFO L225 Difference]: With dead ends: 1384 [2018-11-18 10:41:48,473 INFO L226 Difference]: Without dead ends: 835 [2018-11-18 10:41:48,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:41:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-11-18 10:41:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2018-11-18 10:41:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-11-18 10:41:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1186 transitions. [2018-11-18 10:41:48,537 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1186 transitions. Word has length 69 [2018-11-18 10:41:48,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:48,538 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1186 transitions. [2018-11-18 10:41:48,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:41:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1186 transitions. [2018-11-18 10:41:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 10:41:48,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:48,539 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:48,540 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:48,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:48,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1417812596, now seen corresponding path program 1 times [2018-11-18 10:41:48,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:48,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:48,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:48,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:48,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:41:48,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:41:48,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:41:48,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:48,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:41:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:41:48,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:41:48,603 INFO L87 Difference]: Start difference. First operand 827 states and 1186 transitions. Second operand 6 states. [2018-11-18 10:41:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:48,646 INFO L93 Difference]: Finished difference Result 1569 states and 2368 transitions. [2018-11-18 10:41:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:41:48,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-18 10:41:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:48,652 INFO L225 Difference]: With dead ends: 1569 [2018-11-18 10:41:48,652 INFO L226 Difference]: Without dead ends: 845 [2018-11-18 10:41:48,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:41:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-11-18 10:41:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2018-11-18 10:41:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-11-18 10:41:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1201 transitions. [2018-11-18 10:41:48,689 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1201 transitions. Word has length 69 [2018-11-18 10:41:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:48,689 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1201 transitions. [2018-11-18 10:41:48,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:41:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1201 transitions. [2018-11-18 10:41:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 10:41:48,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:48,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:48,691 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:48,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:48,691 INFO L82 PathProgramCache]: Analyzing trace with hash 396744242, now seen corresponding path program 1 times [2018-11-18 10:41:48,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:48,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:48,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:48,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:48,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:41:48,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:41:48,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:41:48,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:48,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:41:48,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:41:48,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:41:48,741 INFO L87 Difference]: Start difference. First operand 845 states and 1201 transitions. Second operand 6 states. [2018-11-18 10:41:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:48,787 INFO L93 Difference]: Finished difference Result 1619 states and 2439 transitions. [2018-11-18 10:41:48,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:41:48,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-18 10:41:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:48,791 INFO L225 Difference]: With dead ends: 1619 [2018-11-18 10:41:48,791 INFO L226 Difference]: Without dead ends: 877 [2018-11-18 10:41:48,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:41:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-11-18 10:41:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 867. [2018-11-18 10:41:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2018-11-18 10:41:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1219 transitions. [2018-11-18 10:41:48,826 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1219 transitions. Word has length 69 [2018-11-18 10:41:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:48,826 INFO L480 AbstractCegarLoop]: Abstraction has 867 states and 1219 transitions. [2018-11-18 10:41:48,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:41:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1219 transitions. [2018-11-18 10:41:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 10:41:48,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:48,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:48,828 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:48,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:48,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2123215692, now seen corresponding path program 1 times [2018-11-18 10:41:48,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:48,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:48,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:48,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:48,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:41:48,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:41:48,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:41:48,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:48,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:41:48,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:41:48,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:41:48,889 INFO L87 Difference]: Start difference. First operand 867 states and 1219 transitions. Second operand 4 states. [2018-11-18 10:41:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:48,987 INFO L93 Difference]: Finished difference Result 1247 states and 1753 transitions. [2018-11-18 10:41:48,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:41:48,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-11-18 10:41:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:48,992 INFO L225 Difference]: With dead ends: 1247 [2018-11-18 10:41:48,992 INFO L226 Difference]: Without dead ends: 1244 [2018-11-18 10:41:48,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:41:48,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2018-11-18 10:41:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1143. [2018-11-18 10:41:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2018-11-18 10:41:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1619 transitions. [2018-11-18 10:41:49,034 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1619 transitions. Word has length 69 [2018-11-18 10:41:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:49,034 INFO L480 AbstractCegarLoop]: Abstraction has 1143 states and 1619 transitions. [2018-11-18 10:41:49,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:41:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1619 transitions. [2018-11-18 10:41:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 10:41:49,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:49,036 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:49,036 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:49,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1395481241, now seen corresponding path program 1 times [2018-11-18 10:41:49,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:49,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:49,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:41:49,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:41:49,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:41:49,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:49,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:41:49,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:41:49,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:41:49,091 INFO L87 Difference]: Start difference. First operand 1143 states and 1619 transitions. Second operand 3 states. [2018-11-18 10:41:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:49,134 INFO L93 Difference]: Finished difference Result 1980 states and 2895 transitions. [2018-11-18 10:41:49,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:41:49,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-18 10:41:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:49,138 INFO L225 Difference]: With dead ends: 1980 [2018-11-18 10:41:49,138 INFO L226 Difference]: Without dead ends: 943 [2018-11-18 10:41:49,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:41:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-11-18 10:41:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 895. [2018-11-18 10:41:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-11-18 10:41:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1239 transitions. [2018-11-18 10:41:49,180 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1239 transitions. Word has length 70 [2018-11-18 10:41:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:49,180 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1239 transitions. [2018-11-18 10:41:49,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:41:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1239 transitions. [2018-11-18 10:41:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 10:41:49,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:49,182 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:49,182 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:49,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1660765838, now seen corresponding path program 1 times [2018-11-18 10:41:49,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:49,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:49,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:49,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:49,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:41:49,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:41:49,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:41:49,245 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 92 with the following transitions: [2018-11-18 10:41:49,246 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [67], [70], [72], [77], [80], [85], [87], [88], [89], [101], [105], [111], [114], [117], [123], [129], [136], [139], [151], [161], [163], [165], [166], [167], [172], [178], [180], [196], [206], [208], [210], [211], [212], [215], [217], [220], [226], [232], [236], [238], [242], [244], [247], [252], [262], [263], [264], [265], [266], [267], [271], [272], [273], [274], [277], [278], [281], [282], [283], [284], [285], [289], [290], [291], [293], [294], [295] [2018-11-18 10:41:49,273 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:41:49,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:41:49,440 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:41:49,441 INFO L272 AbstractInterpreter]: Visited 45 different actions 58 times. Merged at 8 different actions 8 times. Never widened. Performed 530 root evaluator evaluations with a maximum evaluation depth of 3. Performed 530 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-18 10:41:49,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:49,454 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:41:49,613 INFO L227 lantSequenceWeakener]: Weakened 59 states. On average, predicates are now at 73.54% of their original sizes. [2018-11-18 10:41:49,614 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:41:49,964 INFO L415 sIntCurrentIteration]: We unified 90 AI predicates to 90 [2018-11-18 10:41:49,964 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:41:49,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:41:49,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-18 10:41:49,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:49,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 10:41:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 10:41:49,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-11-18 10:41:49,966 INFO L87 Difference]: Start difference. First operand 895 states and 1239 transitions. Second operand 21 states. [2018-11-18 10:41:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:51,426 INFO L93 Difference]: Finished difference Result 1658 states and 2315 transitions. [2018-11-18 10:41:51,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 10:41:51,426 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 91 [2018-11-18 10:41:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:51,429 INFO L225 Difference]: With dead ends: 1658 [2018-11-18 10:41:51,429 INFO L226 Difference]: Without dead ends: 778 [2018-11-18 10:41:51,432 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 105 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=975, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 10:41:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-11-18 10:41:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 768. [2018-11-18 10:41:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-11-18 10:41:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1057 transitions. [2018-11-18 10:41:51,469 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1057 transitions. Word has length 91 [2018-11-18 10:41:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:51,470 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 1057 transitions. [2018-11-18 10:41:51,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 10:41:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1057 transitions. [2018-11-18 10:41:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 10:41:51,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:51,472 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:51,472 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:51,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:51,472 INFO L82 PathProgramCache]: Analyzing trace with hash 922515390, now seen corresponding path program 1 times [2018-11-18 10:41:51,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:51,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:51,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:51,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:51,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 10:41:51,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:41:51,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:41:51,573 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2018-11-18 10:41:51,573 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [45], [51], [55], [58], [60], [62], [66], [67], [70], [72], [75], [77], [80], [85], [87], [88], [89], [101], [105], [111], [114], [117], [123], [126], [136], [139], [151], [161], [163], [165], [166], [167], [172], [178], [180], [196], [199], [202], [206], [208], [210], [211], [212], [215], [226], [232], [240], [242], [244], [247], [252], [263], [264], [265], [266], [267], [269], [270], [271], [272], [273], [274], [277], [278], [279], [280], [281], [283], [284], [285], [289], [290], [291], [293], [294], [295] [2018-11-18 10:41:51,576 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:41:51,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:41:51,618 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:41:51,618 INFO L272 AbstractInterpreter]: Visited 83 different actions 108 times. Merged at 3 different actions 3 times. Never widened. Performed 672 root evaluator evaluations with a maximum evaluation depth of 3. Performed 672 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-18 10:41:51,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:51,620 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:41:51,708 INFO L227 lantSequenceWeakener]: Weakened 100 states. On average, predicates are now at 81.77% of their original sizes. [2018-11-18 10:41:51,708 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:41:52,038 INFO L415 sIntCurrentIteration]: We unified 103 AI predicates to 103 [2018-11-18 10:41:52,039 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:41:52,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:41:52,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [6] total 42 [2018-11-18 10:41:52,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:52,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 10:41:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 10:41:52,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 10:41:52,040 INFO L87 Difference]: Start difference. First operand 768 states and 1057 transitions. Second operand 38 states. [2018-11-18 10:41:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:55,176 INFO L93 Difference]: Finished difference Result 1674 states and 2369 transitions. [2018-11-18 10:41:55,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 10:41:55,176 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 104 [2018-11-18 10:41:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:55,179 INFO L225 Difference]: With dead ends: 1674 [2018-11-18 10:41:55,179 INFO L226 Difference]: Without dead ends: 1006 [2018-11-18 10:41:55,181 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 127 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=3432, Unknown=0, NotChecked=0, Total=3782 [2018-11-18 10:41:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-11-18 10:41:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 969. [2018-11-18 10:41:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-11-18 10:41:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1323 transitions. [2018-11-18 10:41:55,214 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1323 transitions. Word has length 104 [2018-11-18 10:41:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:55,214 INFO L480 AbstractCegarLoop]: Abstraction has 969 states and 1323 transitions. [2018-11-18 10:41:55,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 10:41:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1323 transitions. [2018-11-18 10:41:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 10:41:55,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:55,216 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:55,216 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:55,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1838253676, now seen corresponding path program 1 times [2018-11-18 10:41:55,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:55,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:55,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 10:41:55,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:41:55,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:41:55,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:55,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:41:55,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:41:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:41:55,267 INFO L87 Difference]: Start difference. First operand 969 states and 1323 transitions. Second operand 4 states. [2018-11-18 10:41:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:41:55,347 INFO L93 Difference]: Finished difference Result 1656 states and 2406 transitions. [2018-11-18 10:41:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:41:55,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-11-18 10:41:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:41:55,350 INFO L225 Difference]: With dead ends: 1656 [2018-11-18 10:41:55,350 INFO L226 Difference]: Without dead ends: 936 [2018-11-18 10:41:55,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:41:55,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-11-18 10:41:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 811. [2018-11-18 10:41:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-11-18 10:41:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1019 transitions. [2018-11-18 10:41:55,383 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1019 transitions. Word has length 125 [2018-11-18 10:41:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:41:55,383 INFO L480 AbstractCegarLoop]: Abstraction has 811 states and 1019 transitions. [2018-11-18 10:41:55,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:41:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1019 transitions. [2018-11-18 10:41:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 10:41:55,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:41:55,385 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:41:55,385 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:41:55,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash -24545929, now seen corresponding path program 1 times [2018-11-18 10:41:55,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:41:55,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:55,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:41:55,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:41:55,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:41:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:41:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 10:41:55,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:41:55,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:41:55,455 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-11-18 10:41:55,455 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [45], [51], [55], [58], [60], [62], [66], [67], [70], [72], [75], [77], [80], [83], [87], [88], [89], [101], [105], [111], [114], [117], [123], [126], [129], [136], [139], [151], [154], [157], [165], [166], [167], [172], [178], [180], [196], [199], [202], [206], [208], [210], [211], [212], [215], [217], [220], [226], [232], [236], [238], [242], [244], [247], [252], [262], [263], [264], [265], [266], [267], [269], [270], [271], [272], [273], [274], [277], [278], [279], [280], [281], [282], [283], [284], [285], [289], [290], [291], [293], [294], [295] [2018-11-18 10:41:55,457 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:41:55,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:41:55,558 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:41:55,558 INFO L272 AbstractInterpreter]: Visited 85 different actions 270 times. Merged at 25 different actions 39 times. Never widened. Performed 3043 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3043 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 36 variables. [2018-11-18 10:41:55,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:41:55,566 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:41:55,641 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 81.86% of their original sizes. [2018-11-18 10:41:55,642 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:41:56,147 INFO L415 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2018-11-18 10:41:56,148 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:41:56,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:41:56,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [8] total 52 [2018-11-18 10:41:56,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:41:56,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-18 10:41:56,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-18 10:41:56,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 10:41:56,149 INFO L87 Difference]: Start difference. First operand 811 states and 1019 transitions. Second operand 46 states. [2018-11-18 10:42:05,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:42:05,757 INFO L93 Difference]: Finished difference Result 1672 states and 2241 transitions. [2018-11-18 10:42:05,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-11-18 10:42:05,757 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 125 [2018-11-18 10:42:05,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:42:05,763 INFO L225 Difference]: With dead ends: 1672 [2018-11-18 10:42:05,764 INFO L226 Difference]: Without dead ends: 1323 [2018-11-18 10:42:05,769 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5876 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1264, Invalid=16826, Unknown=0, NotChecked=0, Total=18090 [2018-11-18 10:42:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-11-18 10:42:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1064. [2018-11-18 10:42:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-11-18 10:42:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1347 transitions. [2018-11-18 10:42:05,848 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1347 transitions. Word has length 125 [2018-11-18 10:42:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:42:05,849 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1347 transitions. [2018-11-18 10:42:05,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-18 10:42:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1347 transitions. [2018-11-18 10:42:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 10:42:05,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:42:05,851 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:42:05,851 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:42:05,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:05,851 INFO L82 PathProgramCache]: Analyzing trace with hash 54597420, now seen corresponding path program 1 times [2018-11-18 10:42:05,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:42:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:05,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:05,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:42:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 10:42:05,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:05,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:42:05,962 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2018-11-18 10:42:05,962 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [45], [51], [55], [58], [60], [62], [66], [67], [70], [72], [75], [77], [80], [83], [85], [87], [88], [89], [101], [105], [111], [114], [117], [123], [126], [129], [136], [139], [151], [154], [157], [159], [163], [165], [166], [167], [172], [178], [180], [196], [199], [202], [206], [208], [210], [211], [212], [215], [217], [220], [226], [232], [236], [238], [242], [244], [247], [252], [262], [263], [264], [265], [266], [267], [269], [270], [271], [272], [273], [274], [277], [278], [279], [280], [281], [282], [283], [284], [285], [289], [290], [291], [293], [294], [295] [2018-11-18 10:42:05,964 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:42:05,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:42:06,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:42:06,121 INFO L272 AbstractInterpreter]: Visited 94 different actions 323 times. Merged at 33 different actions 55 times. Never widened. Performed 2958 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2958 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 36 variables. [2018-11-18 10:42:06,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:06,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:42:06,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:06,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:42:06,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:06,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:42:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:06,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:42:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 10:42:06,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:42:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 10:42:06,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 10:42:06,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 17 [2018-11-18 10:42:06,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 10:42:06,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:42:06,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:42:06,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-18 10:42:06,510 INFO L87 Difference]: Start difference. First operand 1064 states and 1347 transitions. Second operand 14 states. [2018-11-18 10:42:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:42:07,780 INFO L93 Difference]: Finished difference Result 2142 states and 3155 transitions. [2018-11-18 10:42:07,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 10:42:07,781 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 126 [2018-11-18 10:42:07,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:42:07,790 INFO L225 Difference]: With dead ends: 2142 [2018-11-18 10:42:07,790 INFO L226 Difference]: Without dead ends: 2139 [2018-11-18 10:42:07,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 10:42:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-11-18 10:42:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2071. [2018-11-18 10:42:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2018-11-18 10:42:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3037 transitions. [2018-11-18 10:42:07,951 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3037 transitions. Word has length 126 [2018-11-18 10:42:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:42:07,951 INFO L480 AbstractCegarLoop]: Abstraction has 2071 states and 3037 transitions. [2018-11-18 10:42:07,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:42:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3037 transitions. [2018-11-18 10:42:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 10:42:07,954 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:42:07,955 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-18 10:42:07,955 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:42:07,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:07,955 INFO L82 PathProgramCache]: Analyzing trace with hash -67588932, now seen corresponding path program 1 times [2018-11-18 10:42:07,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:42:07,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:07,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:07,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:07,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:42:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:08,053 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-18 10:42:08,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:08,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:42:08,054 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2018-11-18 10:42:08,054 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [36], [39], [45], [51], [55], [58], [60], [62], [66], [67], [70], [72], [75], [77], [80], [85], [87], [88], [89], [101], [105], [111], [114], [117], [123], [126], [136], [139], [142], [151], [161], [163], [165], [166], [167], [172], [178], [180], [196], [199], [202], [206], [208], [210], [211], [212], [215], [226], [232], [240], [242], [244], [247], [252], [263], [264], [265], [266], [267], [269], [270], [271], [272], [273], [274], [277], [278], [279], [280], [281], [283], [284], [285], [289], [290], [291], [293], [294], [295] [2018-11-18 10:42:08,056 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:42:08,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:42:08,089 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:42:08,090 INFO L272 AbstractInterpreter]: Visited 85 different actions 118 times. Merged at 6 different actions 6 times. Never widened. Performed 802 root evaluator evaluations with a maximum evaluation depth of 3. Performed 802 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 36 variables. [2018-11-18 10:42:08,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:08,103 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:42:08,194 INFO L227 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 79.3% of their original sizes. [2018-11-18 10:42:08,195 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:42:08,849 INFO L415 sIntCurrentIteration]: We unified 149 AI predicates to 149 [2018-11-18 10:42:08,849 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:42:08,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:42:08,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [8] total 62 [2018-11-18 10:42:08,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:42:08,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-18 10:42:08,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-18 10:42:08,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2818, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 10:42:08,850 INFO L87 Difference]: Start difference. First operand 2071 states and 3037 transitions. Second operand 56 states. [2018-11-18 10:42:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:42:11,798 INFO L93 Difference]: Finished difference Result 3303 states and 4822 transitions. [2018-11-18 10:42:11,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 10:42:11,798 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 150 [2018-11-18 10:42:11,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:42:11,803 INFO L225 Difference]: With dead ends: 3303 [2018-11-18 10:42:11,803 INFO L226 Difference]: Without dead ends: 1730 [2018-11-18 10:42:11,808 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=547, Invalid=5933, Unknown=0, NotChecked=0, Total=6480 [2018-11-18 10:42:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2018-11-18 10:42:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1712. [2018-11-18 10:42:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2018-11-18 10:42:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2452 transitions. [2018-11-18 10:42:11,881 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2452 transitions. Word has length 150 [2018-11-18 10:42:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:42:11,882 INFO L480 AbstractCegarLoop]: Abstraction has 1712 states and 2452 transitions. [2018-11-18 10:42:11,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-18 10:42:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2452 transitions. [2018-11-18 10:42:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 10:42:11,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:42:11,884 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:42:11,884 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:42:11,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash -848319191, now seen corresponding path program 1 times [2018-11-18 10:42:11,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:42:11,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:11,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:11,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:11,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:42:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-18 10:42:11,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:11,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:42:11,955 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-11-18 10:42:11,955 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [45], [51], [55], [58], [60], [62], [66], [67], [70], [72], [75], [77], [80], [83], [85], [87], [88], [89], [101], [105], [111], [114], [117], [123], [126], [129], [136], [139], [151], [154], [157], [161], [163], [165], [166], [167], [172], [178], [180], [196], [199], [202], [206], [208], [210], [211], [212], [215], [217], [220], [226], [232], [236], [238], [240], [242], [244], [247], [250], [252], [262], [263], [264], [265], [266], [267], [269], [270], [271], [272], [273], [274], [277], [278], [279], [280], [281], [282], [283], [284], [285], [289], [290], [291], [293], [294], [295] [2018-11-18 10:42:11,957 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:42:11,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:42:12,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:42:12,187 INFO L272 AbstractInterpreter]: Visited 96 different actions 994 times. Merged at 46 different actions 300 times. Never widened. Performed 8216 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 48 fixpoints after 12 different actions. Largest state had 36 variables. [2018-11-18 10:42:12,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:12,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:42:12,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:12,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:42:12,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:12,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:42:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:12,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:42:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 10:42:12,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:42:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-18 10:42:12,351 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:42:12,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [7] total 9 [2018-11-18 10:42:12,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:42:12,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:42:12,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:42:12,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:42:12,352 INFO L87 Difference]: Start difference. First operand 1712 states and 2452 transitions. Second operand 3 states. [2018-11-18 10:42:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:42:12,412 INFO L93 Difference]: Finished difference Result 2524 states and 3911 transitions. [2018-11-18 10:42:12,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:42:12,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-11-18 10:42:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:42:12,419 INFO L225 Difference]: With dead ends: 2524 [2018-11-18 10:42:12,419 INFO L226 Difference]: Without dead ends: 1688 [2018-11-18 10:42:12,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 304 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:42:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-11-18 10:42:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1688. [2018-11-18 10:42:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2018-11-18 10:42:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2416 transitions. [2018-11-18 10:42:12,550 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2416 transitions. Word has length 154 [2018-11-18 10:42:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:42:12,551 INFO L480 AbstractCegarLoop]: Abstraction has 1688 states and 2416 transitions. [2018-11-18 10:42:12,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:42:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2416 transitions. [2018-11-18 10:42:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 10:42:12,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:42:12,553 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:42:12,554 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:42:12,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 287430074, now seen corresponding path program 1 times [2018-11-18 10:42:12,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:42:12,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:12,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:12,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:42:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 10:42:12,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:12,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:42:12,672 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-11-18 10:42:12,672 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [45], [51], [55], [58], [60], [62], [66], [67], [70], [72], [75], [77], [80], [85], [87], [88], [89], [101], [105], [111], [114], [117], [123], [126], [129], [136], [139], [151], [154], [159], [161], [163], [165], [166], [167], [172], [178], [180], [196], [199], [202], [206], [208], [210], [211], [212], [215], [217], [220], [226], [232], [236], [238], [240], [242], [244], [247], [250], [252], [262], [263], [264], [265], [266], [267], [269], [270], [271], [272], [273], [274], [277], [278], [279], [280], [281], [282], [283], [284], [285], [289], [290], [291], [293], [294], [295] [2018-11-18 10:42:12,674 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:42:12,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:42:12,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:42:12,860 INFO L272 AbstractInterpreter]: Visited 95 different actions 601 times. Merged at 44 different actions 142 times. Never widened. Performed 5788 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5788 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 26 fixpoints after 11 different actions. Largest state had 36 variables. [2018-11-18 10:42:12,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:12,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:42:12,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:12,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:42:12,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:12,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:42:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:12,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:42:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 10:42:12,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:42:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 10:42:12,999 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:42:12,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-11-18 10:42:12,999 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:42:12,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:42:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:42:13,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:42:13,000 INFO L87 Difference]: Start difference. First operand 1688 states and 2416 transitions. Second operand 3 states. [2018-11-18 10:42:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:42:13,075 INFO L93 Difference]: Finished difference Result 2899 states and 4652 transitions. [2018-11-18 10:42:13,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:42:13,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2018-11-18 10:42:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:42:13,081 INFO L225 Difference]: With dead ends: 2899 [2018-11-18 10:42:13,081 INFO L226 Difference]: Without dead ends: 1805 [2018-11-18 10:42:13,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:42:13,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2018-11-18 10:42:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2018-11-18 10:42:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1805 states. [2018-11-18 10:42:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2643 transitions. [2018-11-18 10:42:13,166 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2643 transitions. Word has length 155 [2018-11-18 10:42:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:42:13,166 INFO L480 AbstractCegarLoop]: Abstraction has 1805 states and 2643 transitions. [2018-11-18 10:42:13,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:42:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2643 transitions. [2018-11-18 10:42:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 10:42:13,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:42:13,169 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:42:13,170 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:42:13,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1841403770, now seen corresponding path program 1 times [2018-11-18 10:42:13,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:42:13,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:13,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:13,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:13,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:42:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 40 proven. 27 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 10:42:13,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:13,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:42:13,247 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-11-18 10:42:13,248 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [36], [39], [45], [51], [55], [58], [60], [62], [66], [67], [70], [72], [75], [77], [80], [83], [85], [87], [88], [89], [90], [92], [97], [99], [100], [101], [105], [111], [114], [117], [119], [123], [126], [129], [136], [139], [142], [150], [151], [154], [157], [159], [163], [165], [166], [167], [172], [178], [180], [183], [188], [196], [199], [202], [206], [208], [210], [211], [212], [215], [217], [220], [226], [232], [236], [238], [242], [244], [247], [252], [262], [263], [264], [265], [266], [267], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [286], [287], [288], [289], [290], [291], [293], [294], [295] [2018-11-18 10:42:13,249 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:42:13,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:42:13,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:42:13,371 INFO L272 AbstractInterpreter]: Visited 98 different actions 469 times. Merged at 36 different actions 93 times. Never widened. Performed 5385 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5385 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 7 different actions. Largest state had 36 variables. [2018-11-18 10:42:13,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:13,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:42:13,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:13,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:42:13,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:13,381 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:42:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:13,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:42:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 10:42:13,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:42:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-18 10:42:13,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:42:13,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 4] total 12 [2018-11-18 10:42:13,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:42:13,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:42:13,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:42:13,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:42:13,599 INFO L87 Difference]: Start difference. First operand 1805 states and 2643 transitions. Second operand 3 states. [2018-11-18 10:42:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:42:13,643 INFO L93 Difference]: Finished difference Result 2470 states and 3679 transitions. [2018-11-18 10:42:13,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:42:13,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-11-18 10:42:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:42:13,646 INFO L225 Difference]: With dead ends: 2470 [2018-11-18 10:42:13,646 INFO L226 Difference]: Without dead ends: 786 [2018-11-18 10:42:13,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 405 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:42:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2018-11-18 10:42:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 779. [2018-11-18 10:42:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2018-11-18 10:42:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 923 transitions. [2018-11-18 10:42:13,699 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 923 transitions. Word has length 204 [2018-11-18 10:42:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:42:13,700 INFO L480 AbstractCegarLoop]: Abstraction has 779 states and 923 transitions. [2018-11-18 10:42:13,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:42:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 923 transitions. [2018-11-18 10:42:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-18 10:42:13,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:42:13,704 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:42:13,704 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:42:13,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:13,704 INFO L82 PathProgramCache]: Analyzing trace with hash 439009695, now seen corresponding path program 1 times [2018-11-18 10:42:13,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:42:13,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:13,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:13,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:42:13,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:42:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 33 proven. 59 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-18 10:42:13,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:13,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:42:13,813 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-11-18 10:42:13,813 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [36], [39], [45], [51], [55], [58], [60], [62], [66], [67], [70], [72], [75], [77], [80], [83], [85], [87], [88], [89], [90], [92], [97], [99], [100], [101], [105], [111], [114], [117], [119], [123], [126], [136], [139], [150], [151], [154], [157], [159], [161], [163], [165], [166], [167], [172], [178], [180], [183], [188], [196], [199], [202], [206], [208], [210], [211], [212], [215], [217], [220], [226], [232], [236], [238], [240], [242], [244], [247], [250], [252], [262], [263], [264], [265], [266], [267], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [286], [287], [288], [289], [290], [291], [293], [294], [295] [2018-11-18 10:42:13,814 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:42:13,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:42:13,863 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:42:13,863 INFO L272 AbstractInterpreter]: Visited 95 different actions 271 times. Merged at 22 different actions 33 times. Never widened. Performed 2325 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2325 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 4 different actions. Largest state had 36 variables. [2018-11-18 10:42:13,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:42:13,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:42:13,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:42:13,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:42:13,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:42:13,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:42:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:42:13,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:42:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-18 10:42:13,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:42:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2018-11-18 10:42:14,089 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:42:14,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-11-18 10:42:14,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:42:14,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:42:14,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:42:14,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:42:14,090 INFO L87 Difference]: Start difference. First operand 779 states and 923 transitions. Second operand 3 states. [2018-11-18 10:42:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:42:14,119 INFO L93 Difference]: Finished difference Result 991 states and 1198 transitions. [2018-11-18 10:42:14,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:42:14,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-11-18 10:42:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:42:14,120 INFO L225 Difference]: With dead ends: 991 [2018-11-18 10:42:14,120 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:42:14,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:42:14,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:42:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:42:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:42:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:42:14,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-11-18 10:42:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:42:14,124 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:42:14,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:42:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:42:14,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:42:14,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:42:14,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:14,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:42:15,322 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 1 [2018-11-18 10:42:15,591 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2018-11-18 10:42:15,998 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 102 [2018-11-18 10:42:16,244 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2018-11-18 10:42:16,716 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 100 [2018-11-18 10:42:17,060 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 90 [2018-11-18 10:42:17,236 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-11-18 10:42:17,483 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2018-11-18 10:42:17,649 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2018-11-18 10:42:18,131 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 102 [2018-11-18 10:42:19,050 WARN L180 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 156 [2018-11-18 10:42:19,182 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-11-18 10:42:19,503 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 103 [2018-11-18 10:42:19,772 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 95 [2018-11-18 10:42:20,033 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 58 [2018-11-18 10:42:20,942 WARN L180 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 146 [2018-11-18 10:42:21,307 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 108 [2018-11-18 10:42:22,021 WARN L180 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 152 [2018-11-18 10:42:22,413 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 134 [2018-11-18 10:42:22,568 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-11-18 10:42:22,837 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 100 [2018-11-18 10:42:23,867 WARN L180 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 156 [2018-11-18 10:42:24,099 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2018-11-18 10:42:24,496 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 99 [2018-11-18 10:42:24,799 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2018-11-18 10:42:25,214 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 130 [2018-11-18 10:42:25,394 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-11-18 10:42:25,678 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 96 [2018-11-18 10:42:25,681 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2018-11-18 10:42:25,681 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-11-18 10:42:25,681 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2018-11-18 10:42:25,681 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2018-11-18 10:42:25,682 INFO L421 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_i~0 1))) (.cse7 (= exists_runnable_thread_~__retres1~2 1)) (.cse2 (not (= 2 ~q_write_ev~0))) (.cse3 (not (= 0 ~p_last_write~0))) (.cse1 (not (= ~q_free~0 1))) (.cse8 (not (= ~p_dw_st~0 0))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse5 (not (= 0 ~q_buf_0~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse6 (not (= 0 ~p_num_write~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 (not (= ~q_read_ev~0 2)) .cse1 .cse2 .cse3 (not (= 1 ~c_dr_i~0)) .cse4 .cse5 .cse6 (not (= 0 ~a_t~0)) .cse7 .cse8 .cse9 (not (= 0 ~c_dr_pc~0)) .cse10 (not (= 0 ~c_dr_st~0))) (or .cse0 .cse7 .cse2 (or (not (= 1 ~c_dr_pc~0)) (not (= 2 ~c_dr_st~0)) .cse3 .cse1 .cse8 .cse9 .cse5 .cse4 .cse6) .cse10))) [2018-11-18 10:42:25,682 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2018-11-18 10:42:25,682 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2018-11-18 10:42:25,682 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2018-11-18 10:42:25,682 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0)) (not (= ~q_read_ev~0 2)) (not (= ~q_free~0 1)) (not (= 2 ~q_write_ev~0)) (not (= 0 ~p_last_write~0)) (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= 0 ~a_t~0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 ~c_num_read~0)) (not (= 0 ~c_dr_pc~0)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= 0 |old(~c_dr_st~0)|))) [2018-11-18 10:42:25,682 INFO L425 ceAbstractionStarter]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2018-11-18 10:42:25,682 INFO L421 ceAbstractionStarter]: At program point L354-1(line 354) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~a_t~0)|)) (not (= |old(~q_free~0)| 0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~q_write_ev~0 2) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_pc~0 0) (= ~q_free~0 1) (= ~c_dr_i~0 1) (= ~c_num_read~0 0) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= ~q_buf_0~0 0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-11-18 10:42:25,683 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~a_t~0)|)) (and (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= 0 ~q_free~0) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= ~q_buf_0~0 0) (= ~c_dr_pc~0 0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-11-18 10:42:25,683 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2018-11-18 10:42:25,683 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2018-11-18 10:42:25,683 INFO L425 ceAbstractionStarter]: For program point L355(line 355) no Hoare annotation was computed. [2018-11-18 10:42:25,683 INFO L421 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~a_t~0)|)) (and (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= 0 ~q_free~0) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= ~q_buf_0~0 0) (= ~c_dr_pc~0 0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-11-18 10:42:25,683 INFO L421 ceAbstractionStarter]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse1 (not (= 1 ~c_dr_pc~0))) (.cse7 (not (= 0 |old(~p_last_write~0)|))) (.cse11 (not (= 0 |old(~q_buf_0~0)|))) (.cse2 (<= 2 ~p_dw_st~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~c_dr_st~0 0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse15 (= ~q_write_ev~0 2)) (.cse6 (= 0 ~q_free~0)) (.cse9 (not (= 2 |old(~q_write_ev~0)|))) (.cse10 (not (= |old(~p_dw_pc~0)| 0))) (.cse8 (not (= |old(~q_free~0)| 1))) (.cse13 (not (= 0 ~c_num_read~0))) (.cse12 (not (= 0 |old(~p_num_write~0)|)))) (and (let ((.cse3 (<= 2 ~q_write_ev~0))) (or (< |old(~q_write_ev~0)| 2) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (or .cse0 (not (= |old(~p_dw_pc~0)| 1)))) .cse1) (< ~c_num_read~0 |old(~p_num_write~0)|)) (and (not (= ~q_free~0 ~p_dw_pc~0)) .cse2 .cse3 (<= 2 ~c_dr_st~0) .cse4 .cse5) (and .cse2 .cse3 .cse4 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse5 .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (< |old(~c_dr_st~0)| 2))) (or .cse0 .cse7 (not (= ~q_read_ev~0 2)) .cse8 .cse9 (not (= 1 ~c_dr_i~0)) .cse10 .cse11 .cse12 (not (= 0 ~a_t~0)) .cse13 (not (= 0 ~c_dr_pc~0)) (and (= ~p_dw_st~0 2) .cse4 .cse14 .cse5 .cse15 .cse6 (= ~p_num_write~0 1)) .cse16 (not (= 0 |old(~c_dr_st~0)|))) (or (or .cse0 .cse16) (or .cse1 (not (= 2 |old(~c_dr_st~0)|)) .cse7 .cse11) (and .cse2 (= (mod ~p_dw_st~0 2) 0) .cse4 .cse14 .cse5 .cse15 .cse6 (= 1 ~p_num_write~0)) .cse9 .cse10 (or .cse8 .cse13) .cse12))) [2018-11-18 10:42:25,683 INFO L421 ceAbstractionStarter]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse2 (not (= 1 ~c_dr_pc~0))) (.cse7 (= ~q_free~0 |old(~q_free~0)|)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= 0 |old(~p_last_write~0)|))) (.cse12 (not (= |old(~q_free~0)| 1))) (.cse5 (not (= 2 |old(~q_write_ev~0)|))) (.cse8 (= ~q_write_ev~0 2)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= ~q_buf_0~0 0)) (.cse11 (= 0 ~p_num_write~0)) (.cse6 (not (= |old(~p_dw_pc~0)| 0))) (.cse4 (not (= 0 |old(~q_buf_0~0)|))) (.cse14 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or (or .cse0 .cse1) (or .cse2 (not (= 2 |old(~c_dr_st~0)|)) .cse3 .cse4) .cse5 .cse6 (and .cse7 .cse8 (and .cse9 (= ~c_dr_st~0 2)) .cse10 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) .cse11) (or .cse12 .cse13) .cse14) (or (< |old(~q_write_ev~0)| 2) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (or .cse0 (not (= |old(~p_dw_pc~0)| 1)))) .cse2) (< ~c_num_read~0 |old(~p_num_write~0)|)) (< |old(~c_dr_st~0)| 2) (and (<= 2 ~q_write_ev~0) (<= 2 ~c_dr_st~0) (and (= ~p_num_write~0 |old(~p_num_write~0)|) (and (= ~p_last_write~0 ~q_buf_0~0) .cse7 (= 1 ~p_dw_pc~0))))) (or .cse0 .cse3 (not (= ~q_read_ev~0 2)) .cse12 .cse5 (and (= ~c_dr_st~0 0) .cse8 (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse10 .cse9 .cse11) (not (= 1 ~c_dr_i~0)) .cse6 .cse4 .cse14 (not (= 0 ~a_t~0)) .cse13 (not (= 0 ~c_dr_pc~0)) .cse1 (not (= 0 |old(~c_dr_st~0)|))))) [2018-11-18 10:42:25,683 INFO L421 ceAbstractionStarter]: At program point L124(line 124) the Hoare annotation is: (let ((.cse2 (not (= 1 ~c_dr_pc~0))) (.cse12 (<= 2 ~c_dr_st~0)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= 0 |old(~p_last_write~0)|))) (.cse7 (not (= |old(~q_free~0)| 1))) (.cse5 (not (= 2 |old(~q_write_ev~0)|))) (.cse6 (not (= |old(~p_dw_pc~0)| 0))) (.cse4 (not (= 0 |old(~q_buf_0~0)|))) (.cse9 (not (= 0 |old(~p_num_write~0)|))) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (= ~q_write_ev~0 1)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= 0 ~q_free~0)) (.cse8 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or (or .cse0 .cse1) (or .cse2 (not (= 2 |old(~c_dr_st~0)|)) .cse3 .cse4) .cse5 .cse6 (or .cse7 .cse8) .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 (= 1 ~p_num_write~0))) (or (< |old(~q_write_ev~0)| 2) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (or .cse0 (not (= |old(~p_dw_pc~0)| 1)))) .cse2) (< ~c_num_read~0 |old(~p_num_write~0)|)) (< |old(~c_dr_st~0)| 2) (let ((.cse15 (+ |old(~p_num_write~0)| 1))) (and .cse14 .cse12 (<= .cse15 ~p_num_write~0) .cse13 (<= ~p_num_write~0 .cse15) (= 1 ~p_dw_pc~0)))) (or .cse0 .cse3 (not (= ~q_read_ev~0 2)) .cse7 .cse5 (not (= 1 ~c_dr_i~0)) .cse6 .cse4 .cse9 (and .cse10 .cse11 .cse13 (= ~c_dr_st~0 0) .cse14 (= ~p_num_write~0 1)) (not (= 0 ~a_t~0)) .cse8 (not (= 0 ~c_dr_pc~0)) .cse1 (not (= 0 |old(~c_dr_st~0)|))))) [2018-11-18 10:42:25,683 INFO L425 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-11-18 10:42:25,683 INFO L425 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2018-11-18 10:42:25,683 INFO L425 ceAbstractionStarter]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2018-11-18 10:42:25,684 INFO L421 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse13 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse1 (not (= 0 |old(~p_last_write~0)|))) (.cse5 (not (= 0 |old(~q_buf_0~0)|))) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~q_free~0 1)) (.cse10 (= ~q_write_ev~0 2)) (.cse11 (= 0 ~p_num_write~0)) (.cse3 (not (= 2 |old(~q_write_ev~0)|))) (.cse4 (not (= |old(~p_dw_pc~0)| 0))) (.cse2 (not (= |old(~q_free~0)| 1))) (.cse12 (not (= 0 ~c_num_read~0))) (.cse6 (not (= 0 |old(~p_num_write~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse14 (not (= 1 ~c_dr_pc~0))) (.cse15 (<= 2 ~c_dr_st~0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (and (or .cse0 .cse1 (not (= ~q_read_ev~0 2)) .cse2 .cse3 (not (= 1 ~c_dr_i~0)) .cse4 .cse5 .cse6 (not (= 0 ~a_t~0)) (and .cse7 .cse8 .cse9 (= ~c_dr_st~0 0) .cse10 .cse11) .cse12 (not (= 0 ~c_dr_pc~0)) .cse13 (not (= 0 |old(~c_dr_st~0)|))) (or (or .cse0 .cse13) (or .cse14 (not (= 2 |old(~c_dr_st~0)|)) .cse1 .cse5) (and (= (mod ~c_dr_st~0 2) 0) .cse7 .cse8 .cse15 .cse9 .cse10 .cse11) .cse3 .cse4 (or .cse2 .cse12) .cse6) (or (< |old(~q_write_ev~0)| 2) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (or .cse0 (not (= |old(~p_dw_pc~0)| 1)))) .cse14) (< ~c_num_read~0 |old(~p_num_write~0)|)) (< |old(~c_dr_st~0)| 2) (and (<= 2 ~q_write_ev~0) .cse15 (and (= ~p_num_write~0 |old(~p_num_write~0)|) (and .cse9 (= 1 ~p_dw_pc~0))))))) [2018-11-18 10:42:25,684 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 127) no Hoare annotation was computed. [2018-11-18 10:42:25,684 INFO L421 ceAbstractionStarter]: At program point L107-2(lines 95 132) the Hoare annotation is: (let ((.cse2 (not (= 1 ~c_dr_pc~0))) (.cse17 (= 1 ~p_dw_pc~0)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= 0 ~q_free~0)) (.cse3 (not (= 0 |old(~p_last_write~0)|))) (.cse18 (not (= |old(~q_free~0)| 1))) (.cse11 (not (= 2 |old(~q_write_ev~0)|))) (.cse12 (not (= |old(~p_dw_pc~0)| 0))) (.cse4 (not (= 0 |old(~q_buf_0~0)|))) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (= ~q_free~0 1)) (.cse7 (= ~p_dw_pc~0 0)) (.cse16 (= ~c_dr_st~0 0)) (.cse6 (= ~q_write_ev~0 2)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~q_buf_0~0 0)) (.cse10 (= 0 ~p_num_write~0)) (.cse19 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or (or .cse0 .cse1) (or .cse2 (not (= 2 |old(~c_dr_st~0)|)) .cse3 .cse4) (and .cse5 .cse6 (and .cse7 .cse8 (= ~c_dr_st~0 2)) .cse9 .cse10) .cse11 .cse12 .cse13 (and (= 1 ~p_num_write~0) (let ((.cse14 (= ~q_free~0 0))) (or (and .cse14 .cse6 .cse7 .cse15 .cse16) (and .cse14 .cse6 .cse15 .cse16 .cse17)))) (or .cse18 .cse19)) (let ((.cse21 (<= 2 ~q_write_ev~0))) (or (< |old(~q_write_ev~0)| 2) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (or .cse0 (not (= |old(~p_dw_pc~0)| 1)))) .cse2) (< ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse20 .cse21 (<= 2 ~c_dr_st~0) .cse15 .cse17) (< |old(~c_dr_st~0)| 2) (let ((.cse22 (+ |old(~p_num_write~0)| 1))) (and .cse20 .cse21 .cse15 (<= .cse22 ~p_num_write~0) .cse17 (<= ~p_num_write~0 .cse22))))) (or .cse0 (and .cse7 .cse15 .cse16 .cse6 .cse20 (= ~p_num_write~0 1)) .cse3 (not (= ~q_read_ev~0 2)) .cse18 .cse11 (not (= 1 ~c_dr_i~0)) .cse12 .cse4 .cse13 (not (= 0 ~a_t~0)) (and .cse5 .cse7 .cse16 .cse6 .cse9 .cse8 .cse10) .cse19 (not (= 0 ~c_dr_pc~0)) .cse1 (not (= 0 |old(~c_dr_st~0)|))))) [2018-11-18 10:42:25,684 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2018-11-18 10:42:25,684 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-11-18 10:42:25,684 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-11-18 10:42:25,684 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-11-18 10:42:25,684 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-11-18 10:42:25,684 INFO L421 ceAbstractionStarter]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse7 (not (= 0 ~c_dr_pc~0))) (.cse8 (<= 2 ~p_dw_st~0)) (.cse10 (not (= ~q_free~0 1))) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse13 (not (= 1 ~c_dr_pc~0))) (.cse3 (not (= ~q_free~0 0))) (.cse15 (< |old(~c_dr_st~0)| 2)) (.cse16 (<= 2 ~c_dr_st~0)) (.cse4 (not (= 1 ~q_write_ev~0))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse6 (not (= 0 ~c_num_read~0))) (.cse2 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~q_read_ev~0 2)) .cse2 (= ~c_dr_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~c_dr_st~0)|))) (or .cse8 (or .cse0 .cse1 (not (= ~q_read_ev~0 1)) .cse9 .cse10 .cse11) .cse5 (not (= 2 ~q_write_ev~0)) (not (= 1 ~c_num_read~0)) .cse7 .cse12) (or .cse8 (< ~q_write_ev~0 2) (< ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse13 .cse9 .cse10 (< ~c_num_read~0 ~p_num_write~0) .cse12 .cse11) (let ((.cse14 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse14) .cse13 .cse3 .cse15 (or .cse0 .cse1 .cse9) (< .cse14 ~p_num_write~0) .cse16)) (or .cse0 .cse1 .cse13 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse2))) [2018-11-18 10:42:25,684 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2018-11-18 10:42:25,684 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-18 10:42:25,684 INFO L425 ceAbstractionStarter]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2018-11-18 10:42:25,684 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2018-11-18 10:42:25,685 INFO L425 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2018-11-18 10:42:25,685 INFO L421 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (let ((.cse7 (not (= 0 ~c_dr_pc~0))) (.cse8 (<= 2 ~p_dw_st~0)) (.cse10 (not (= ~q_free~0 1))) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse13 (not (= 1 ~c_dr_pc~0))) (.cse3 (not (= ~q_free~0 0))) (.cse15 (< |old(~c_dr_st~0)| 2)) (.cse16 (<= 2 ~c_dr_st~0)) (.cse4 (not (= 1 ~q_write_ev~0))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse6 (not (= 0 ~c_num_read~0))) (.cse2 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~q_read_ev~0 2)) .cse2 (= ~c_dr_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~c_dr_st~0)|))) (or .cse8 (or .cse0 .cse1 (not (= ~q_read_ev~0 1)) .cse9 .cse10 .cse11) .cse5 (not (= 2 ~q_write_ev~0)) (not (= 1 ~c_num_read~0)) .cse7 .cse12) (or .cse8 (< ~q_write_ev~0 2) (< ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse13 .cse9 .cse10 (< ~c_num_read~0 ~p_num_write~0) .cse12 .cse11) (let ((.cse14 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse14) .cse13 .cse3 .cse15 (or .cse0 .cse1 .cse9) (< .cse14 ~p_num_write~0) .cse16)) (or .cse0 .cse1 .cse13 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse2))) [2018-11-18 10:42:25,685 INFO L421 ceAbstractionStarter]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse3 (not (= ~q_read_ev~0 1))) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse5 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse6 (not (= 2 ~q_write_ev~0))) (.cse10 (not (= 1 ~c_num_read~0))) (.cse21 (not (= 0 ~c_dr_pc~0))) (.cse11 (< |old(~p_dw_st~0)| 2)) (.cse13 (= ~p_dw_st~0 0)) (.cse8 (= immediate_notify_threads_~tmp~0 1)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (= 1 ~c_dr_pc~0))) (.cse15 (not (= ~q_free~0 0))) (.cse16 (< |old(~c_dr_st~0)| 2)) (.cse19 (not (= 1 ~q_write_ev~0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse20 (not (= 0 ~c_num_read~0))) (.cse18 (not (= ~p_dw_pc~0 0))) (.cse17 (<= 2 ~c_dr_st~0)) (.cse9 (= immediate_notify_threads_~tmp~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse8 .cse9) .cse10 .cse11 .cse12) (or .cse13 (< ~q_write_ev~0 2) (< ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse2 (and (<= 2 ~p_dw_st~0) .cse9) .cse4 .cse5 (< ~c_num_read~0 ~p_num_write~0) .cse11 .cse12) (let ((.cse14 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse14) .cse2 .cse15 .cse16 (or .cse0 .cse1 .cse4) (< .cse14 ~p_num_write~0) (and (or .cse13 .cse9) .cse17))) (or .cse0 .cse1 (not (= ~q_read_ev~0 2)) .cse18 (and (= ~c_dr_st~0 0) .cse9) .cse15 .cse19 .cse7 .cse20 .cse21 (not (= 0 |old(~c_dr_st~0)|))) (or (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse12) .cse7 .cse6 .cse10 .cse21 .cse11 (and .cse13 .cse8)) (or .cse0 .cse1 .cse2 .cse15 .cse16 .cse19 .cse7 .cse20 .cse18 (and .cse17 .cse9)))) [2018-11-18 10:42:25,685 INFO L425 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2018-11-18 10:42:25,685 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:42:25,685 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(~c_num_read~0)| ~c_num_read~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_free~0 |old(~q_free~0)|)) [2018-11-18 10:42:25,685 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:42:25,685 INFO L425 ceAbstractionStarter]: For program point L290-1(line 290) no Hoare annotation was computed. [2018-11-18 10:42:25,685 INFO L428 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: true [2018-11-18 10:42:25,685 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2018-11-18 10:42:25,685 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2018-11-18 10:42:25,685 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2018-11-18 10:42:25,685 INFO L428 ceAbstractionStarter]: At program point L290(line 290) the Hoare annotation is: true [2018-11-18 10:42:25,685 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2018-11-18 10:42:25,686 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse38 (= ~p_dw_i~0 1))) (let ((.cse22 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse30 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse19 (= ~q_free~0 |old(~q_free~0)|)) (.cse20 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= 1 ~p_dw_pc~0)) (.cse40 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse24 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse23 (not .cse38)) (.cse39 (not (= 1 |old(~c_dr_pc~0)|))) (.cse26 (not (= |old(~p_dw_pc~0)| 1))) (.cse32 (not (= |old(~p_dw_st~0)| 0))) (.cse33 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (let ((.cse25 (not (= |old(~q_read_ev~0)| 2))) (.cse18 (= ~p_dw_st~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse29 (= ~c_dr_pc~0 0)) (.cse27 (= ~q_read_ev~0 2)) (.cse28 (= ~c_num_read~0 0)) (.cse5 (not (= 0 |old(~c_num_read~0)|))) (.cse31 (not (= 0 |old(~c_dr_pc~0)|))) (.cse8 (not (= 0 |old(~c_dr_st~0)|))) (.cse15 (<= 2 ~c_dr_st~0)) (.cse10 (and (or .cse24 .cse23 .cse39 .cse40 .cse26 .cse32) (or .cse24 .cse23 .cse39 .cse26 .cse32 .cse33))) (.cse11 (< |old(~c_dr_st~0)| 2)) (.cse4 (not (= 1 |old(~p_num_write~0)|))) (.cse0 (not (= 2 |old(~q_write_ev~0)|))) (.cse36 (not (= 1 |old(~c_num_read~0)|))) (.cse2 (= ~q_write_ev~0 2)) (.cse9 (< |old(~q_write_ev~0)| 2)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse6 (and (or .cse24 .cse23 .cse39 .cse40 .cse26) (or .cse24 .cse23 .cse39 .cse26 .cse33))) (.cse12 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse34 (<= 2 ~p_dw_st~0)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse14 (= |old(~c_num_read~0)| ~c_num_read~0)) (.cse35 (or (and .cse22 .cse17 .cse30 .cse19 .cse38 .cse20 .cse21) (and .cse16 .cse17 .cse30 .cse19 .cse38 .cse20 .cse21))) (.cse7 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 (and (= (mod ~p_dw_st~0 2) 0) .cse1 .cse2) .cse3 (not (= 0 (mod |old(~p_dw_st~0)| 2))) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse22 .cse17 .cse18 .cse19 .cse20 .cse21))) (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (or .cse23 .cse24 .cse0 (or .cse25 .cse26 (not (= |old(~p_dw_st~0)| 2))) .cse3 (and .cse27 (= ~p_dw_st~0 2) .cse20 .cse1 .cse28 .cse2 (= 0 ~q_free~0) (= ~p_num_write~0 1) .cse29 .cse30) .cse4 .cse5 .cse31 .cse8) (or .cse23 .cse25 (not (= |old(~q_free~0)| 1)) .cse0 (not (= 0 |old(~p_last_write~0)|)) (not (= 1 ~c_dr_i~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (and .cse18 .cse1 .cse2 .cse29 .cse27 (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse28 (= ~p_last_write~0 0) .cse16 (= ~a_t~0 0) (= ~q_buf_0~0 0) (= 0 ~p_num_write~0)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~a_t~0)|)) .cse32 .cse5 .cse31 .cse33 .cse8) (or .cse9 .cse11 (and .cse12 .cse34 .cse13 .cse14 .cse15 .cse35) .cse6 .cse7) (or .cse10 .cse2 .cse11 .cse4 .cse0 .cse36) (or .cse11 .cse4 .cse0 .cse6 .cse36 .cse2 .cse7) (let ((.cse37 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse37) .cse9 .cse3 (< .cse37 |old(~p_num_write~0)|) .cse6 (and .cse12 .cse34 .cse13 .cse14 .cse35) .cse7)))))) [2018-11-18 10:42:25,686 INFO L421 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (let ((.cse29 (= ~p_dw_i~0 1))) (let ((.cse12 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse0 (not .cse29)) (.cse11 (not (= 1 |old(~c_dr_pc~0)|))) (.cse5 (not (= |old(~p_dw_pc~0)| 1))) (.cse14 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse20 (= ~c_dr_pc~0 1))) (let ((.cse6 (not (= |old(~q_free~0)| 0))) (.cse2 (and (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (and (and (= ~p_last_write~0 ~q_buf_0~0) .cse29 (= 1 ~p_dw_pc~0)) .cse20)) (<= 2 ~q_write_ev~0) (<= 2 ~c_dr_st~0))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse9 (not (= 0 |old(~c_dr_st~0)|))) (.cse4 (not (= |old(~q_read_ev~0)| 2))) (.cse3 (not (= 2 |old(~q_write_ev~0)|))) (.cse13 (not (= |old(~p_dw_st~0)| 0))) (.cse8 (not (= 0 |old(~c_dr_pc~0)|))) (.cse10 (< |old(~q_write_ev~0)| 2)) (.cse15 (< |old(~c_dr_st~0)| 2)) (.cse17 (and (or .cse1 .cse0 .cse11 .cse12 .cse5) (or .cse1 .cse0 .cse11 .cse5 .cse14))) (.cse18 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 (or .cse4 .cse5 (not (= |old(~p_dw_st~0)| 2))) .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 .cse8 .cse9) (or .cse10 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse2 (and (or .cse1 .cse0 .cse11 .cse12 .cse5 .cse13) (or .cse1 .cse0 .cse11 .cse5 .cse13 .cse14)) .cse15 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (let ((.cse16 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse16) .cse10 .cse6 .cse2 (< .cse16 |old(~p_num_write~0)|) .cse17 .cse18)) (let ((.cse19 (= ~q_free~0 1)) (.cse21 (= ~c_num_read~0 0)) (.cse22 (= ~q_write_ev~0 2)) (.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (let ((.cse26 (= ~p_dw_pc~0 0)) (.cse27 (= ~p_last_write~0 0)) (.cse28 (= ~q_buf_0~0 0))) (or (and .cse26 .cse27 .cse20 .cse28 (= ~c_dr_st~0 2)) (and .cse26 .cse27 (= ~a_t~0 0) .cse28 (= ~c_dr_pc~0 0) (= ~c_dr_st~0 0))))) (.cse25 (= 0 ~p_num_write~0))) (or .cse0 .cse2 (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) .cse7 .cse14 .cse9 (not (= 0 |old(~p_last_write~0)|)) .cse4 .cse3 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (and (= ~q_read_ev~0 2) .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~a_t~0)|)) .cse13 .cse8)) (or .cse10 .cse15 .cse17 .cse18))))) [2018-11-18 10:42:25,686 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2018-11-18 10:42:25,686 INFO L425 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2018-11-18 10:42:25,686 INFO L425 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-11-18 10:42:25,686 INFO L421 ceAbstractionStarter]: At program point L238(line 238) the Hoare annotation is: (let ((.cse36 (= ~c_last_read~0 ~p_last_write~0)) (.cse32 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse33 (= ~c_dr_pc~0 1)) (.cse46 (= ~p_dw_i~0 1)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse35 (= 1 ~p_dw_pc~0))) (let ((.cse18 (= 0 ~q_free~0)) (.cse44 (or (and .cse36 .cse33 .cse46 .cse14 .cse35) (and .cse32 .cse33 .cse46 .cse14 .cse35))) (.cse29 (<= 2 ~p_dw_st~0)) (.cse30 (<= 2 ~q_write_ev~0)) (.cse31 (<= 2 ~c_dr_st~0)) (.cse40 (= ~p_dw_st~0 0)) (.cse3 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse46)) (.cse2 (not (= 1 |old(~c_dr_pc~0)|))) (.cse4 (not (= |old(~p_dw_pc~0)| 1))) (.cse6 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (let ((.cse10 (< |old(~c_dr_st~0)| 2)) (.cse25 (not (= 1 |old(~p_num_write~0)|))) (.cse8 (< |old(~q_write_ev~0)| 2)) (.cse23 (not (= |old(~q_free~0)| 0))) (.cse37 (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 .cse4 .cse6))) (.cse38 (< |old(~p_dw_st~0)| 2)) (.cse9 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse30 .cse31 (or (and .cse36 .cse33 .cse40 .cse46 .cse14 .cse35) (and .cse32 .cse33 .cse40 .cse46 .cse14 .cse35)))) (.cse34 (= ~q_free~0 |old(~q_free~0)|)) (.cse21 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse26 (not (= 0 |old(~c_num_read~0)|))) (.cse27 (not (= 0 |old(~c_dr_st~0)|))) (.cse11 (and .cse44 .cse29 .cse30 .cse31)) (.cse12 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_st~0 2)) (.cse15 (= ~c_dr_st~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse17 (= ~q_write_ev~0 2)) (.cse19 (= ~p_num_write~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse24 (not (= |old(~q_read_ev~0)| 2))) (.cse22 (not (= 2 |old(~q_write_ev~0)|))) (.cse7 (let ((.cse45 (+ ~c_num_read~0 1))) (and .cse44 (<= .cse45 ~p_num_write~0) .cse18 .cse29 .cse30 (<= ~p_num_write~0 .cse45)))) (.cse5 (not (= |old(~p_dw_st~0)| 0))) (.cse28 (not (= 0 |old(~c_dr_pc~0)|)))) (and (or (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6)) .cse7 .cse8 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse9 .cse10 (< |old(~c_num_read~0)| |old(~p_num_write~0)|) .cse11) (or .cse1 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse9 .cse11 .cse0 .cse22 (or .cse23 .cse24 .cse4 .cse25 (not (= |old(~p_dw_st~0)| 2)) .cse26 .cse27) .cse7 .cse28) (or .cse8 .cse10 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse29 .cse30 (= |old(~c_num_read~0)| ~c_num_read~0) .cse31 (or (and .cse32 .cse33 .cse34 .cse14 .cse35) (and .cse36 .cse33 .cse34 .cse14 .cse35))) .cse37 .cse38) (or .cse10 .cse25 .cse22 .cse37 (not (= 1 |old(~c_num_read~0)|)) .cse17 .cse38) (let ((.cse39 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse39) (< .cse39 |old(~p_num_write~0)|) .cse7 .cse8 .cse23 .cse9 .cse37 .cse38 .cse11)) (let ((.cse41 (= ~p_last_write~0 0)) (.cse42 (= ~q_buf_0~0 0)) (.cse43 (= 0 ~p_num_write~0))) (or .cse1 (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) .cse9 (and .cse33 .cse40 .cse34 .cse16 .cse17 .cse41 .cse36 .cse42 (= ~c_dr_st~0 2) .cse21 .cse43) .cse26 .cse6 .cse27 .cse11 (and .cse40 .cse15 .cse17 .cse20 .cse12 (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse16 .cse41 .cse36 (= ~a_t~0 0) .cse42 .cse43) (and .cse12 .cse13 .cse14 .cse15 .cse35 .cse16 .cse17 .cse18 .cse19 .cse20) (not (= 0 |old(~p_last_write~0)|)) .cse24 .cse22 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 (not (= 0 |old(~a_t~0)|)) .cse5 .cse28)))))) [2018-11-18 10:42:25,687 INFO L421 ceAbstractionStarter]: At program point L269(line 269) the Hoare annotation is: (let ((.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (= ~p_last_write~0 ~q_buf_0~0)) (.cse31 (= 1 ~p_dw_pc~0)) (.cse32 (+ ~c_num_read~0 1)) (.cse34 (= ~p_dw_i~0 1))) (let ((.cse28 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse7 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not .cse34)) (.cse27 (not (= 1 |old(~c_dr_pc~0)|))) (.cse10 (not (= |old(~p_dw_pc~0)| 1))) (.cse25 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse15 (<= .cse32 ~p_num_write~0)) (.cse20 (let ((.cse33 (= ~c_dr_pc~0 1))) (or (and .cse23 .cse33 .cse34 .cse30 .cse31) (and (not (= ~q_free~0 ~p_dw_pc~0)) .cse33 .cse34 .cse30 .cse31)))) (.cse18 (<= 2 ~q_write_ev~0)) (.cse19 (<= ~p_num_write~0 .cse32)) (.cse17 (<= 2 ~p_dw_st~0)) (.cse21 (= ~c_num_read~0 0)) (.cse22 (= ~q_write_ev~0 2)) (.cse16 (= 0 ~q_free~0)) (.cse24 (= ~c_dr_pc~0 0))) (let ((.cse2 (not (= |old(~q_free~0)| 0))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (not (= 0 |old(~c_dr_st~0)|))) (.cse12 (and .cse17 (= (mod ~p_dw_st~0 2) 0) .cse30 .cse31 .cse21 .cse22 .cse16 (= ~p_num_write~0 1) .cse24)) (.cse9 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (not (= 2 |old(~q_write_ev~0)|))) (.cse13 (not (= 0 |old(~c_dr_pc~0)|))) (.cse26 (not (= |old(~p_dw_st~0)| 0))) (.cse3 (and .cse15 .cse20 .cse16 .cse17 .cse18 .cse19)) (.cse1 (< |old(~q_write_ev~0)| 2)) (.cse29 (< |old(~c_dr_st~0)| 2)) (.cse4 (and (or .cse7 .cse6 .cse27 .cse28 .cse10) (or .cse7 .cse6 .cse27 .cse10 .cse25))) (.cse5 (< |old(~p_dw_st~0)| 2))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse0) .cse1 .cse2 (< .cse0 |old(~p_num_write~0)|) .cse3 .cse4 .cse5)) (or .cse6 .cse7 .cse8 (or .cse9 .cse10 (not (= |old(~p_dw_st~0)| 2))) .cse2 .cse3 (not (= 1 |old(~p_num_write~0)|)) .cse11 .cse12 .cse13 .cse14) (or .cse6 (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse11 (and (= ~q_read_ev~0 2) (= ~p_dw_st~0 0) (= ~q_free~0 |old(~q_free~0)|) .cse21 .cse22 (= ~p_last_write~0 0) .cse23 (= ~a_t~0 0) (= ~q_buf_0~0 0) .cse24 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) .cse25 .cse14 (not (= 0 |old(~p_last_write~0)|)) .cse12 .cse9 .cse8 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~a_t~0)|)) .cse26 .cse13) (or .cse1 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) (and (or .cse7 .cse6 .cse27 .cse28 .cse10 .cse26) (or .cse7 .cse6 .cse27 .cse10 .cse26 .cse25)) .cse29 .cse3 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (or .cse1 .cse29 .cse4 .cse5))))) [2018-11-18 10:42:25,687 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2018-11-18 10:42:25,687 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2018-11-18 10:42:25,687 INFO L425 ceAbstractionStarter]: For program point L247(lines 237 277) no Hoare annotation was computed. [2018-11-18 10:42:25,687 INFO L421 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse31 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse32 (= ~c_dr_pc~0 1)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse34 (= 1 ~p_dw_pc~0)) (.cse41 (= ~p_dw_i~0 1))) (let ((.cse3 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse41)) (.cse2 (not (= 1 |old(~c_dr_pc~0)|))) (.cse4 (not (= |old(~p_dw_pc~0)| 1))) (.cse6 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse30 (<= 2 ~c_dr_st~0)) (.cse39 (or (and .cse35 .cse32 .cse41 .cse14 .cse34) (and .cse31 .cse32 .cse41 .cse14 .cse34))) (.cse18 (= 0 ~q_free~0)) (.cse28 (<= 2 ~p_dw_st~0)) (.cse29 (<= 2 ~q_write_ev~0))) (let ((.cse25 (not (= 0 |old(~c_num_read~0)|))) (.cse26 (not (= 0 |old(~c_dr_st~0)|))) (.cse12 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_st~0 2)) (.cse15 (= ~c_dr_st~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse19 (= ~p_num_write~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse23 (not (= |old(~q_read_ev~0)| 2))) (.cse5 (not (= |old(~p_dw_st~0)| 0))) (.cse27 (not (= 0 |old(~c_dr_pc~0)|))) (.cse10 (< |old(~c_dr_st~0)| 2)) (.cse24 (not (= 1 |old(~p_num_write~0)|))) (.cse21 (not (= 2 |old(~q_write_ev~0)|))) (.cse17 (= ~q_write_ev~0 2)) (.cse7 (let ((.cse42 (+ ~c_num_read~0 1))) (and .cse39 (<= .cse42 ~p_num_write~0) .cse18 .cse28 .cse29 (<= ~p_num_write~0 .cse42)))) (.cse8 (< |old(~q_write_ev~0)| 2)) (.cse22 (not (= |old(~q_free~0)| 0))) (.cse9 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse29 .cse30 (let ((.cse40 (= ~p_dw_st~0 0))) (or (and .cse35 .cse32 .cse40 .cse41 .cse14 .cse34) (and .cse31 .cse32 .cse40 .cse41 .cse14 .cse34))))) (.cse36 (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 .cse4 .cse6))) (.cse37 (< |old(~p_dw_st~0)| 2)) (.cse11 (and .cse39 .cse28 .cse29 .cse30))) (and (or (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6)) .cse7 .cse8 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse9 .cse10 (< |old(~c_num_read~0)| |old(~p_num_write~0)|) .cse11) (or .cse1 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) .cse9 .cse11 .cse0 .cse21 (or .cse22 .cse23 .cse4 .cse24 (not (= |old(~p_dw_st~0)| 2)) .cse25 .cse26) .cse7 .cse27) (or .cse8 .cse10 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse28 .cse29 (= |old(~c_num_read~0)| ~c_num_read~0) .cse30 (let ((.cse33 (= ~q_free~0 |old(~q_free~0)|))) (or (and .cse31 .cse32 .cse33 .cse14 .cse34) (and .cse35 .cse32 .cse33 .cse14 .cse34)))) .cse36 .cse37) (or .cse1 (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) .cse9 .cse25 .cse6 .cse26 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse20) (not (= 0 |old(~p_last_write~0)|)) .cse23 .cse21 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 (not (= 0 |old(~a_t~0)|)) .cse5 .cse27) (or .cse10 .cse24 .cse21 .cse36 (not (= 1 |old(~c_num_read~0)|)) .cse17 .cse37) (let ((.cse38 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse38) (< .cse38 |old(~p_num_write~0)|) .cse7 .cse8 .cse22 .cse9 .cse36 .cse37 .cse11)))))) [2018-11-18 10:42:25,687 INFO L425 ceAbstractionStarter]: For program point L237-1(lines 237 277) no Hoare annotation was computed. [2018-11-18 10:42:25,687 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2018-11-18 10:42:25,688 INFO L421 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse36 (= ~c_last_read~0 ~p_last_write~0)) (.cse32 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse33 (= ~c_dr_pc~0 1)) (.cse46 (= ~p_dw_i~0 1)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse35 (= 1 ~p_dw_pc~0))) (let ((.cse18 (= 0 ~q_free~0)) (.cse44 (or (and .cse36 .cse33 .cse46 .cse14 .cse35) (and .cse32 .cse33 .cse46 .cse14 .cse35))) (.cse29 (<= 2 ~p_dw_st~0)) (.cse30 (<= 2 ~q_write_ev~0)) (.cse31 (<= 2 ~c_dr_st~0)) (.cse40 (= ~p_dw_st~0 0)) (.cse3 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse46)) (.cse2 (not (= 1 |old(~c_dr_pc~0)|))) (.cse4 (not (= |old(~p_dw_pc~0)| 1))) (.cse6 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (let ((.cse10 (< |old(~c_dr_st~0)| 2)) (.cse25 (not (= 1 |old(~p_num_write~0)|))) (.cse8 (< |old(~q_write_ev~0)| 2)) (.cse23 (not (= |old(~q_free~0)| 0))) (.cse37 (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 .cse4 .cse6))) (.cse38 (< |old(~p_dw_st~0)| 2)) (.cse9 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse30 .cse31 (or (and .cse36 .cse33 .cse40 .cse46 .cse14 .cse35) (and .cse32 .cse33 .cse40 .cse46 .cse14 .cse35)))) (.cse34 (= ~q_free~0 |old(~q_free~0)|)) (.cse21 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse26 (not (= 0 |old(~c_num_read~0)|))) (.cse27 (not (= 0 |old(~c_dr_st~0)|))) (.cse11 (and .cse44 .cse29 .cse30 .cse31)) (.cse12 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_st~0 2)) (.cse15 (= ~c_dr_st~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse17 (= ~q_write_ev~0 2)) (.cse19 (= ~p_num_write~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse24 (not (= |old(~q_read_ev~0)| 2))) (.cse22 (not (= 2 |old(~q_write_ev~0)|))) (.cse7 (let ((.cse45 (+ ~c_num_read~0 1))) (and .cse44 (<= .cse45 ~p_num_write~0) .cse18 .cse29 .cse30 (<= ~p_num_write~0 .cse45)))) (.cse5 (not (= |old(~p_dw_st~0)| 0))) (.cse28 (not (= 0 |old(~c_dr_pc~0)|)))) (and (or (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6)) .cse7 .cse8 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse9 .cse10 (< |old(~c_num_read~0)| |old(~p_num_write~0)|) .cse11) (or .cse1 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse9 .cse11 .cse0 .cse22 (or .cse23 .cse24 .cse4 .cse25 (not (= |old(~p_dw_st~0)| 2)) .cse26 .cse27) .cse7 .cse28) (or .cse8 .cse10 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse29 .cse30 (= |old(~c_num_read~0)| ~c_num_read~0) .cse31 (or (and .cse32 .cse33 .cse34 .cse14 .cse35) (and .cse36 .cse33 .cse34 .cse14 .cse35))) .cse37 .cse38) (or .cse10 .cse25 .cse22 .cse37 (not (= 1 |old(~c_num_read~0)|)) .cse17 .cse38) (let ((.cse39 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse39) (< .cse39 |old(~p_num_write~0)|) .cse7 .cse8 .cse23 .cse9 .cse37 .cse38 .cse11)) (let ((.cse41 (= ~p_last_write~0 0)) (.cse42 (= ~q_buf_0~0 0)) (.cse43 (= 0 ~p_num_write~0))) (or .cse1 (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) .cse9 (and .cse33 .cse40 .cse34 .cse16 .cse17 .cse41 .cse36 .cse42 (= ~c_dr_st~0 2) .cse21 .cse43) .cse26 .cse6 .cse27 .cse11 (and .cse40 .cse15 .cse17 .cse20 .cse12 (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse16 .cse41 .cse36 (= ~a_t~0 0) .cse42 .cse43) (and .cse12 .cse13 .cse14 .cse15 .cse35 .cse16 .cse17 .cse18 .cse19 .cse20) (not (= 0 |old(~p_last_write~0)|)) .cse24 .cse22 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 (not (= 0 |old(~a_t~0)|)) .cse5 .cse28)))))) [2018-11-18 10:42:25,688 INFO L421 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse1 (< ~q_write_ev~0 2)) (.cse2 (< ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse9 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (not (= 1 ~c_dr_pc~0))) (.cse15 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (= 1 ~q_write_ev~0))) (.cse14 (not (= 0 ~c_num_read~0))) (.cse16 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (not (= ~q_free~0 1))) (.cse6 (not (= ~p_dw_pc~0 1))) (.cse8 (not (= ~p_dw_st~0 0))) (.cse13 (not (= 1 ~p_num_write~0))) (.cse17 (not (= 0 ~c_dr_pc~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse9 (< ~p_dw_st~0 2) .cse10) (or .cse3 .cse4 .cse5 .cse11 (< ~c_dr_st~0 2) (= is_do_read_c_triggered_~__retres1~1 1) .cse12 .cse13 .cse14 .cse15) (or .cse3 .cse4 (not (= ~q_read_ev~0 2)) .cse16 .cse15 .cse11 .cse12 .cse13 .cse14 .cse17 (not (= 0 ~c_dr_st~0))) (or .cse16 .cse4 .cse3 (not (= ~q_read_ev~0 1)) .cse7 .cse6 (not (= 2 ~q_write_ev~0)) .cse8 .cse13 (not (= 1 ~c_num_read~0)) .cse17 .cse10))) [2018-11-18 10:42:25,688 INFO L428 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2018-11-18 10:42:25,688 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2018-11-18 10:42:25,688 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2018-11-18 10:42:25,689 INFO L425 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2018-11-18 10:42:25,689 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2018-11-18 10:42:25,689 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2018-11-18 10:42:25,689 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~q_write_ev~0 2) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_pc~0 0) (= ~q_free~0 1) (= ~c_num_read~0 0) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= ~q_buf_0~0 0) (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_last_write~0)|)) (not (= 1 ~c_dr_i~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-11-18 10:42:25,689 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2018-11-18 10:42:25,689 INFO L425 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2018-11-18 10:42:25,689 INFO L421 ceAbstractionStarter]: At program point L317(line 317) the Hoare annotation is: (let ((.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse4 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~p_dw_pc~0))) (let ((.cse2 (<= 2 ~c_dr_st~0)) (.cse11 (= ~q_read_ev~0 2)) (.cse5 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse14 (= ~q_write_ev~0 2)) (.cse16 (= ~c_dr_pc~0 0)) (.cse9 (or (and .cse3 .cse4 .cse0 .cse6 .cse7) (and .cse8 .cse4 .cse0 .cse6 .cse7))) (.cse15 (= 0 ~q_free~0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0))) (or (not .cse0) (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 (or (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse4 .cse5 .cse6 .cse7))) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and .cse9 .cse10 .cse1 .cse2) (and .cse11 (= ~p_dw_st~0 2) .cse6 .cse12 .cse7 .cse13 .cse14 .cse15 (= ~p_num_write~0 1) .cse16) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse11 (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse5 .cse12 .cse13 .cse14 (= ~p_last_write~0 0) .cse3 (= ~a_t~0 0) (= ~q_buf_0~0 0) .cse16 (= 0 ~p_num_write~0)) (let ((.cse17 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse17 ~p_num_write~0) .cse15 .cse10 .cse1 (<= ~p_num_write~0 .cse17))) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_dr_pc~0)|))))) [2018-11-18 10:42:25,690 INFO L421 ceAbstractionStarter]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse4 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~p_dw_pc~0))) (let ((.cse2 (<= 2 ~c_dr_st~0)) (.cse9 (or (and .cse3 .cse4 .cse0 .cse6 .cse7) (and .cse8 .cse4 .cse0 .cse6 .cse7))) (.cse11 (= 0 ~q_free~0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0))) (or (not .cse0) (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 (let ((.cse5 (= ~p_dw_st~0 0))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse4 .cse5 .cse6 .cse7)))) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and .cse9 .cse10 .cse1 .cse2) (and (= ~q_read_ev~0 2) (= ~p_dw_st~0 2) .cse6 (= ~c_dr_st~0 0) .cse7 (= ~c_num_read~0 0) (= ~q_write_ev~0 2) .cse11 (= ~p_num_write~0 1) (= ~c_dr_pc~0 0)) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (let ((.cse12 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse12 ~p_num_write~0) .cse11 .cse10 .cse1 (<= ~p_num_write~0 .cse12))) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_dr_pc~0)|))))) [2018-11-18 10:42:25,690 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2018-11-18 10:42:25,690 INFO L425 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2018-11-18 10:42:25,690 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 325) no Hoare annotation was computed. [2018-11-18 10:42:25,690 INFO L421 ceAbstractionStarter]: At program point L313-2(lines 310 325) the Hoare annotation is: (let ((.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (not (= ~q_free~0 ~p_dw_pc~0))) (.cse4 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~p_dw_pc~0))) (let ((.cse2 (<= 2 ~c_dr_st~0)) (.cse11 (= ~q_read_ev~0 2)) (.cse5 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse14 (= ~q_write_ev~0 2)) (.cse16 (= ~c_dr_pc~0 0)) (.cse9 (or (and .cse3 .cse4 .cse0 .cse6 .cse7) (and .cse8 .cse4 .cse0 .cse6 .cse7))) (.cse15 (= 0 ~q_free~0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0))) (or (not .cse0) (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 (or (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse4 .cse5 .cse6 .cse7))) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and .cse9 .cse10 .cse1 .cse2) (and .cse11 (= ~p_dw_st~0 2) .cse6 .cse12 .cse7 .cse13 .cse14 .cse15 (= ~p_num_write~0 1) .cse16) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse11 (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse5 .cse12 .cse13 .cse14 (= ~p_last_write~0 0) .cse3 (= ~a_t~0 0) (= ~q_buf_0~0 0) .cse16 (= 0 ~p_num_write~0)) (let ((.cse17 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse17 ~p_num_write~0) .cse15 .cse10 .cse1 (<= ~p_num_write~0 .cse17))) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_dr_pc~0)|))))) [2018-11-18 10:42:25,690 INFO L421 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~q_write_ev~0 2) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_pc~0 0) (= ~q_free~0 1) (= ~c_num_read~0 0) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= ~q_buf_0~0 0) (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_last_write~0)|)) (not (= 1 ~c_dr_i~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-11-18 10:42:25,690 INFO L428 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2018-11-18 10:42:25,691 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:42:25,691 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~c_num_read~0 0) (= 0 ~q_free~0) (= ~p_dw_pc~0 0) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= ~p_dw_st~0 0) (= ~q_buf_0~0 0) (not (= ~p_dw_i~0 1)) (= ~c_dr_pc~0 0) (= ~c_dr_st~0 0) (= 0 ~p_num_write~0)) [2018-11-18 10:42:25,691 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:42:25,691 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:42:25,691 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-11-18 10:42:25,691 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2018-11-18 10:42:25,691 INFO L425 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2018-11-18 10:42:25,691 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2018-11-18 10:42:25,691 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2018-11-18 10:42:25,691 INFO L421 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse4 (not (= ~q_free~0 0))) (.cse5 (not (= 1 ~q_write_ev~0))) (.cse7 (not (= 0 ~c_num_read~0))) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= 0 ~c_dr_pc~0))) (.cse16 (= is_do_write_p_triggered_~__retres1~0 1)) (.cse2 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse9 (not (= 1 ~c_dr_pc~0))) (.cse10 (not (= ~q_read_ev~0 1))) (.cse11 (not (= ~p_dw_pc~0 1))) (.cse12 (not (= ~q_free~0 1))) (.cse14 (not (= 2 ~q_write_ev~0))) (.cse6 (not (= 1 ~p_num_write~0))) (.cse15 (not (= 1 ~c_num_read~0))) (.cse17 (< ~p_dw_st~0 2)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 (not (= ~q_read_ev~0 2)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ~c_dr_st~0))) (or .cse0 .cse1 .cse9 .cse4 .cse2 (< ~c_dr_st~0 2) .cse5 .cse6 .cse7 .cse3) (or (or .cse0 .cse1 .cse10 .cse11 .cse12 .cse13) .cse6 .cse14 .cse15 .cse16 .cse8 .cse17) (or (or .cse16 .cse2) .cse0 .cse1 .cse9 .cse10 .cse11 .cse12 .cse14 .cse6 .cse15 .cse17 .cse13))) [2018-11-18 10:42:25,692 INFO L428 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2018-11-18 10:42:25,692 INFO L425 ceAbstractionStarter]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2018-11-18 10:42:25,692 INFO L421 ceAbstractionStarter]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse13 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse14 (not (= ~p_dw_pc~0 1))) (.cse1 (not (= 2 ~q_write_ev~0))) (.cse5 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (= 0 |old(~c_dr_pc~0)|))) (.cse15 (< |old(~p_dw_st~0)| 2)) (.cse11 (= ~q_free~0 1)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0))) (and (or .cse0 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse1 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= 0 |old(~a_t~0)|)) (and .cse2 .cse3 (= ~q_free~0 |old(~q_free~0)|) (= ~c_num_read~0 0) .cse4 (= ~c_dr_st~0 2)) (not (= |old(~p_dw_st~0)| 0)) .cse5 .cse6 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse7 (+ |old(~c_num_read~0)| 1)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0))) (or (< ~p_num_write~0 .cse7) (< ~q_write_ev~0 2) .cse8 (< .cse7 ~p_num_write~0) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse2 .cse3) (or .cse13 .cse0 (not (= 1 |old(~c_dr_pc~0)|)) .cse14) .cse15 (and .cse9 .cse10 .cse11 (<= 2 ~p_dw_st~0) .cse12 .cse4 .cse2))) (or (not (= 0 (mod |old(~p_dw_st~0)| 2))) (or .cse13 .cse0 .cse8 .cse14) (not (= 1 ~p_num_write~0)) .cse1 .cse5 .cse6 .cse15 (and .cse11 .cse12 .cse2 .cse3 (= ~c_num_read~0 1) .cse4)))) [2018-11-18 10:42:25,692 INFO L425 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2018-11-18 10:42:25,692 INFO L421 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (let ((.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse6 (not (= 2 ~q_write_ev~0))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse8 (not (= 0 |old(~c_dr_pc~0)|))) (.cse5 (< |old(~p_dw_st~0)| 2))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) (< ~q_write_ev~0 2) .cse1 (< .cse0 ~p_num_write~0) (or .cse2 .cse3 (not (= 1 |old(~c_dr_pc~0)|)) .cse4) .cse5)) (or .cse3 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse6 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) .cse7 .cse8 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or (not (= 0 (mod |old(~p_dw_st~0)| 2))) (or .cse2 .cse3 .cse1 .cse4) (not (= 1 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse5))) [2018-11-18 10:42:25,693 INFO L421 ceAbstractionStarter]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse13 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse1 (not (= 2 ~q_write_ev~0))) (.cse12 (= ~q_free~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse14 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse15 (not (= ~p_dw_pc~0 1))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (not (= 0 |old(~c_dr_pc~0)|))) (.cse16 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse1 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) .cse2 (and (= ~q_read_ev~0 2) .cse3 (= ~q_free~0 |old(~q_free~0)|) .cse4 .cse5 (= ~a_t~0 0) .cse6) .cse7 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse8 (+ |old(~c_num_read~0)| 1)) (.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0))) (or (< ~p_num_write~0 .cse8) (< ~q_write_ev~0 2) .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse5) (< .cse8 ~p_num_write~0) (and .cse10 .cse11 .cse12 .cse5 .cse3) (or .cse14 .cse0 (not (= 1 |old(~c_dr_pc~0)|)) .cse15) .cse16)) (or (and .cse13 (= (mod ~p_dw_st~0 2) 0) .cse4 (= 0 ~q_free~0) .cse6) .cse1 (and .cse12 .cse3 (= ~c_num_read~0 1) .cse5 .cse6) (not (= 0 (mod |old(~p_dw_st~0)| 2))) (or .cse14 .cse0 .cse9 .cse15) (not (= 1 ~p_num_write~0)) .cse2 .cse7 .cse16))) [2018-11-18 10:42:25,693 INFO L421 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse10 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 1)))) (let ((.cse2 (or .cse10 .cse8 (not (= 1 |old(~c_dr_pc~0)|)) (= ~p_dw_pc~0 |old(~q_free~0)|) .cse11)) (.cse4 (not (= 0 (mod |old(~p_dw_st~0)| 2)))) (.cse1 (not (= |old(~q_free~0)| 0))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse6 (not (= 2 ~q_write_ev~0))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse9 (not (= 0 |old(~c_dr_pc~0)|))) (.cse3 (< |old(~p_dw_st~0)| 2))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (and (<= 2 ~p_dw_st~0) (= |old(~c_num_read~0)| ~c_num_read~0) (and (= ~c_dr_pc~0 1) (= ~q_free~0 |old(~q_free~0)|))) (< ~p_num_write~0 .cse0) (< ~q_write_ev~0 2) .cse1 (< .cse0 ~p_num_write~0) .cse2 .cse3)) (or (= (mod ~p_dw_st~0 2) 0) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse3) (or .cse8 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse6 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) .cse7 .cse9 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse4 (or .cse10 .cse8 .cse1 .cse11) .cse5 .cse6 .cse7 .cse9 .cse3)))) [2018-11-18 10:42:25,693 INFO L425 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2018-11-18 10:42:25,693 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2018-11-18 10:42:25,693 INFO L421 ceAbstractionStarter]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse15 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~p_dw_pc~0 1)))) (let ((.cse3 (= ~q_free~0 |old(~q_free~0)|)) (.cse10 (or .cse15 .cse0 (not (= 1 |old(~c_dr_pc~0)|)) (= ~p_dw_pc~0 |old(~q_free~0)|) .cse16)) (.cse12 (not (= 0 (mod |old(~p_dw_st~0)| 2)))) (.cse9 (<= 2 ~p_dw_st~0)) (.cse14 (= (mod ~p_dw_st~0 2) 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse13 (not (= 1 ~p_num_write~0))) (.cse1 (not (= 2 ~q_write_ev~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (= 0 |old(~c_dr_pc~0)|))) (.cse11 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse1 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) .cse2 (and (= ~q_read_ev~0 2) (= ~p_dw_st~0 0) .cse3 .cse4 (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) .cse5) .cse6 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse7 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse7) (< ~q_write_ev~0 2) .cse8 (< .cse7 ~p_num_write~0) (and .cse9 (= |old(~c_num_read~0)| ~c_num_read~0) (and (= ~c_dr_pc~0 1) .cse3)) .cse10 .cse11)) (or .cse8 .cse10 .cse12 .cse13 .cse1 .cse2 .cse14 .cse11) (or .cse12 (and .cse9 .cse14 .cse4 (= 0 ~q_free~0) .cse5) (or .cse15 .cse0 .cse8 .cse16) .cse13 .cse1 .cse2 .cse6 .cse11)))) [2018-11-18 10:42:25,693 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2018-11-18 10:42:25,693 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 185) no Hoare annotation was computed. [2018-11-18 10:42:25,694 INFO L421 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (let ((.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse6 (not (= 2 ~q_write_ev~0))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse8 (not (= 0 |old(~c_dr_pc~0)|))) (.cse5 (< |old(~p_dw_st~0)| 2))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) (< ~q_write_ev~0 2) .cse1 (< .cse0 ~p_num_write~0) (or .cse2 .cse3 (not (= 1 |old(~c_dr_pc~0)|)) .cse4) .cse5)) (or .cse3 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse6 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) .cse7 .cse8 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or (not (= 0 (mod |old(~p_dw_st~0)| 2))) (or .cse2 .cse3 .cse1 .cse4) (not (= 1 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse5))) [2018-11-18 10:42:25,694 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2018-11-18 10:42:25,694 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2018-11-18 10:42:25,694 INFO L421 ceAbstractionStarter]: At program point L169(line 169) the Hoare annotation is: (let ((.cse14 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~p_dw_pc~0 1)))) (let ((.cse1 (or .cse14 .cse12 (not (= 1 |old(~c_dr_pc~0)|)) (= ~p_dw_pc~0 |old(~q_free~0)|) .cse15)) (.cse3 (not (= 0 (mod |old(~p_dw_st~0)| 2)))) (.cse0 (not (= |old(~q_free~0)| 0))) (.cse9 (= ~q_free~0 1)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= ~q_read_ev~0 1)) (.cse4 (not (= 1 ~p_num_write~0))) (.cse5 (not (= 2 ~q_write_ev~0))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse13 (not (= 0 |old(~c_dr_pc~0)|))) (.cse7 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse8) (< ~q_write_ev~0 2) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse9 .cse10 .cse11 (= ~c_dr_pc~0 1)) .cse0 (< .cse8 ~p_num_write~0) .cse1 .cse7)) (or .cse12 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse5 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= 0 |old(~a_t~0)|)) (not (= |old(~p_dw_st~0)| 0)) .cse6 .cse13 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse3 (or .cse14 .cse12 .cse0 .cse15) (and .cse9 .cse10 (= ~c_num_read~0 1) .cse11 (= ~c_dr_pc~0 0) .cse2) .cse4 .cse5 .cse6 .cse13 .cse7)))) [2018-11-18 10:42:25,694 INFO L425 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-11-18 10:42:25,694 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2018-11-18 10:42:25,694 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2018-11-18 10:42:25,694 INFO L421 ceAbstractionStarter]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= 0 ~p_last_write~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 ~a_t~0)) (and (not (= ~p_dw_i~0 1)) (= ~c_num_read~0 0) (= 0 ~q_free~0) (= ~c_dr_pc~0 0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= |old(~q_free~0)| 0)) (not (= ~p_dw_st~0 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= 0 ~c_dr_st~0))) [2018-11-18 10:42:25,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:42:25 BoogieIcfgContainer [2018-11-18 10:42:25,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:42:25,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:42:25,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:42:25,742 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:42:25,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:41:46" (3/4) ... [2018-11-18 10:42:25,746 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-18 10:42:25,751 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-18 10:42:25,752 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-18 10:42:25,752 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-18 10:42:25,752 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-18 10:42:25,757 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-18 10:42:25,757 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 10:42:25,781 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(p_dw_i == 1) || !(\old(q_free) == 1)) || !(1 == c_dr_i)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && (((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1) && c_dr_pc == 0)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || ((((((((((((q_read_ev == 2 && p_dw_pc == 0) && q_free == 1) && p_dw_st == 0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 2) && p_last_write == 0) && c_last_read == p_last_write) && a_t == 0) && q_buf_0 == 0) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || !(0 == \old(a_t))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc)) [2018-11-18 10:42:25,781 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) && (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || \old(c_dr_st) < 2) || \old(c_num_read) < \old(p_num_write)) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) && ((((((((!(p_dw_i == 1) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1) && c_dr_pc == 0) && \old(p_dw_pc) == p_dw_pc)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(q_write_ev))) || (((((!(\old(q_free) == 0) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_pc) == 1)) || !(1 == \old(p_num_write))) || !(\old(p_dw_st) == 2)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_st))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || !(0 == \old(c_dr_pc)))) && ((((\old(q_write_ev) < 2 || \old(c_dr_st) < 2) || (((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && q_free == \old(q_free)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && c_dr_pc == 1) && q_free == \old(q_free)) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || \old(p_dw_st) < 2)) && ((((((\old(c_dr_st) < 2 || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || !(1 == \old(c_num_read))) || q_write_ev == 2) || \old(p_dw_st) < 2)) && ((((((((\old(p_num_write) < \old(c_num_read) + 1 || \old(c_num_read) + 1 < \old(p_num_write)) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_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)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || \old(p_dw_st) < 2) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st))) && ((((((((((((((((((((!(p_dw_i == 1) || !(\old(q_free) == 1)) || !(1 == c_dr_i)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || ((((((((((c_dr_pc == 1 && p_dw_st == 0) && q_free == \old(q_free)) && c_num_read == 0) && q_write_ev == 2) && p_last_write == 0) && c_last_read == p_last_write) && q_buf_0 == 0) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) || ((((((((((((p_dw_st == 0 && c_dr_st == 0) && q_write_ev == 2) && c_dr_pc == 0) && q_read_ev == 2) && p_dw_pc == 0) && q_free == 1) && c_num_read == 0) && p_last_write == 0) && c_last_read == p_last_write) && a_t == 0) && q_buf_0 == 0) && 0 == p_num_write)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1) && c_dr_pc == 0)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || !(0 == \old(a_t))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc))) [2018-11-18 10:42:25,781 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) && (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || \old(c_dr_st) < 2) || \old(c_num_read) < \old(p_num_write)) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) && ((((((((!(p_dw_i == 1) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1) && c_dr_pc == 0) && \old(p_dw_pc) == p_dw_pc)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(q_write_ev))) || (((((!(\old(q_free) == 0) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_pc) == 1)) || !(1 == \old(p_num_write))) || !(\old(p_dw_st) == 2)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_st))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || !(0 == \old(c_dr_pc)))) && ((((\old(q_write_ev) < 2 || \old(c_dr_st) < 2) || (((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && q_free == \old(q_free)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && c_dr_pc == 1) && q_free == \old(q_free)) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || \old(p_dw_st) < 2)) && ((((((((((((((((((!(p_dw_i == 1) || !(\old(q_free) == 1)) || !(1 == c_dr_i)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1) && c_dr_pc == 0)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || !(0 == \old(a_t))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc)))) && ((((((\old(c_dr_st) < 2 || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || !(1 == \old(c_num_read))) || q_write_ev == 2) || \old(p_dw_st) < 2)) && ((((((((\old(p_num_write) < \old(c_num_read) + 1 || \old(c_num_read) + 1 < \old(p_num_write)) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_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)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || \old(p_dw_st) < 2) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) [2018-11-18 10:42:25,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(p_dw_i == 1) || !(c_last_read == \old(p_last_write))) || ((!(1 == c_dr_pc) || !(2 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || !(0 == \old(q_buf_0))) || ((((q_free == 1 && q_write_ev == 2) && (p_dw_pc == 0 && q_buf_0 == 0) && c_dr_st == 2) && c_last_read == p_last_write) && 0 == p_num_write)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || (1 == p_num_write && (((((q_free == 0 && q_write_ev == 2) && p_dw_pc == 0) && p_last_write == q_buf_0) && c_dr_st == 0) || ((((q_free == 0 && q_write_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)))) || !(\old(q_free) == 1) || !(0 == c_num_read)) && ((((\old(q_write_ev) < 2 || (\old(p_num_write) < c_num_read || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1) || !(\old(p_dw_pc) == 1)) || !(1 == c_dr_pc)) || c_num_read < \old(p_num_write)) || ((((0 == q_free && 2 <= q_write_ev) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_dr_st) < 2) || (((((0 == q_free && 2 <= q_write_ev) && 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))) && (((((((((((((((!(p_dw_i == 1) || (((((p_dw_pc == 0 && p_last_write == q_buf_0) && c_dr_st == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1)) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(0 == a_t)) || ((((((q_free == 1 && p_dw_pc == 0) && c_dr_st == 0) && q_write_ev == 2) && c_last_read == p_last_write) && q_buf_0 == 0) && 0 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) [2018-11-18 10:42:25,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(q_write_ev) < 2 || (\old(p_num_write) < c_num_read || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1) || !(\old(p_dw_pc) == 1)) || !(1 == c_dr_pc)) || c_num_read < \old(p_num_write)) || (((((!(q_free == p_dw_pc) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && 0 == q_free) && p_num_write <= c_num_read + 1)) || \old(c_dr_st) < 2) && ((((((((((((((!(p_dw_i == 1) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(0 == a_t)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || ((((((p_dw_st == 2 && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st)))) && (((((((!(p_dw_i == 1) || !(c_last_read == \old(p_last_write))) || ((!(1 == c_dr_pc) || !(2 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || !(0 == \old(q_buf_0))) || (((((((2 <= p_dw_st && p_dw_st % 2 == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && q_write_ev == 2) && 0 == q_free) && 1 == p_num_write)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(\old(q_free) == 1) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) [2018-11-18 10:42:25,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_i == 1) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(0 == a_t)) || (((((p_dw_pc == 0 && q_free == 1) && p_last_write == q_buf_0) && c_dr_st == 0) && q_write_ev == 2) && 0 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) && (((((((!(p_dw_i == 1) || !(c_last_read == \old(p_last_write))) || ((!(1 == c_dr_pc) || !(2 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || !(0 == \old(q_buf_0))) || ((((((c_dr_st % 2 == 0 && p_dw_pc == 0) && q_free == 1) && 2 <= c_dr_st) && p_last_write == q_buf_0) && q_write_ev == 2) && 0 == p_num_write)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(\old(q_free) == 1) || !(0 == c_num_read)) || !(0 == \old(p_num_write)))) && (((\old(q_write_ev) < 2 || (\old(p_num_write) < c_num_read || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1) || !(\old(p_dw_pc) == 1)) || !(1 == c_dr_pc)) || c_num_read < \old(p_num_write)) || \old(c_dr_st) < 2) || ((2 <= q_write_ev && 2 <= c_dr_st) && p_num_write == \old(p_num_write) && p_last_write == q_buf_0 && 1 == p_dw_pc)) [2018-11-18 10:42:25,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || !(0 == \old(a_t))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || ((((((q_read_ev == 2 && p_dw_st == 0) && q_free == \old(q_free)) && c_num_read == 0) && c_last_read == p_last_write) && a_t == 0) && c_dr_pc == 0)) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write)) && (((((((p_num_write < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_free) == 0)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write)) || \old(c_num_read) + 1 < p_num_write) || ((((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)) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || \old(p_dw_st) < 2)) && ((((((((((((2 <= p_dw_st && p_dw_st % 2 == 0) && c_num_read == 0) && 0 == q_free) && c_dr_pc == 0) || !(2 == q_write_ev)) || ((((q_free == 1 && p_dw_st == 0) && c_num_read == 1) && c_last_read == p_last_write) && c_dr_pc == 0)) || !(0 == \old(p_dw_st) % 2)) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || \old(p_dw_st) < 2) [2018-11-18 10:42:25,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || !(0 == \old(a_t))) || (((((c_dr_pc == 1 && p_dw_st == 0) && q_free == \old(q_free)) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_st == 2)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write)) && (((((((p_num_write < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && c_dr_pc == 1) && p_dw_st == 0)) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(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) && 2 <= c_dr_st) && c_last_read == p_last_write) && c_dr_pc == 1))) && (((((((!(0 == \old(p_dw_st) % 2) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(2 == q_write_ev)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || \old(p_dw_st) < 2) || (((((q_free == 1 && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_st == 0) && c_num_read == 1) && c_last_read == p_last_write)) [2018-11-18 10:42:25,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 <= p_dw_st && \old(c_num_read) == c_num_read) && c_dr_pc == 1 && q_free == \old(q_free)) || p_num_write < \old(c_num_read) + 1) || q_write_ev < 2) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == \old(q_free)) || !(p_dw_pc == 1)) || \old(p_dw_st) < 2) && (((((((p_dw_st % 2 == 0 || !(\old(q_free) == 0)) || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == \old(q_free)) || !(p_dw_pc == 1)) || !(0 == \old(p_dw_st) % 2)) || !(1 == p_num_write)) || !(2 == q_write_ev)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && (((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || !(0 == \old(a_t))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write))) && ((((((!(0 == \old(p_dw_st) % 2) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(2 == q_write_ev)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || \old(p_dw_st) < 2) [2018-11-18 10:42:25,812 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4856c691-78bf-47a3-ade6-61b4588e2eb2/bin-2019/utaipan/witness.graphml [2018-11-18 10:42:25,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:42:25,813 INFO L168 Benchmark]: Toolchain (without parser) took 39450.18 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 958.1 MB in the beginning and 1.3 GB in the end (delta: -331.1 MB). Peak memory consumption was 961.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:42:25,814 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:42:25,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.60 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:42:25,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.10 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 942.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:42:25,814 INFO L168 Benchmark]: Boogie Preprocessor took 57.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -239.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:42:25,815 INFO L168 Benchmark]: RCFGBuilder took 284.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:42:25,815 INFO L168 Benchmark]: TraceAbstraction took 38822.65 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -136.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-18 10:42:25,815 INFO L168 Benchmark]: Witness Printer took 70.78 ms. Allocated memory is still 2.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-18 10:42:25,817 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.60 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.10 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 942.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -239.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 284.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38822.65 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -136.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 70.78 ms. Allocated memory is still 2.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) && (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || \old(c_dr_st) < 2) || \old(c_num_read) < \old(p_num_write)) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) && ((((((((!(p_dw_i == 1) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1) && c_dr_pc == 0) && \old(p_dw_pc) == p_dw_pc)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(q_write_ev))) || (((((!(\old(q_free) == 0) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_pc) == 1)) || !(1 == \old(p_num_write))) || !(\old(p_dw_st) == 2)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_st))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || !(0 == \old(c_dr_pc)))) && ((((\old(q_write_ev) < 2 || \old(c_dr_st) < 2) || (((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && q_free == \old(q_free)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && c_dr_pc == 1) && q_free == \old(q_free)) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || \old(p_dw_st) < 2)) && ((((((((((((((((((!(p_dw_i == 1) || !(\old(q_free) == 1)) || !(1 == c_dr_i)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1) && c_dr_pc == 0)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || !(0 == \old(a_t))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc)))) && ((((((\old(c_dr_st) < 2 || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || !(1 == \old(c_num_read))) || q_write_ev == 2) || \old(p_dw_st) < 2)) && ((((((((\old(p_num_write) < \old(c_num_read) + 1 || \old(c_num_read) + 1 < \old(p_num_write)) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_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)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || \old(p_dw_st) < 2) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((!(p_dw_i == 1) || !(c_last_read == \old(p_last_write))) || ((!(1 == c_dr_pc) || !(2 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || !(0 == \old(q_buf_0))) || ((((q_free == 1 && q_write_ev == 2) && (p_dw_pc == 0 && q_buf_0 == 0) && c_dr_st == 2) && c_last_read == p_last_write) && 0 == p_num_write)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || (1 == p_num_write && (((((q_free == 0 && q_write_ev == 2) && p_dw_pc == 0) && p_last_write == q_buf_0) && c_dr_st == 0) || ((((q_free == 0 && q_write_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)))) || !(\old(q_free) == 1) || !(0 == c_num_read)) && ((((\old(q_write_ev) < 2 || (\old(p_num_write) < c_num_read || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1) || !(\old(p_dw_pc) == 1)) || !(1 == c_dr_pc)) || c_num_read < \old(p_num_write)) || ((((0 == q_free && 2 <= q_write_ev) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_dr_st) < 2) || (((((0 == q_free && 2 <= q_write_ev) && 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))) && (((((((((((((((!(p_dw_i == 1) || (((((p_dw_pc == 0 && p_last_write == q_buf_0) && c_dr_st == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1)) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(0 == a_t)) || ((((((q_free == 1 && p_dw_pc == 0) && c_dr_st == 0) && q_write_ev == 2) && c_last_read == p_last_write) && q_buf_0 == 0) && 0 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((2 <= p_dw_st && \old(c_num_read) == c_num_read) && c_dr_pc == 1 && q_free == \old(q_free)) || p_num_write < \old(c_num_read) + 1) || q_write_ev < 2) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == \old(q_free)) || !(p_dw_pc == 1)) || \old(p_dw_st) < 2) && (((((((p_dw_st % 2 == 0 || !(\old(q_free) == 0)) || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == \old(q_free)) || !(p_dw_pc == 1)) || !(0 == \old(p_dw_st) % 2)) || !(1 == p_num_write)) || !(2 == q_write_ev)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && (((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || !(0 == \old(a_t))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write))) && ((((((!(0 == \old(p_dw_st) % 2) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(2 == q_write_ev)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || \old(p_dw_st) < 2) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || !(0 == \old(a_t))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || ((((((q_read_ev == 2 && p_dw_st == 0) && q_free == \old(q_free)) && c_num_read == 0) && c_last_read == p_last_write) && a_t == 0) && c_dr_pc == 0)) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write)) && (((((((p_num_write < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_free) == 0)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write)) || \old(c_num_read) + 1 < p_num_write) || ((((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)) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || \old(p_dw_st) < 2)) && ((((((((((((2 <= p_dw_st && p_dw_st % 2 == 0) && c_num_read == 0) && 0 == q_free) && c_dr_pc == 0) || !(2 == q_write_ev)) || ((((q_free == 1 && p_dw_st == 0) && c_num_read == 1) && c_last_read == p_last_write) && c_dr_pc == 0)) || !(0 == \old(p_dw_st) % 2)) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || \old(p_dw_st) < 2) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || __retres1 == 0) || !(p_dw_pc == 0)) || !(q_free == 0)) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(0 == c_dr_st)) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_free == 0)) || __retres1 == 0) || c_dr_st < 2) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(p_dw_pc == 0))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_read_ev == 1)) || !(p_dw_pc == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == p_num_write)) || !(2 == q_write_ev)) || !(1 == c_num_read)) || __retres1 == 1) || !(0 == c_dr_pc)) || p_dw_st < 2)) && ((((((((((((__retres1 == 1 || __retres1 == 0) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 1)) || !(p_dw_pc == 1)) || !(q_free == 1)) || !(2 == q_write_ev)) || !(1 == p_num_write)) || !(1 == c_num_read)) || p_dw_st < 2) || !(c_last_read == p_last_write)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_dw_i == 1) || !(\old(q_free) == 1)) || !(1 == c_dr_i)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && (((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1) && c_dr_pc == 0)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || ((((((((((((q_read_ev == 2 && p_dw_pc == 0) && q_free == 1) && p_dw_st == 0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 2) && p_last_write == 0) && c_last_read == p_last_write) && a_t == 0) && q_buf_0 == 0) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || !(0 == \old(a_t))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) && (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || \old(c_dr_st) < 2) || \old(c_num_read) < \old(p_num_write)) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) && ((((((((!(p_dw_i == 1) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1) && c_dr_pc == 0) && \old(p_dw_pc) == p_dw_pc)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(q_write_ev))) || (((((!(\old(q_free) == 0) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_pc) == 1)) || !(1 == \old(p_num_write))) || !(\old(p_dw_st) == 2)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_st))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || !(0 == \old(c_dr_pc)))) && ((((\old(q_write_ev) < 2 || \old(c_dr_st) < 2) || (((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && q_free == \old(q_free)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((c_last_read == p_last_write && c_dr_pc == 1) && q_free == \old(q_free)) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || \old(p_dw_st) < 2)) && ((((((\old(c_dr_st) < 2 || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || !(1 == \old(c_num_read))) || q_write_ev == 2) || \old(p_dw_st) < 2)) && ((((((((\old(p_num_write) < \old(c_num_read) + 1 || \old(c_num_read) + 1 < \old(p_num_write)) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_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)) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_pc) == 1)) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_last_read) == \old(p_last_write))))) || \old(p_dw_st) < 2) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st))) && ((((((((((((((((((((!(p_dw_i == 1) || !(\old(q_free) == 1)) || !(1 == c_dr_i)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && ((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)))) || ((((((((((c_dr_pc == 1 && p_dw_st == 0) && q_free == \old(q_free)) && c_num_read == 0) && q_write_ev == 2) && p_last_write == 0) && c_last_read == p_last_write) && q_buf_0 == 0) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || ((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st)) || ((((((((((((p_dw_st == 0 && c_dr_st == 0) && q_write_ev == 2) && c_dr_pc == 0) && q_read_ev == 2) && p_dw_pc == 0) && q_free == 1) && c_num_read == 0) && p_last_write == 0) && c_last_read == p_last_write) && a_t == 0) && q_buf_0 == 0) && 0 == p_num_write)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1) && c_dr_pc == 0)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || ((((((((((c_last_read == p_last_write && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((((!(q_free == p_dw_pc) && c_dr_pc == 1) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1)) || !(0 == \old(a_t))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc))) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((\old(q_write_ev) < 2 || (\old(p_num_write) < c_num_read || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1) || !(\old(p_dw_pc) == 1)) || !(1 == c_dr_pc)) || c_num_read < \old(p_num_write)) || (((((!(q_free == p_dw_pc) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && 0 == q_free) && p_num_write <= c_num_read + 1)) || \old(c_dr_st) < 2) && ((((((((((((((!(p_dw_i == 1) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(0 == a_t)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || ((((((p_dw_st == 2 && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && q_write_ev == 2) && 0 == q_free) && p_num_write == 1)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st)))) && (((((((!(p_dw_i == 1) || !(c_last_read == \old(p_last_write))) || ((!(1 == c_dr_pc) || !(2 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || !(0 == \old(q_buf_0))) || (((((((2 <= p_dw_st && p_dw_st % 2 == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && q_write_ev == 2) && 0 == q_free) && 1 == p_num_write)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(\old(q_free) == 1) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((((((0 == __retres1 || q_write_ev < 2) || p_num_write < c_num_read) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(p_dw_pc == 1)) || !(q_free == 1)) || !(p_dw_st == 0)) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) && ((((((((((q_write_ev < 2 || p_num_write < c_num_read) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 0 == __retres1) || !(p_dw_pc == 1)) || !(q_free == 1)) || c_num_read < p_num_write) || p_dw_st < 2) || !(c_last_read == p_last_write))) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_free == 0)) || c_dr_st < 2) || __retres1 == 1) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(p_dw_pc == 0))) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || __retres1 == 0) || !(p_dw_pc == 0)) || !(q_free == 0)) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(0 == c_dr_st))) && (((((((((((__retres1 == 0 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 1)) || !(q_free == 1)) || !(p_dw_pc == 1)) || !(2 == q_write_ev)) || !(p_dw_st == 0)) || !(1 == p_num_write)) || !(1 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || !(0 == \old(a_t))) || (((((c_dr_pc == 1 && p_dw_st == 0) && q_free == \old(q_free)) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_st == 2)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write)) && (((((((p_num_write < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && c_dr_pc == 1) && p_dw_st == 0)) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(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) && 2 <= c_dr_st) && c_last_read == p_last_write) && c_dr_pc == 1))) && (((((((!(0 == \old(p_dw_st) % 2) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(2 == q_write_ev)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || \old(p_dw_st) < 2) || (((((q_free == 1 && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_st == 0) && c_num_read == 1) && c_last_read == p_last_write)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_i == 1) || !(q_read_ev == 2)) || !(q_free == 1)) || !(2 == q_write_ev)) || !(0 == p_last_write)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || !(0 == a_t)) || __retres1 == 1) || !(p_dw_st == 0)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == p_last_write)) || !(0 == c_dr_st)) && ((((!(p_dw_i == 1) || __retres1 == 1) || !(2 == q_write_ev)) || (((((((!(1 == c_dr_pc) || !(2 == c_dr_st)) || !(0 == p_last_write)) || !(q_free == 1)) || !(p_dw_st == 0)) || !(0 == c_num_read)) || !(0 == q_buf_0)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_i == 1) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(0 == a_t)) || (((((p_dw_pc == 0 && q_free == 1) && p_last_write == q_buf_0) && c_dr_st == 0) && q_write_ev == 2) && 0 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) && (((((((!(p_dw_i == 1) || !(c_last_read == \old(p_last_write))) || ((!(1 == c_dr_pc) || !(2 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || !(0 == \old(q_buf_0))) || ((((((c_dr_st % 2 == 0 && p_dw_pc == 0) && q_free == 1) && 2 <= c_dr_st) && p_last_write == q_buf_0) && q_write_ev == 2) && 0 == p_num_write)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(\old(q_free) == 1) || !(0 == c_num_read)) || !(0 == \old(p_num_write)))) && (((\old(q_write_ev) < 2 || (\old(p_num_write) < c_num_read || (!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1) || !(\old(p_dw_pc) == 1)) || !(1 == c_dr_pc)) || c_num_read < \old(p_num_write)) || \old(c_dr_st) < 2) || ((2 <= q_write_ev && 2 <= c_dr_st) && p_num_write == \old(p_num_write) && p_last_write == q_buf_0 && 1 == p_dw_pc)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 111 locations, 1 error locations. SAFE Result, 38.7s OverallTime, 19 OverallIterations, 5 TraceHistogramMax, 19.8s AutomataDifference, 0.0s DeadEndRemovalTime, 11.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 3406 SDtfs, 4947 SDslu, 15102 SDs, 0 SdLazy, 10819 SolverSat, 1538 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2527 GetRequests, 2107 SyntacticMatches, 20 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9455 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2071occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 9 AbstIntIterations, 4 AbstIntStrong, 0.9781213347354439 AbsIntWeakeningRatio, 0.7618025751072961 AbsIntAvgWeakeningVarsNumRemoved, 14.946351931330472 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 749 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 5582 PreInvPairs, 6117 NumberOfFragments, 10578 HoareAnnotationTreeSize, 5582 FomulaSimplifications, 80426 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 66386 FormulaSimplificationTreeSizeReductionInter, 10.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2989 NumberOfCodeBlocks, 2989 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3845 ConstructedInterpolants, 0 QuantifiedInterpolants, 1036465 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4255 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 2095/2283 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...