./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/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 d321e3b1b642bcfc9c94c4888bd187898cb1af58 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:49:23,764 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:49:23,765 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:49:23,771 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:49:23,771 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:49:23,772 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:49:23,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:49:23,773 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:49:23,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:49:23,774 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:49:23,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:49:23,775 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:49:23,775 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:49:23,776 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:49:23,776 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:49:23,777 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:49:23,777 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:49:23,778 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:49:23,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:49:23,780 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:49:23,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:49:23,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:49:23,782 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:49:23,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:49:23,782 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:49:23,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:49:23,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:49:23,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:49:23,784 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:49:23,785 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:49:23,785 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:49:23,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:49:23,785 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:49:23,785 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:49:23,786 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:49:23,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:49:23,786 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 01:49:23,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:49:23,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:49:23,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:49:23,795 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:49:23,795 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:49:23,795 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:49:23,795 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:49:23,795 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 01:49:23,795 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:49:23,795 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:49:23,795 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 01:49:23,795 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 01:49:23,795 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:49:23,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:49:23,796 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:49:23,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:49:23,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:49:23,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:49:23,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:49:23,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:49:23,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:49:23,797 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:49:23,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:49:23,797 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:49:23,797 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:49:23,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:49:23,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:49:23,797 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:49:23,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:49:23,797 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:49:23,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:49:23,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:49:23,798 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 01:49:23,798 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:49:23,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:49:23,798 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 01:49:23,798 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_f5ad106c-fb32-48ea-8be6-da9930a41a85/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 -> d321e3b1b642bcfc9c94c4888bd187898cb1af58 [2018-12-03 01:49:23,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:49:23,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:49:23,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:49:23,829 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:49:23,829 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:49:23,829 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-03 01:49:23,873 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/data/4e3c7f790/c08c8cad6a024033bb90e75fb6adfbdb/FLAG9431c9af1 [2018-12-03 01:49:24,248 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:49:24,248 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-03 01:49:24,253 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/data/4e3c7f790/c08c8cad6a024033bb90e75fb6adfbdb/FLAG9431c9af1 [2018-12-03 01:49:24,622 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/data/4e3c7f790/c08c8cad6a024033bb90e75fb6adfbdb [2018-12-03 01:49:24,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:49:24,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:49:24,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:49:24,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:49:24,628 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:49:24,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643265e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24, skipping insertion in model container [2018-12-03 01:49:24,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:49:24,653 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:49:24,766 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:49:24,769 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:49:24,790 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:49:24,799 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:49:24,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24 WrapperNode [2018-12-03 01:49:24,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:49:24,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:49:24,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:49:24,800 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:49:24,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:49:24,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:49:24,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:49:24,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:49:24,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (1/1) ... [2018-12-03 01:49:24,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:49:24,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:49:24,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:49:24,868 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:49:24,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/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-12-03 01:49:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-03 01:49:24,899 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-03 01:49:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-03 01:49:24,899 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-03 01:49:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-12-03 01:49:24,899 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-12-03 01:49:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-03 01:49:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-03 01:49:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-03 01:49:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-03 01:49:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 01:49:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 01:49:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-12-03 01:49:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-12-03 01:49:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-03 01:49:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-03 01:49:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 01:49:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 01:49:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-03 01:49:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-03 01:49:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-03 01:49:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-03 01:49:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-12-03 01:49:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-12-03 01:49:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-03 01:49:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-03 01:49:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-03 01:49:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-03 01:49:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-03 01:49:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-03 01:49:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:49:24,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:49:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-12-03 01:49:24,902 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-12-03 01:49:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-12-03 01:49:24,902 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-12-03 01:49:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-03 01:49:24,902 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-03 01:49:25,113 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:49:25,114 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-03 01:49:25,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:49:25 BoogieIcfgContainer [2018-12-03 01:49:25,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:49:25,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:49:25,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:49:25,116 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:49:25,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:49:24" (1/3) ... [2018-12-03 01:49:25,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba8be01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:49:25, skipping insertion in model container [2018-12-03 01:49:25,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:49:24" (2/3) ... [2018-12-03 01:49:25,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba8be01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:49:25, skipping insertion in model container [2018-12-03 01:49:25,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:49:25" (3/3) ... [2018-12-03 01:49:25,118 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-03 01:49:25,124 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:49:25,129 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 01:49:25,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 01:49:25,157 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:49:25,157 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 01:49:25,157 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:49:25,158 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:49:25,158 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:49:25,158 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:49:25,158 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:49:25,158 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:49:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-12-03 01:49:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 01:49:25,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:25,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:25,177 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:25,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:25,180 INFO L82 PathProgramCache]: Analyzing trace with hash 11439179, now seen corresponding path program 1 times [2018-12-03 01:49:25,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:25,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:25,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:25,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:25,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:25,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:25,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:49:25,338 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:25,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:49:25,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:49:25,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:49:25,350 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 5 states. [2018-12-03 01:49:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:25,685 INFO L93 Difference]: Finished difference Result 379 states and 545 transitions. [2018-12-03 01:49:25,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:49:25,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-03 01:49:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:25,694 INFO L225 Difference]: With dead ends: 379 [2018-12-03 01:49:25,694 INFO L226 Difference]: Without dead ends: 252 [2018-12-03 01:49:25,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-12-03 01:49:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2018-12-03 01:49:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-03 01:49:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2018-12-03 01:49:25,744 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2018-12-03 01:49:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:25,744 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2018-12-03 01:49:25,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:49:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2018-12-03 01:49:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 01:49:25,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:25,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:25,747 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:25,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1438317323, now seen corresponding path program 1 times [2018-12-03 01:49:25,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:25,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:25,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:25,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:25,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:25,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:25,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:49:25,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:25,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:49:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:49:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:25,817 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2018-12-03 01:49:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:26,259 INFO L93 Difference]: Finished difference Result 628 states and 843 transitions. [2018-12-03 01:49:26,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:49:26,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-03 01:49:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:26,262 INFO L225 Difference]: With dead ends: 628 [2018-12-03 01:49:26,262 INFO L226 Difference]: Without dead ends: 422 [2018-12-03 01:49:26,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:49:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-12-03 01:49:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2018-12-03 01:49:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-03 01:49:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-12-03 01:49:26,301 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2018-12-03 01:49:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:26,301 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-12-03 01:49:26,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:49:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-12-03 01:49:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 01:49:26,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:26,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:26,305 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:26,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1469864563, now seen corresponding path program 1 times [2018-12-03 01:49:26,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:26,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:26,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:26,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:26,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:49:26,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:26,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:49:26,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:49:26,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:26,364 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2018-12-03 01:49:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:26,397 INFO L93 Difference]: Finished difference Result 685 states and 908 transitions. [2018-12-03 01:49:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:49:26,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-03 01:49:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:26,398 INFO L225 Difference]: With dead ends: 685 [2018-12-03 01:49:26,398 INFO L226 Difference]: Without dead ends: 369 [2018-12-03 01:49:26,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:49:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-03 01:49:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2018-12-03 01:49:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 01:49:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2018-12-03 01:49:26,420 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2018-12-03 01:49:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:26,420 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2018-12-03 01:49:26,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:49:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2018-12-03 01:49:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 01:49:26,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:26,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:26,423 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:26,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:26,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1221718069, now seen corresponding path program 1 times [2018-12-03 01:49:26,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:26,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:26,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:26,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:26,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:49:26,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:26,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:49:26,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:49:26,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:49:26,479 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2018-12-03 01:49:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:26,599 INFO L93 Difference]: Finished difference Result 991 states and 1319 transitions. [2018-12-03 01:49:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:49:26,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-03 01:49:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:26,603 INFO L225 Difference]: With dead ends: 991 [2018-12-03 01:49:26,603 INFO L226 Difference]: Without dead ends: 670 [2018-12-03 01:49:26,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-03 01:49:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-03 01:49:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-12-03 01:49:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-12-03 01:49:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2018-12-03 01:49:26,641 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2018-12-03 01:49:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:26,641 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2018-12-03 01:49:26,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:49:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2018-12-03 01:49:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 01:49:26,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:26,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:26,643 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:26,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:26,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2116320844, now seen corresponding path program 1 times [2018-12-03 01:49:26,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:26,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:26,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:26,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:26,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:26,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:26,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:49:26,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:26,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:49:26,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:49:26,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:26,704 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2018-12-03 01:49:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:26,754 INFO L93 Difference]: Finished difference Result 1280 states and 1639 transitions. [2018-12-03 01:49:26,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:49:26,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-03 01:49:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:26,757 INFO L225 Difference]: With dead ends: 1280 [2018-12-03 01:49:26,757 INFO L226 Difference]: Without dead ends: 672 [2018-12-03 01:49:26,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:49:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-12-03 01:49:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2018-12-03 01:49:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-12-03 01:49:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2018-12-03 01:49:26,778 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2018-12-03 01:49:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:26,779 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2018-12-03 01:49:26,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:49:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2018-12-03 01:49:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 01:49:26,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:26,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:26,780 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:26,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2043934286, now seen corresponding path program 1 times [2018-12-03 01:49:26,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:26,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:26,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:26,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:26,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:26,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:26,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:49:26,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:26,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:49:26,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:49:26,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:26,826 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2018-12-03 01:49:27,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:27,275 INFO L93 Difference]: Finished difference Result 1359 states and 1714 transitions. [2018-12-03 01:49:27,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:49:27,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-03 01:49:27,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:27,278 INFO L225 Difference]: With dead ends: 1359 [2018-12-03 01:49:27,278 INFO L226 Difference]: Without dead ends: 831 [2018-12-03 01:49:27,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:49:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-03 01:49:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2018-12-03 01:49:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-12-03 01:49:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2018-12-03 01:49:27,302 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2018-12-03 01:49:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:27,303 INFO L480 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2018-12-03 01:49:27,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:49:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2018-12-03 01:49:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 01:49:27,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:27,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:27,304 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:27,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:27,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1534461196, now seen corresponding path program 1 times [2018-12-03 01:49:27,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:27,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:27,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:27,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:27,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:27,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:27,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:49:27,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:27,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:49:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:49:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:49:27,326 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2018-12-03 01:49:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:27,389 INFO L93 Difference]: Finished difference Result 1887 states and 2417 transitions. [2018-12-03 01:49:27,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:49:27,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-12-03 01:49:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:27,393 INFO L225 Difference]: With dead ends: 1887 [2018-12-03 01:49:27,393 INFO L226 Difference]: Without dead ends: 1276 [2018-12-03 01:49:27,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:49:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-12-03 01:49:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2018-12-03 01:49:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-12-03 01:49:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2018-12-03 01:49:27,443 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2018-12-03 01:49:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:27,443 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2018-12-03 01:49:27,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:49:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2018-12-03 01:49:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 01:49:27,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:27,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:27,445 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:27,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:27,445 INFO L82 PathProgramCache]: Analyzing trace with hash -578263435, now seen corresponding path program 1 times [2018-12-03 01:49:27,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:27,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:27,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:27,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:27,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:27,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:27,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:49:27,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:27,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:49:27,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:49:27,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:49:27,522 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2018-12-03 01:49:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:27,646 INFO L93 Difference]: Finished difference Result 3564 states and 4733 transitions. [2018-12-03 01:49:27,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:49:27,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-12-03 01:49:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:27,656 INFO L225 Difference]: With dead ends: 3564 [2018-12-03 01:49:27,656 INFO L226 Difference]: Without dead ends: 2309 [2018-12-03 01:49:27,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:49:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-12-03 01:49:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2018-12-03 01:49:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-12-03 01:49:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2018-12-03 01:49:27,740 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2018-12-03 01:49:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:27,740 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2018-12-03 01:49:27,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:49:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2018-12-03 01:49:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 01:49:27,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:27,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:27,742 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:27,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:27,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1713093210, now seen corresponding path program 1 times [2018-12-03 01:49:27,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:27,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:27,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:27,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:27,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:27,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:27,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:49:27,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:27,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:49:27,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:49:27,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:49:27,794 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 5 states. [2018-12-03 01:49:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:28,286 INFO L93 Difference]: Finished difference Result 6956 states and 9741 transitions. [2018-12-03 01:49:28,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:49:28,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-12-03 01:49:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:28,301 INFO L225 Difference]: With dead ends: 6956 [2018-12-03 01:49:28,301 INFO L226 Difference]: Without dead ends: 4830 [2018-12-03 01:49:28,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:49:28,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2018-12-03 01:49:28,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4685. [2018-12-03 01:49:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4685 states. [2018-12-03 01:49:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2018-12-03 01:49:28,489 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 87 [2018-12-03 01:49:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:28,489 INFO L480 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2018-12-03 01:49:28,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:49:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2018-12-03 01:49:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 01:49:28,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:28,491 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:28,491 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:28,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1488980751, now seen corresponding path program 1 times [2018-12-03 01:49:28,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:28,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:28,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:28,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:28,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:49:28,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:28,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:49:28,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:49:28,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:49:28,519 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand 4 states. [2018-12-03 01:49:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:28,822 INFO L93 Difference]: Finished difference Result 6313 states and 8477 transitions. [2018-12-03 01:49:28,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:49:28,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-03 01:49:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:28,839 INFO L225 Difference]: With dead ends: 6313 [2018-12-03 01:49:28,839 INFO L226 Difference]: Without dead ends: 6310 [2018-12-03 01:49:28,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:49:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6310 states. [2018-12-03 01:49:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6310 to 6141. [2018-12-03 01:49:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6141 states. [2018-12-03 01:49:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 8233 transitions. [2018-12-03 01:49:29,055 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 8233 transitions. Word has length 88 [2018-12-03 01:49:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:29,056 INFO L480 AbstractCegarLoop]: Abstraction has 6141 states and 8233 transitions. [2018-12-03 01:49:29,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:49:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 8233 transitions. [2018-12-03 01:49:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 01:49:29,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:29,057 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:29,057 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:29,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1085920016, now seen corresponding path program 1 times [2018-12-03 01:49:29,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:29,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:29,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:49:29,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:29,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:29,135 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2018-12-03 01:49:29,136 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [18], [21], [30], [31], [50], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [125], [134], [137], [140], [146], [149], [159], [162], [174], [184], [186], [188], [189], [190], [204], [206], [229], [235], [237], [243], [245], [249], [259], [261], [263], [264], [265], [268], [284], [292], [294], [297], [302], [313], [314], [315], [316], [317], [318], [319], [320], [321], [325], [326], [327], [328], [329], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [355], [356], [357], [359] [2018-12-03 01:49:29,169 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:29,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:29,334 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:49:29,335 INFO L272 AbstractInterpreter]: Visited 86 different actions 89 times. Merged at 2 different actions 2 times. Never widened. Performed 700 root evaluator evaluations with a maximum evaluation depth of 3. Performed 700 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 40 variables. [2018-12-03 01:49:29,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:29,340 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:49:29,498 INFO L227 lantSequenceWeakener]: Weakened 85 states. On average, predicates are now at 78.88% of their original sizes. [2018-12-03 01:49:29,498 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:49:29,756 INFO L418 sIntCurrentIteration]: We unified 88 AI predicates to 88 [2018-12-03 01:49:29,756 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:49:29,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:49:29,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [6] total 34 [2018-12-03 01:49:29,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:29,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 01:49:29,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 01:49:29,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-12-03 01:49:29,757 INFO L87 Difference]: Start difference. First operand 6141 states and 8233 transitions. Second operand 30 states. [2018-12-03 01:49:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:33,616 INFO L93 Difference]: Finished difference Result 17663 states and 24193 transitions. [2018-12-03 01:49:33,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 01:49:33,616 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2018-12-03 01:49:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:33,654 INFO L225 Difference]: With dead ends: 17663 [2018-12-03 01:49:33,654 INFO L226 Difference]: Without dead ends: 11541 [2018-12-03 01:49:33,669 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=434, Invalid=2016, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 01:49:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11541 states. [2018-12-03 01:49:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11541 to 10667. [2018-12-03 01:49:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10667 states. [2018-12-03 01:49:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 14383 transitions. [2018-12-03 01:49:34,096 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 14383 transitions. Word has length 89 [2018-12-03 01:49:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:34,097 INFO L480 AbstractCegarLoop]: Abstraction has 10667 states and 14383 transitions. [2018-12-03 01:49:34,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 01:49:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 14383 transitions. [2018-12-03 01:49:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 01:49:34,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:34,097 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:34,098 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:34,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash -131765010, now seen corresponding path program 1 times [2018-12-03 01:49:34,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:34,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:34,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 01:49:34,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:34,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:49:34,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:34,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:49:34,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:49:34,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:49:34,144 INFO L87 Difference]: Start difference. First operand 10667 states and 14383 transitions. Second operand 7 states. [2018-12-03 01:49:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:35,529 INFO L93 Difference]: Finished difference Result 33769 states and 50119 transitions. [2018-12-03 01:49:35,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 01:49:35,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-03 01:49:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:35,598 INFO L225 Difference]: With dead ends: 33769 [2018-12-03 01:49:35,598 INFO L226 Difference]: Without dead ends: 21075 [2018-12-03 01:49:35,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-12-03 01:49:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21075 states. [2018-12-03 01:49:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21075 to 19665. [2018-12-03 01:49:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19665 states. [2018-12-03 01:49:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19665 states to 19665 states and 25847 transitions. [2018-12-03 01:49:36,351 INFO L78 Accepts]: Start accepts. Automaton has 19665 states and 25847 transitions. Word has length 100 [2018-12-03 01:49:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:36,352 INFO L480 AbstractCegarLoop]: Abstraction has 19665 states and 25847 transitions. [2018-12-03 01:49:36,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:49:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 19665 states and 25847 transitions. [2018-12-03 01:49:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 01:49:36,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:36,353 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:36,353 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:36,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash 193904721, now seen corresponding path program 1 times [2018-12-03 01:49:36,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:36,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:36,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 01:49:36,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:36,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:36,412 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2018-12-03 01:49:36,412 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [18], [21], [30], [31], [50], [56], [58], [61], [67], [71], [72], [79], [81], [84], [95], [99], [102], [104], [108], [109], [112], [113], [125], [134], [137], [140], [146], [149], [159], [162], [165], [174], [184], [186], [188], [189], [190], [204], [206], [229], [235], [237], [243], [245], [249], [259], [261], [263], [264], [265], [268], [284], [292], [294], [297], [302], [313], [314], [315], [316], [317], [318], [319], [320], [321], [325], [326], [327], [328], [329], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [355], [356], [357], [359] [2018-12-03 01:49:36,414 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:36,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:36,442 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:49:36,442 INFO L272 AbstractInterpreter]: Visited 88 different actions 98 times. Merged at 4 different actions 4 times. Never widened. Performed 848 root evaluator evaluations with a maximum evaluation depth of 3. Performed 848 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 40 variables. [2018-12-03 01:49:36,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:36,443 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:49:36,521 INFO L227 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 79.69% of their original sizes. [2018-12-03 01:49:36,521 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:49:36,870 INFO L418 sIntCurrentIteration]: We unified 109 AI predicates to 109 [2018-12-03 01:49:36,870 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:49:36,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:49:36,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [8] total 45 [2018-12-03 01:49:36,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:36,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 01:49:36,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 01:49:36,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 01:49:36,871 INFO L87 Difference]: Start difference. First operand 19665 states and 25847 transitions. Second operand 39 states. [2018-12-03 01:49:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:41,670 INFO L93 Difference]: Finished difference Result 34683 states and 45484 transitions. [2018-12-03 01:49:41,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 01:49:41,670 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 110 [2018-12-03 01:49:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:41,709 INFO L225 Difference]: With dead ends: 34683 [2018-12-03 01:49:41,709 INFO L226 Difference]: Without dead ends: 15167 [2018-12-03 01:49:41,732 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=622, Invalid=2918, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 01:49:41,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15167 states. [2018-12-03 01:49:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15167 to 11151. [2018-12-03 01:49:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11151 states. [2018-12-03 01:49:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11151 states to 11151 states and 14463 transitions. [2018-12-03 01:49:42,138 INFO L78 Accepts]: Start accepts. Automaton has 11151 states and 14463 transitions. Word has length 110 [2018-12-03 01:49:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:42,138 INFO L480 AbstractCegarLoop]: Abstraction has 11151 states and 14463 transitions. [2018-12-03 01:49:42,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 01:49:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 11151 states and 14463 transitions. [2018-12-03 01:49:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 01:49:42,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:42,143 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:42,143 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:42,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash -185069534, now seen corresponding path program 1 times [2018-12-03 01:49:42,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:42,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:42,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-03 01:49:42,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:42,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:42,213 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-12-03 01:49:42,213 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [30], [31], [36], [40], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [152], [159], [162], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [227], [229], [233], [235], [237], [240], [243], [245], [249], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [292], [294], [297], [300], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-03 01:49:42,216 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:42,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:42,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:42,342 INFO L272 AbstractInterpreter]: Visited 104 different actions 349 times. Merged at 23 different actions 104 times. Never widened. Performed 3635 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3635 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 26 fixpoints after 10 different actions. Largest state had 40 variables. [2018-12-03 01:49:42,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:42,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:42,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:42,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/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-12-03 01:49:42,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:42,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:42,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-03 01:49:42,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 01:49:42,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:42,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 4] total 10 [2018-12-03 01:49:42,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:42,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:49:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:49:42,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:49:42,594 INFO L87 Difference]: Start difference. First operand 11151 states and 14463 transitions. Second operand 3 states. [2018-12-03 01:49:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:43,039 INFO L93 Difference]: Finished difference Result 20011 states and 26260 transitions. [2018-12-03 01:49:43,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:49:43,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-12-03 01:49:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:43,060 INFO L225 Difference]: With dead ends: 20011 [2018-12-03 01:49:43,060 INFO L226 Difference]: Without dead ends: 9694 [2018-12-03 01:49:43,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:49:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9694 states. [2018-12-03 01:49:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9694 to 9691. [2018-12-03 01:49:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9691 states. [2018-12-03 01:49:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9691 states to 9691 states and 11686 transitions. [2018-12-03 01:49:43,391 INFO L78 Accepts]: Start accepts. Automaton has 9691 states and 11686 transitions. Word has length 188 [2018-12-03 01:49:43,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:43,391 INFO L480 AbstractCegarLoop]: Abstraction has 9691 states and 11686 transitions. [2018-12-03 01:49:43,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:49:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 9691 states and 11686 transitions. [2018-12-03 01:49:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 01:49:43,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:43,394 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:43,394 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:43,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:43,394 INFO L82 PathProgramCache]: Analyzing trace with hash 745588165, now seen corresponding path program 1 times [2018-12-03 01:49:43,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:43,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:43,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:43,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:43,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-03 01:49:43,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:43,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:43,472 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-12-03 01:49:43,472 INFO L205 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [18], [21], [23], [28], [30], [31], [36], [40], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [152], [159], [162], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [227], [229], [233], [235], [237], [240], [243], [245], [249], [252], [255], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [292], [294], [297], [300], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-03 01:49:43,474 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:43,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:43,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:43,873 INFO L272 AbstractInterpreter]: Visited 139 different actions 1389 times. Merged at 63 different actions 432 times. Never widened. Performed 13877 root evaluator evaluations with a maximum evaluation depth of 3. Performed 13877 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 116 fixpoints after 16 different actions. Largest state had 40 variables. [2018-12-03 01:49:43,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:43,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:43,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:43,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/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-12-03 01:49:43,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:43,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:43,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-03 01:49:44,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-03 01:49:44,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 01:49:44,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-03 01:49:44,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 01:49:44,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 01:49:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 01:49:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-12-03 01:49:44,177 INFO L87 Difference]: Start difference. First operand 9691 states and 11686 transitions. Second operand 11 states. [2018-12-03 01:49:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:45,328 INFO L93 Difference]: Finished difference Result 28937 states and 36125 transitions. [2018-12-03 01:49:45,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 01:49:45,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-12-03 01:49:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:45,367 INFO L225 Difference]: With dead ends: 28937 [2018-12-03 01:49:45,367 INFO L226 Difference]: Without dead ends: 18240 [2018-12-03 01:49:45,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 384 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2018-12-03 01:49:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18240 states. [2018-12-03 01:49:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18240 to 17124. [2018-12-03 01:49:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17124 states. [2018-12-03 01:49:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 20263 transitions. [2018-12-03 01:49:45,961 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 20263 transitions. Word has length 189 [2018-12-03 01:49:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:45,961 INFO L480 AbstractCegarLoop]: Abstraction has 17124 states and 20263 transitions. [2018-12-03 01:49:45,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 01:49:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 20263 transitions. [2018-12-03 01:49:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 01:49:45,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:45,964 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:45,964 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:45,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash 480424814, now seen corresponding path program 1 times [2018-12-03 01:49:45,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:45,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:45,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:45,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:45,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 01:49:46,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:46,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:46,025 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-12-03 01:49:46,026 INFO L205 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [18], [21], [23], [28], [30], [31], [34], [40], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [152], [159], [162], [168], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [227], [229], [233], [235], [237], [240], [243], [245], [249], [252], [255], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [294], [297], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-03 01:49:46,027 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:46,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:46,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:46,344 INFO L272 AbstractInterpreter]: Visited 135 different actions 1015 times. Merged at 39 different actions 225 times. Widened at 1 different actions 1 times. Performed 10956 root evaluator evaluations with a maximum evaluation depth of 3. Performed 10956 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 66 fixpoints after 10 different actions. Largest state had 40 variables. [2018-12-03 01:49:46,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:46,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:46,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:46,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/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-12-03 01:49:46,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:46,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:46,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:49:46,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-03 01:49:46,578 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:49:46,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [9] total 11 [2018-12-03 01:49:46,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:46,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:49:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:49:46,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:49:46,579 INFO L87 Difference]: Start difference. First operand 17124 states and 20263 transitions. Second operand 3 states. [2018-12-03 01:49:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:47,116 INFO L93 Difference]: Finished difference Result 32734 states and 39004 transitions. [2018-12-03 01:49:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:49:47,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-12-03 01:49:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:47,144 INFO L225 Difference]: With dead ends: 32734 [2018-12-03 01:49:47,144 INFO L226 Difference]: Without dead ends: 16835 [2018-12-03 01:49:47,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 388 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:49:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16835 states. [2018-12-03 01:49:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16835 to 16702. [2018-12-03 01:49:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16702 states. [2018-12-03 01:49:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16702 states to 16702 states and 19684 transitions. [2018-12-03 01:49:47,740 INFO L78 Accepts]: Start accepts. Automaton has 16702 states and 19684 transitions. Word has length 196 [2018-12-03 01:49:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:47,741 INFO L480 AbstractCegarLoop]: Abstraction has 16702 states and 19684 transitions. [2018-12-03 01:49:47,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:49:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 16702 states and 19684 transitions. [2018-12-03 01:49:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 01:49:47,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:47,743 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:47,743 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:47,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1558206204, now seen corresponding path program 1 times [2018-12-03 01:49:47,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:47,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:47,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 01:49:47,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:47,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:49:47,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:47,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:49:47,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:49:47,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:49:47,791 INFO L87 Difference]: Start difference. First operand 16702 states and 19684 transitions. Second operand 4 states. [2018-12-03 01:49:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:48,297 INFO L93 Difference]: Finished difference Result 25087 states and 29825 transitions. [2018-12-03 01:49:48,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:49:48,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-03 01:49:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:48,310 INFO L225 Difference]: With dead ends: 25087 [2018-12-03 01:49:48,310 INFO L226 Difference]: Without dead ends: 9300 [2018-12-03 01:49:48,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:49:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9300 states. [2018-12-03 01:49:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9300 to 9234. [2018-12-03 01:49:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2018-12-03 01:49:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 10544 transitions. [2018-12-03 01:49:48,637 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 10544 transitions. Word has length 197 [2018-12-03 01:49:48,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:48,637 INFO L480 AbstractCegarLoop]: Abstraction has 9234 states and 10544 transitions. [2018-12-03 01:49:48,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:49:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 10544 transitions. [2018-12-03 01:49:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 01:49:48,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:48,639 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:48,639 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:48,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:48,639 INFO L82 PathProgramCache]: Analyzing trace with hash 918395428, now seen corresponding path program 1 times [2018-12-03 01:49:48,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:48,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:48,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:48,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:48,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-03 01:49:48,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:48,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:48,765 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-12-03 01:49:48,765 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [23], [26], [28], [30], [31], [34], [42], [44], [45], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [152], [155], [159], [162], [168], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [229], [233], [235], [237], [240], [243], [245], [249], [252], [257], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [294], [297], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-03 01:49:48,766 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:48,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:49,269 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:49,270 INFO L272 AbstractInterpreter]: Visited 137 different actions 1897 times. Merged at 60 different actions 526 times. Widened at 2 different actions 2 times. Performed 20029 root evaluator evaluations with a maximum evaluation depth of 3. Performed 20029 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 173 fixpoints after 20 different actions. Largest state had 40 variables. [2018-12-03 01:49:49,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:49,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:49,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:49,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/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-12-03 01:49:49,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:49,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:49,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 66 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 01:49:49,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-03 01:49:49,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 01:49:49,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2018-12-03 01:49:49,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 01:49:49,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 01:49:49,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 01:49:49,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-12-03 01:49:49,609 INFO L87 Difference]: Start difference. First operand 9234 states and 10544 transitions. Second operand 13 states. [2018-12-03 01:49:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:51,174 INFO L93 Difference]: Finished difference Result 18498 states and 21470 transitions. [2018-12-03 01:49:51,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 01:49:51,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 198 [2018-12-03 01:49:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:51,200 INFO L225 Difference]: With dead ends: 18498 [2018-12-03 01:49:51,200 INFO L226 Difference]: Without dead ends: 18495 [2018-12-03 01:49:51,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 386 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-12-03 01:49:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18495 states. [2018-12-03 01:49:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18495 to 17979. [2018-12-03 01:49:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17979 states. [2018-12-03 01:49:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17979 states to 17979 states and 20794 transitions. [2018-12-03 01:49:51,858 INFO L78 Accepts]: Start accepts. Automaton has 17979 states and 20794 transitions. Word has length 198 [2018-12-03 01:49:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:51,858 INFO L480 AbstractCegarLoop]: Abstraction has 17979 states and 20794 transitions. [2018-12-03 01:49:51,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 01:49:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17979 states and 20794 transitions. [2018-12-03 01:49:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 01:49:51,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:51,860 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:51,861 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:51,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:51,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1414839607, now seen corresponding path program 2 times [2018-12-03 01:49:51,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:51,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:51,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:51,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:51,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-03 01:49:51,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:51,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:49:51,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:51,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:49:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:49:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:49:51,904 INFO L87 Difference]: Start difference. First operand 17979 states and 20794 transitions. Second operand 3 states. [2018-12-03 01:49:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:52,536 INFO L93 Difference]: Finished difference Result 30606 states and 35586 transitions. [2018-12-03 01:49:52,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:49:52,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-12-03 01:49:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:52,564 INFO L225 Difference]: With dead ends: 30606 [2018-12-03 01:49:52,564 INFO L226 Difference]: Without dead ends: 17570 [2018-12-03 01:49:52,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:49:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17570 states. [2018-12-03 01:49:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17570 to 17253. [2018-12-03 01:49:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17253 states. [2018-12-03 01:49:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17253 states to 17253 states and 19687 transitions. [2018-12-03 01:49:53,305 INFO L78 Accepts]: Start accepts. Automaton has 17253 states and 19687 transitions. Word has length 201 [2018-12-03 01:49:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:53,305 INFO L480 AbstractCegarLoop]: Abstraction has 17253 states and 19687 transitions. [2018-12-03 01:49:53,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:49:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 17253 states and 19687 transitions. [2018-12-03 01:49:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-12-03 01:49:53,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:53,309 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-03 01:49:53,309 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:53,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:53,309 INFO L82 PathProgramCache]: Analyzing trace with hash -138167773, now seen corresponding path program 1 times [2018-12-03 01:49:53,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:53,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:53,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:49:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:53,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-12-03 01:49:53,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:53,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:53,369 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-12-03 01:49:53,369 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [23], [26], [28], [30], [31], [34], [42], [44], [45], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [155], [159], [162], [165], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [229], [233], [235], [237], [240], [243], [245], [249], [252], [257], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [292], [294], [297], [300], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-03 01:49:53,370 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:53,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:53,660 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:53,660 INFO L272 AbstractInterpreter]: Visited 138 different actions 1270 times. Merged at 66 different actions 384 times. Widened at 2 different actions 2 times. Performed 11544 root evaluator evaluations with a maximum evaluation depth of 3. Performed 11544 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 127 fixpoints after 22 different actions. Largest state had 40 variables. [2018-12-03 01:49:53,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:53,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:53,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:53,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/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-12-03 01:49:53,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:53,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:53,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-03 01:49:53,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 41 proven. 21 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-03 01:49:53,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:53,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2018-12-03 01:49:53,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:53,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:49:53,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:49:53,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:49:53,894 INFO L87 Difference]: Start difference. First operand 17253 states and 19687 transitions. Second operand 6 states. [2018-12-03 01:49:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:54,345 INFO L93 Difference]: Finished difference Result 27933 states and 32481 transitions. [2018-12-03 01:49:54,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:49:54,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 275 [2018-12-03 01:49:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:54,364 INFO L225 Difference]: With dead ends: 27933 [2018-12-03 01:49:54,364 INFO L226 Difference]: Without dead ends: 10782 [2018-12-03 01:49:54,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 544 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:49:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10782 states. [2018-12-03 01:49:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10782 to 8449. [2018-12-03 01:49:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8449 states. [2018-12-03 01:49:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8449 states to 8449 states and 9643 transitions. [2018-12-03 01:49:54,785 INFO L78 Accepts]: Start accepts. Automaton has 8449 states and 9643 transitions. Word has length 275 [2018-12-03 01:49:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:54,786 INFO L480 AbstractCegarLoop]: Abstraction has 8449 states and 9643 transitions. [2018-12-03 01:49:54,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:49:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 8449 states and 9643 transitions. [2018-12-03 01:49:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-03 01:49:54,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:54,789 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-12-03 01:49:54,789 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:54,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:54,789 INFO L82 PathProgramCache]: Analyzing trace with hash 823377233, now seen corresponding path program 1 times [2018-12-03 01:49:54,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:54,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:54,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-12-03 01:49:54,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:54,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:54,835 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 294 with the following transitions: [2018-12-03 01:49:54,835 INFO L205 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [18], [21], [23], [28], [30], [31], [34], [36], [40], [42], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [81], [84], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [159], [162], [168], [173], [174], [177], [180], [182], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [227], [229], [233], [235], [237], [240], [243], [245], [249], [252], [255], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [292], [294], [297], [300], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-03 01:49:54,836 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:54,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:55,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:55,381 INFO L272 AbstractInterpreter]: Visited 144 different actions 2310 times. Merged at 78 different actions 822 times. Widened at 1 different actions 3 times. Performed 20817 root evaluator evaluations with a maximum evaluation depth of 3. Performed 20817 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 234 fixpoints after 26 different actions. Largest state had 40 variables. [2018-12-03 01:49:55,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:55,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:55,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:55,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:49:55,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:55,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:55,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 277 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-03 01:49:55,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 75 proven. 7 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-12-03 01:49:55,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 01:49:55,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 01:49:55,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 01:49:55,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 01:49:55,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 01:49:55,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:49:55,688 INFO L87 Difference]: Start difference. First operand 8449 states and 9643 transitions. Second operand 8 states. [2018-12-03 01:49:56,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:56,308 INFO L93 Difference]: Finished difference Result 13290 states and 15318 transitions. [2018-12-03 01:49:56,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 01:49:56,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 293 [2018-12-03 01:49:56,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:56,317 INFO L225 Difference]: With dead ends: 13290 [2018-12-03 01:49:56,317 INFO L226 Difference]: Without dead ends: 5355 [2018-12-03 01:49:56,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 581 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-12-03 01:49:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5355 states. [2018-12-03 01:49:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5355 to 5197. [2018-12-03 01:49:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5197 states. [2018-12-03 01:49:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5197 states to 5197 states and 5921 transitions. [2018-12-03 01:49:56,560 INFO L78 Accepts]: Start accepts. Automaton has 5197 states and 5921 transitions. Word has length 293 [2018-12-03 01:49:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:56,560 INFO L480 AbstractCegarLoop]: Abstraction has 5197 states and 5921 transitions. [2018-12-03 01:49:56,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 01:49:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5197 states and 5921 transitions. [2018-12-03 01:49:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-03 01:49:56,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:56,562 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:56,562 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:56,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:56,563 INFO L82 PathProgramCache]: Analyzing trace with hash 585639202, now seen corresponding path program 1 times [2018-12-03 01:49:56,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:56,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:56,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:56,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:56,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-12-03 01:49:56,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:56,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:56,637 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-12-03 01:49:56,637 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [23], [26], [28], [30], [31], [34], [42], [44], [45], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [152], [155], [159], [162], [168], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [229], [233], [235], [237], [240], [243], [245], [249], [252], [257], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [294], [297], [300], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-03 01:49:56,638 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:56,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:57,469 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:57,469 INFO L272 AbstractInterpreter]: Visited 138 different actions 2886 times. Merged at 59 different actions 966 times. Widened at 3 different actions 6 times. Performed 27768 root evaluator evaluations with a maximum evaluation depth of 3. Performed 27768 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 324 fixpoints after 20 different actions. Largest state had 40 variables. [2018-12-03 01:49:57,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:57,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:57,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:57,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:49:57,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:57,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:57,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-12-03 01:49:57,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-12-03 01:49:57,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:57,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2018-12-03 01:49:57,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:57,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:49:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:49:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:49:57,696 INFO L87 Difference]: Start difference. First operand 5197 states and 5921 transitions. Second operand 5 states. [2018-12-03 01:49:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:57,945 INFO L93 Difference]: Finished difference Result 6061 states and 6874 transitions. [2018-12-03 01:49:57,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:49:57,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2018-12-03 01:49:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:57,947 INFO L225 Difference]: With dead ends: 6061 [2018-12-03 01:49:57,947 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 01:49:57,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 585 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:49:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 01:49:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 01:49:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 01:49:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 01:49:57,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 294 [2018-12-03 01:49:57,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:57,956 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 01:49:57,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:49:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 01:49:57,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 01:49:57,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 01:49:58,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,244 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 181 [2018-12-03 01:49:58,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:58,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,546 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 183 [2018-12-03 01:49:59,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:59,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:00,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,924 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 201 [2018-12-03 01:50:01,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:01,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,684 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 201 [2018-12-03 01:50:02,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:02,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:50:03,363 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 82 [2018-12-03 01:50:04,180 WARN L180 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 111 [2018-12-03 01:50:04,820 WARN L180 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 101 [2018-12-03 01:50:07,198 WARN L180 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 352 DAG size of output: 169 [2018-12-03 01:50:09,943 WARN L180 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 338 DAG size of output: 108 [2018-12-03 01:50:10,340 WARN L180 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 1 [2018-12-03 01:50:11,350 WARN L180 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 125 [2018-12-03 01:50:13,740 WARN L180 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 399 DAG size of output: 100 [2018-12-03 01:50:14,063 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2018-12-03 01:50:15,722 WARN L180 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 234 DAG size of output: 113 [2018-12-03 01:50:16,062 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 1 [2018-12-03 01:50:16,538 WARN L180 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 1 [2018-12-03 01:50:18,530 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 319 DAG size of output: 99 [2018-12-03 01:50:18,705 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2018-12-03 01:50:20,276 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 313 DAG size of output: 93 [2018-12-03 01:50:20,704 WARN L180 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 1 [2018-12-03 01:50:21,415 WARN L180 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 107 [2018-12-03 01:50:21,932 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 58 [2018-12-03 01:50:22,110 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 78 [2018-12-03 01:50:22,904 WARN L180 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 111 [2018-12-03 01:50:23,505 WARN L180 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 102 [2018-12-03 01:50:24,217 WARN L180 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 100 [2018-12-03 01:50:25,606 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 319 DAG size of output: 99 [2018-12-03 01:50:29,209 WARN L180 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 319 DAG size of output: 154 [2018-12-03 01:50:30,547 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 211 DAG size of output: 102 [2018-12-03 01:50:31,577 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 358 DAG size of output: 89 [2018-12-03 01:50:33,572 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 361 DAG size of output: 112 [2018-12-03 01:50:37,833 WARN L180 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 352 DAG size of output: 169 [2018-12-03 01:50:38,179 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 354 DAG size of output: 1 [2018-12-03 01:50:39,906 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 250 DAG size of output: 119 [2018-12-03 01:50:40,085 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 78 [2018-12-03 01:50:40,930 WARN L180 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 1 [2018-12-03 01:50:43,272 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 364 DAG size of output: 158 [2018-12-03 01:50:44,659 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 255 DAG size of output: 89 [2018-12-03 01:50:44,838 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 78 [2018-12-03 01:50:47,704 WARN L180 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 343 DAG size of output: 92 [2018-12-03 01:50:48,252 WARN L180 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 91 [2018-12-03 01:50:50,391 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 250 DAG size of output: 119 [2018-12-03 01:50:52,068 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 294 DAG size of output: 133 [2018-12-03 01:50:52,872 WARN L180 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 100 [2018-12-03 01:50:53,201 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 93 [2018-12-03 01:50:53,974 WARN L180 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 101 [2018-12-03 01:50:54,102 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2018-12-03 01:50:54,380 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 94 [2018-12-03 01:50:54,469 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-12-03 01:50:54,469 INFO L448 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-12-03 01:50:54,469 INFO L448 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2018-12-03 01:50:54,469 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-12-03 01:50:54,470 INFO L444 ceAbstractionStarter]: At program point L303(line 303) the Hoare annotation is: (let ((.cse21 (= 2 ~c_dr_st~0)) (.cse16 (+ ~c_num_read~0 1)) (.cse22 (= ~p_dw_pc~0 1)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse24 (<= 2 ~p_dw_st~0))) (let ((.cse10 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse7 (< ~q_free~0 1)) (.cse11 (< 1 ~q_free~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse23 (and .cse2 .cse24)) (.cse14 (not (= 0 ~q_req_up~0))) (.cse15 (= ~p_dw_st~0 0)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse17 (not (= |old(~p_dw_st~0)| 0))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not .cse0)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse18 (not .cse22)) (.cse19 (not (= .cse16 ~p_num_write~0))) (.cse6 (< ~q_write_ev~0 2)) (.cse20 (not (= ~q_free~0 0))) (.cse9 (not (= 2 |old(~c_dr_st~0)|))) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse8 (and .cse24 .cse21))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse8 (or .cse6 (or .cse1 .cse7 .cse4 .cse9 .cse11 .cse14) .cse10 .cse12)) (or (not (= ~p_dw_i~0 1)) (and .cse15 (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse16 ~q_free~0) .cse13 (not .cse3) (< ~q_free~0 .cse16) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse17 .cse14 (not (= 0 ~c_dr_pc~0))) (or .cse1 .cse4 .cse8 .cse5 .cse18 .cse19 (= 0 ~q_write_ev~0) .cse20 .cse9 .cse14 .cse12) (or .cse6 .cse1 .cse4 .cse9 .cse5 .cse14 .cse21 .cse12) (or .cse6 .cse1 .cse7 .cse4 .cse21 .cse9 .cse22 .cse11 .cse12 .cse13) (or .cse6 .cse1 .cse4 .cse23 .cse3 .cse5 .cse14 .cse12) (or .cse23 .cse6 .cse1 .cse7 .cse4 .cse3 .cse22 .cse11 .cse12 .cse13) (or .cse6 .cse1 .cse4 .cse3 .cse23 .cse22 .cse14 .cse12) (or .cse6 .cse1 .cse4 .cse9 .cse22 .cse14 .cse21 .cse12) (or .cse0 .cse1 .cse15 .cse3 .cse17) (or .cse1 .cse4 .cse5 .cse18 .cse19 .cse6 .cse20 .cse9 .cse12 .cse8)))) [2018-12-03 01:50:54,470 INFO L444 ceAbstractionStarter]: At program point L305-2(lines 305 309) the Hoare annotation is: (let ((.cse17 (= 2 ~c_dr_st~0)) (.cse4 (= activate_threads_~tmp~1 0)) (.cse6 (+ ~c_num_read~0 1)) (.cse13 (= ~p_dw_pc~0 1)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse25 (not (= 0 ~c_dr_st~0))) (.cse19 (<= 2 ~p_dw_st~0))) (let ((.cse20 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse5 (= ~p_dw_st~0 0)) (.cse8 (not (= |old(~p_dw_st~0)| 0))) (.cse10 (< ~q_write_ev~0 2)) (.cse15 (< ~q_free~0 1)) (.cse2 (= 0 |old(~c_dr_st~0)|)) (.cse18 (< 1 ~q_free~0)) (.cse11 (and .cse25 .cse19)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse12 (not .cse0)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse23 (not .cse13)) (.cse24 (not (= .cse6 ~p_num_write~0))) (.cse21 (and .cse19 .cse17 .cse4)) (.cse22 (not (= ~q_free~0 0))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (not (= 0 ~q_req_up~0))) (.cse14 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and .cse5 (= ~c_dr_st~0 0) .cse4) (not (= 0 ~c_num_read~0)) (< .cse6 ~q_free~0) .cse7 (not .cse2) (< ~q_free~0 .cse6) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse8 .cse9 (not (= 0 ~c_dr_pc~0))) (or .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse9 .cse14) (or .cse10 .cse1 .cse15 .cse12 .cse16 .cse17 .cse13 .cse18 .cse14 .cse7) (or (and (and .cse5 .cse17) (= ~q_read_ev~0 1)) (and .cse19 .cse17) (or .cse10 (or .cse1 .cse15 .cse12 .cse16 .cse18 .cse9) .cse20 .cse14)) (or .cse10 .cse1 .cse12 .cse16 .cse13 .cse9 .cse14 .cse17) (or .cse1 .cse12 .cse3 .cse10 .cse15 .cse21 .cse16 .cse20 .cse18 .cse14 .cse7) (or .cse10 .cse1 .cse21 .cse12 .cse22 .cse16 .cse3 .cse23 .cse24 .cse14) (or .cse10 .cse1 .cse15 .cse2 .cse3 .cse13 .cse18 .cse4 .cse14 .cse7) (or .cse10 .cse1 .cse12 (and .cse25 .cse19 .cse4) .cse2 .cse3 .cse9 .cse14) (or .cse0 .cse1 .cse2 .cse25) (or .cse10 .cse1 .cse12 .cse16 .cse3 .cse17 .cse9 .cse14) (or .cse0 .cse1 .cse5 .cse2 .cse8) (or .cse10 .cse1 .cse15 .cse12 .cse2 .cse13 .cse18 .cse14 .cse11 .cse7) (or .cse1 .cse12 .cse3 .cse23 .cse24 .cse21 (= 0 ~q_write_ev~0) .cse22 .cse16 .cse9 .cse14)))) [2018-12-03 01:50:54,470 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 297 321) the Hoare annotation is: (let ((.cse21 (= 2 ~c_dr_st~0)) (.cse16 (+ ~c_num_read~0 1)) (.cse22 (= ~p_dw_pc~0 1)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse24 (<= 2 ~p_dw_st~0))) (let ((.cse10 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse7 (< ~q_free~0 1)) (.cse11 (< 1 ~q_free~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse23 (and .cse2 .cse24)) (.cse14 (not (= 0 ~q_req_up~0))) (.cse15 (= ~p_dw_st~0 0)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse17 (not (= |old(~p_dw_st~0)| 0))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not .cse0)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse18 (not .cse22)) (.cse19 (not (= .cse16 ~p_num_write~0))) (.cse6 (< ~q_write_ev~0 2)) (.cse20 (not (= ~q_free~0 0))) (.cse9 (not (= 2 |old(~c_dr_st~0)|))) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse8 (and .cse24 .cse21))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse8 (or .cse6 (or .cse1 .cse7 .cse4 .cse9 .cse11 .cse14) .cse10 .cse12)) (or (not (= ~p_dw_i~0 1)) (and .cse15 (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse16 ~q_free~0) .cse13 (not .cse3) (< ~q_free~0 .cse16) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse17 .cse14 (not (= 0 ~c_dr_pc~0))) (or .cse1 .cse4 .cse8 .cse5 .cse18 .cse19 (= 0 ~q_write_ev~0) .cse20 .cse9 .cse14 .cse12) (or .cse6 .cse1 .cse4 .cse9 .cse5 .cse14 .cse21 .cse12) (or .cse6 .cse1 .cse7 .cse4 .cse21 .cse9 .cse22 .cse11 .cse12 .cse13) (or .cse6 .cse1 .cse4 .cse23 .cse3 .cse5 .cse14 .cse12) (or .cse23 .cse6 .cse1 .cse7 .cse4 .cse3 .cse22 .cse11 .cse12 .cse13) (or .cse6 .cse1 .cse4 .cse3 .cse23 .cse22 .cse14 .cse12) (or .cse6 .cse1 .cse4 .cse9 .cse22 .cse14 .cse21 .cse12) (or .cse0 .cse1 .cse15 .cse3 .cse17) (or .cse1 .cse4 .cse5 .cse18 .cse19 .cse6 .cse20 .cse9 .cse12 .cse8)))) [2018-12-03 01:50:54,470 INFO L448 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2018-12-03 01:50:54,470 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L444 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse19 (+ ~c_num_read~0 1)) (.cse23 (= 0 ~c_dr_st~0))) (let ((.cse7 (not .cse23)) (.cse2 (not (= ~p_dw_pc~0 1))) (.cse8 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse10 (< ~q_write_ev~0 2)) (.cse4 (not (= ~q_free~0 0))) (.cse5 (not (= 0 ~c_num_read~0))) (.cse6 (not (= 0 ~c_dr_pc~0))) (.cse18 (= 1 ~c_dr_pc~0)) (.cse21 (< ~q_free~0 .cse19)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse9 (= 1 exists_runnable_thread_~__retres1~2)) (.cse1 (not (= ~q_read_ev~0 2))) (.cse22 (not (= 0 ~p_num_write~0))) (.cse3 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (< ~q_free~0 1)) (.cse12 (not (= 2 ~c_dr_st~0))) (.cse13 (not (= ~p_dw_st~0 0))) (.cse14 (< 1 ~q_free~0)) (.cse15 (not (= 0 ~q_req_up~0))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (< .cse19 ~q_free~0))) (and (or .cse0 .cse1 .cse2 (not (= ~p_dw_st~0 2)) .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6 .cse7 .cse8) (or .cse9 (let ((.cse16 (not (= ~c_num_read~0 ~p_num_write~0)))) (and (or .cse10 .cse2 (or .cse0 .cse11 .cse12 .cse1 .cse13 .cse14 .cse15) .cse16) (or .cse10 .cse0 .cse11 .cse12 .cse1 .cse2 .cse13 .cse16 .cse14 .cse17)))) (or .cse0 .cse7 (not .cse18) .cse1 .cse2 (not (= .cse19 ~p_num_write~0)) .cse8 .cse10 .cse4 .cse15 (< ~p_dw_st~0 2)) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) .cse5 .cse20 .cse17 .cse21 .cse0 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) .cse22 .cse3 .cse13 .cse15 .cse6 .cse9) (or .cse18 .cse0 .cse23 .cse13 .cse9) (or .cse21 .cse0 .cse9 .cse1 .cse22 .cse3 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse20)))) [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L444 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 21 40) the Hoare annotation is: (let ((.cse9 (= 1 ~c_dr_pc~0)) (.cse12 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse2 (and .cse12 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse3 (not (= 2 ~c_dr_st~0))) (.cse5 (not (= |old(~q_read_ev~0)| 2))) (.cse10 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse12)) (.cse0 (< |old(~q_write_ev~0)| 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse11 (= 0 ~c_dr_st~0)) (.cse4 (or (< ~q_free~0 1) (not .cse9) (< 1 ~q_free~0))) (.cse8 (= ~p_dw_pc~0 1)) (.cse6 (< ~p_dw_st~0 2)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7) (or .cse2 (or .cse1 (not (= ~q_free~0 0)) .cse3 .cse5 (not .cse8) (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= 0 |old(~q_write_ev~0)|) .cse6)) (or .cse9 .cse1 .cse10 .cse11) (or .cse10 .cse0 .cse1 .cse11 .cse4 .cse8 .cse6 .cse7)))) [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2018-12-03 01:50:54,471 INFO L448 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2018-12-03 01:50:54,472 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 279 296) the Hoare annotation is: (let ((.cse6 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse22 (+ ~c_num_read~0 1)) (.cse21 (= ~p_dw_pc~0 1)) (.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse24 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse8 (not (= |old(~q_read_ev~0)| 1))) (.cse23 (not (= ~p_dw_st~0 0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse7 (= ~q_read_ev~0 1)) (.cse12 (and .cse19 .cse24)) (.cse15 (not .cse21)) (.cse16 (not (= .cse22 ~p_num_write~0))) (.cse17 (not (= ~q_free~0 0))) (.cse18 (= 1 ~c_dr_pc~0)) (.cse20 (and .cse6 .cse19)) (.cse2 (< ~q_free~0 1)) (.cse13 (not (= 2 ~c_dr_st~0))) (.cse4 (< 1 ~q_free~0)) (.cse9 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse0 (< |old(~q_write_ev~0)| 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (= 0 ~c_dr_st~0)) (.cse11 (not (= |old(~q_read_ev~0)| 2))) (.cse5 (not (= 0 ~q_req_up~0))) (.cse10 (< ~p_dw_st~0 2))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7) .cse8 .cse9 .cse10) (or .cse1 .cse11 .cse0 .cse2 .cse12 .cse13 .cse9 .cse4 .cse10 .cse14) (or .cse1 .cse11 .cse15 .cse16 .cse0 .cse17 .cse13 .cse10 .cse12) (or .cse1 (not .cse18) (and .cse19 (= 1 ~q_write_ev~0)) .cse11 .cse15 .cse16 .cse17 (not (= 1 |old(~q_write_ev~0)|)) .cse5 .cse10) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse10 .cse14) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_read_ev~0 ~q_write_ev~0)) (not (= 0 ~c_num_read~0)) (< .cse22 ~q_free~0) .cse14 (< ~q_free~0 .cse22) .cse1 (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse23 .cse5 (not (= 0 ~c_dr_pc~0)) (or .cse11 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (or .cse0 .cse1 .cse3 .cse20 .cse21 .cse5 .cse10) (or (and (or (or .cse0 (or .cse1 .cse2 .cse13 .cse23 .cse4 .cse5) .cse15 .cse9) .cse8) (or .cse0 .cse1 .cse2 .cse13 .cse8 .cse15 .cse23 .cse9 .cse4 .cse14)) (and .cse7 .cse24)) (or .cse1 .cse12 .cse11 .cse15 .cse16 (= 0 |old(~q_write_ev~0)|) .cse17 .cse13 .cse5 .cse10) (or .cse18 .cse1 .cse20 .cse3) (or .cse20 (or .cse0 (or .cse1 .cse2 .cse13 .cse4 .cse5) .cse9 .cse10)) (or .cse0 .cse1 (and .cse6 (= 2 ~q_read_ev~0)) .cse3 .cse11 .cse5 .cse10)))) [2018-12-03 01:50:54,472 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2018-12-03 01:50:54,472 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 223 240) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0)) (not (= 0 ~c_num_read~0)) (< .cse0 ~q_free~0) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= 0 |old(~c_dr_st~0)|)) (< ~q_free~0 .cse0) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 ~q_req_up~0)) (not (= 0 ~c_dr_pc~0)))) [2018-12-03 01:50:54,472 INFO L448 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2018-12-03 01:50:54,472 INFO L448 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2018-12-03 01:50:54,472 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 455 466) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~c_dr_pc~0 0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~q_req_up~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-12-03 01:50:54,472 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-03 01:50:54,472 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2018-12-03 01:50:54,472 INFO L444 ceAbstractionStarter]: At program point L460(line 460) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~c_dr_pc~0 0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~q_req_up~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-12-03 01:50:54,472 INFO L444 ceAbstractionStarter]: At program point L460-1(line 460) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~q_req_up~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)|)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_i~0 1) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0))) [2018-12-03 01:50:54,472 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2018-12-03 01:50:54,472 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 114 153) the Hoare annotation is: (let ((.cse20 (+ ~c_num_read~0 1)) (.cse16 (= 1 ~c_dr_pc~0))) (let ((.cse3 (not (= 2 ~c_dr_st~0))) (.cse2 (not .cse16)) (.cse4 (not (= ~q_read_ev~0 2))) (.cse18 (< 1 |old(~q_free~0)|)) (.cse14 (= |old(~p_dw_pc~0)| 1)) (.cse15 (< .cse20 |old(~q_free~0)|)) (.cse0 (< |old(~q_free~0)| .cse20)) (.cse7 (= ~q_req_up~0 0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= 0 ~p_num_write~0)) (.cse12 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (not (= 0 |old(~q_req_up~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= 0 ~c_dr_st~0))) (and (let ((.cse11 (+ |old(~p_num_write~0)| 1))) (or .cse0 (or (or .cse1 .cse2) .cse3 .cse4 .cse5) (and (and .cse6 .cse7 .cse8 .cse9) (<= (+ ~p_num_write~0 1) ~q_free~0) .cse10) (< |old(~q_free~0)| .cse11) .cse12 .cse13 (< .cse11 |old(~q_free~0)|) .cse14 .cse15)) (or (and .cse9 (<= 1 ~q_free~0)) .cse16 .cse1 (< |old(~q_free~0)| 1) .cse17 .cse18 .cse5) (or .cse16 .cse1 .cse7 .cse17 .cse5) (or (and (= ~c_num_read~0 ~p_num_write~0) (and (or (and .cse7 .cse8) (and .cse9 .cse8)) (= ~p_dw_pc~0 1))) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse19 (< ~q_write_ev~0 2))) (and (or .cse19 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse19 (or .cse3 (or .cse1 .cse2 .cse4 .cse18))))) (not .cse14)))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse17) .cse0 .cse1 (and .cse6 .cse7 .cse8 (<= .cse20 ~q_free~0) .cse9 (= ~c_last_read~0 ~p_last_write~0) .cse10) (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) .cse12 .cse13 .cse5 (not (= 0 ~c_dr_pc~0))) (or .cse16 .cse1 (and .cse6 .cse8) .cse17)))) [2018-12-03 01:50:54,473 INFO L444 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse18 (+ ~c_num_read~0 1)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse1 (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse17)) (.cse6 (not (= 2 ~c_dr_st~0))) (.cse5 (not .cse0)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse14 (= |old(~p_dw_pc~0)| 1)) (.cse15 (< .cse18 |old(~q_free~0)|)) (.cse3 (= 0 ~c_dr_st~0)) (.cse4 (< |old(~q_free~0)| .cse18)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse11 (<= .cse18 ~q_free~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (not (= 0 |old(~q_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (let ((.cse9 (+ |old(~p_num_write~0)| 1))) (or .cse4 (or (or .cse2 .cse5) .cse6 .cse7 .cse8) (< |old(~q_free~0)| .cse9) .cse10 (and .cse1 .cse11 (<= ~q_free~0 (+ ~p_num_write~0 1)) .cse12) .cse13 (< .cse9 |old(~q_free~0)|) .cse14 .cse15)) (or (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse16 (< ~q_write_ev~0 2))) (and (or .cse16 .cse2 .cse5 .cse6 .cse7 .cse8) (or .cse16 (or .cse6 (or .cse2 .cse5 .cse7 (< 1 |old(~q_free~0)|)))))) (not .cse14))) (and .cse17 (= ~p_dw_pc~0 1) (= ~c_num_read~0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse3) .cse4 .cse2 (not (= 2 ~q_write_ev~0)) (and .cse17 (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) .cse11 (<= ~q_free~0 .cse18) .cse12) (not (= |old(~p_dw_pc~0)| 0)) .cse10 .cse13 .cse8 (not (= 0 ~c_dr_pc~0)))))) [2018-12-03 01:50:54,473 INFO L444 ceAbstractionStarter]: At program point L129-1(lines 117 152) the Hoare annotation is: (let ((.cse11 (+ ~c_num_read~0 1)) (.cse0 (= 1 ~c_dr_pc~0))) (let ((.cse6 (not .cse0)) (.cse7 (not (= 2 ~c_dr_st~0))) (.cse8 (not (= ~q_read_ev~0 2))) (.cse19 (< .cse11 |old(~q_free~0)|)) (.cse4 (= 0 ~c_dr_st~0)) (.cse12 (< |old(~q_free~0)| .cse11)) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= 0 ~p_num_write~0)) (.cse17 (not (= 0 |old(~p_num_write~0)|))) (.cse18 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse1 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~q_free~0 0))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse5 (< ~q_write_ev~0 2))) (and (or .cse5 .cse3 .cse6 .cse7 .cse8 .cse9) (or .cse5 (or .cse7 (or .cse3 .cse6 .cse8 (< 1 |old(~q_free~0)|)))))) (not (= |old(~p_dw_pc~0)| 1)))) (and (= ~p_dw_pc~0 1) .cse2 .cse10 (= .cse11 ~p_num_write~0))) (let ((.cse16 (+ |old(~p_num_write~0)| 1))) (or .cse12 (or (or .cse3 .cse6) .cse7 .cse8 .cse9) (and (and .cse1 .cse13 .cse2 .cse14) (<= (+ ~p_num_write~0 1) ~q_free~0) .cse15) (< |old(~q_free~0)| .cse16) .cse17 .cse18 (< .cse16 |old(~q_free~0)|) (and (<= .cse16 ~p_num_write~0) (<= ~p_num_write~0 1) .cse1 .cse2 .cse10) .cse19)) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse19 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse4) .cse12 .cse3 (and .cse1 .cse13 .cse2 (<= .cse11 ~q_free~0) .cse14 (= ~c_last_read~0 ~p_last_write~0) .cse15) (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) .cse17 .cse18 .cse9 (not (= 0 ~c_dr_pc~0)) (and (= ~p_num_write~0 1) .cse1 .cse2 .cse10))))) [2018-12-03 01:50:54,473 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2018-12-03 01:50:54,473 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2018-12-03 01:50:54,473 INFO L444 ceAbstractionStarter]: At program point L148(lines 114 153) the Hoare annotation is: (let ((.cse16 (+ ~c_num_read~0 1)) (.cse0 (= 1 ~c_dr_pc~0))) (let ((.cse12 (<= 2 ~p_dw_st~0)) (.cse6 (not (= 2 ~c_dr_st~0))) (.cse5 (not .cse0)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse15 (< .cse16 |old(~q_free~0)|)) (.cse2 (= 0 ~c_dr_st~0)) (.cse13 (= ~p_dw_pc~0 1)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~q_free~0 0)) (.cse4 (< |old(~q_free~0)| .cse16)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (not (= 0 |old(~q_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse2 (not (= 1 |old(~p_dw_pc~0)|))) (let ((.cse9 (+ |old(~p_num_write~0)| 1))) (or .cse4 (or (or .cse1 .cse5) .cse6 .cse7 .cse8) (< |old(~q_free~0)| .cse9) .cse10 .cse11 (and .cse12 (<= .cse9 ~p_num_write~0) (<= ~p_num_write~0 1) .cse13 .cse3 .cse14) (< .cse9 |old(~q_free~0)|) .cse15)) (or (and .cse12 .cse13 .cse3 .cse14 (= .cse16 ~p_num_write~0)) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse17 (< ~q_write_ev~0 2))) (and (or .cse17 .cse1 .cse5 .cse6 .cse7 .cse8) (or .cse17 (or .cse6 (or .cse1 .cse5 .cse7 (< 1 |old(~q_free~0)|)))))) (not (= |old(~p_dw_pc~0)| 1))))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse2) (and (= ~p_dw_st~0 2) (= ~p_num_write~0 1) .cse13 .cse3 .cse14) .cse4 .cse1 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) .cse10 .cse11 .cse8 (not (= 0 ~c_dr_pc~0)))))) [2018-12-03 01:50:54,473 INFO L448 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2018-12-03 01:50:54,473 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-12-03 01:50:54,473 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-03 01:50:54,473 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-12-03 01:50:54,473 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-12-03 01:50:54,473 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 01:50:54,474 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= |old(~c_num_read~0)| ~c_num_read~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~p_num_write~0)| ~p_num_write~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) [2018-12-03 01:50:54,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 01:50:54,474 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-12-03 01:50:54,474 INFO L451 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2018-12-03 01:50:54,474 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-12-03 01:50:54,474 INFO L451 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2018-12-03 01:50:54,474 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2018-12-03 01:50:54,474 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2018-12-03 01:50:54,474 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2018-12-03 01:50:54,474 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 322 375) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_pc~0)| 1)) (.cse37 (= 1 |old(~c_dr_pc~0)|)) (.cse27 (<= ~q_free~0 1)) (.cse26 (<= 1 ~q_free~0)) (.cse29 (not (= 0 ~c_dr_st~0))) (.cse14 (<= 2 ~p_dw_st~0)) (.cse30 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse15 (= ~q_req_up~0 0)) (.cse18 (= 1 ~c_dr_pc~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse34 (+ ~c_num_read~0 1)) (.cse32 (+ |old(~c_num_read~0)| 1))) (let ((.cse23 (not (= .cse32 |old(~p_num_write~0)|))) (.cse24 (not (= |old(~q_free~0)| 0))) (.cse20 (= ~q_free~0 0)) (.cse21 (= .cse34 ~p_num_write~0)) (.cse13 (and .cse29 .cse14 .cse30 .cse15 .cse18 .cse19)) (.cse36 (and .cse27 .cse26)) (.cse35 (not (= |old(~p_dw_st~0)| 0))) (.cse33 (= ~p_dw_st~0 0)) (.cse3 (not .cse37)) (.cse11 (not (= ~q_read_ev~0 2))) (.cse22 (not .cse6)) (.cse16 (= ~p_dw_pc~0 1)) (.cse17 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse25 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= 2 ~c_dr_st~0)) (.cse31 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (not (= 2 |old(~c_dr_st~0)|))) (.cse28 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse9 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (< |old(~q_free~0)| 1)) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse7 (< 1 |old(~q_free~0)|)) (.cse10 (not (= 0 |old(~q_req_up~0)|))) (.cse8 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse10 .cse4 .cse8) (or .cse0 .cse1 .cse3 .cse5 .cse11 .cse10 .cse4 .cse8) (or .cse0 .cse1 .cse3 .cse12 .cse13 .cse6 .cse10 .cse8) (or .cse1 .cse3 (and .cse14 .cse15 .cse16 .cse17 .cse4 .cse18 .cse19 .cse20 .cse21) .cse11 .cse22 .cse23 (= 0 ~q_write_ev~0) .cse24 .cse5 .cse10 .cse8) (or .cse0 .cse1 .cse3 .cse24 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse22 .cse23 .cse10 .cse8) (or .cse1 .cse3 .cse11 .cse22 .cse23 .cse0 .cse24 .cse5 .cse8 (and .cse14 .cse16 .cse17 .cse4 .cse18 .cse19 .cse20 .cse21)) (or (and .cse14 .cse16 .cse15 .cse17 .cse25 .cse4 .cse18 .cse19 .cse26 .cse27) (or .cse0 (or .cse1 .cse2 .cse3 .cse5 .cse7 .cse10) .cse22 .cse28 .cse8)) (or (and .cse29 .cse14 .cse30 .cse18 .cse19 .cse26 .cse27 .cse31) .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse32 |old(~q_free~0)|) .cse9 (not .cse12) (< |old(~q_free~0)| .cse32) .cse1 (and .cse33 (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) .cse30 .cse15 .cse19 (= ~c_num_read~0 0) (<= .cse34 ~q_free~0) .cse27 .cse31 (= 0 ~p_num_write~0)) (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse35 .cse10 (not (= 0 |old(~c_dr_pc~0)|))) (or .cse0 .cse36 (or .cse1 .cse2 .cse12 .cse11 .cse7 .cse10) .cse8) (or .cse0 .cse1 .cse3 .cse13 .cse12 .cse11 .cse10 .cse8) (or .cse1 .cse3 .cse11 .cse0 .cse2 .cse12 (not (= 1 |old(~p_num_write~0)|)) .cse6 .cse7 (not (= 1 |old(~c_num_read~0)|)) (and (= ~c_num_read~0 1) (= ~p_num_write~0 1)) .cse8 .cse9) (or .cse36 .cse37 .cse1 .cse2 .cse12 .cse7 .cse10) (or .cse37 .cse1 .cse15 .cse12 .cse10) (or .cse37 .cse1 .cse33 .cse12 .cse35) (or .cse37 .cse1 (and (not (= ~c_dr_pc~0 1)) .cse29 .cse30 .cse19) .cse12) (or (and (or .cse0 .cse22 (or .cse1 .cse2 .cse3 .cse5 .cse11 .cse35 .cse7 .cse10) .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse22 .cse35 .cse28 .cse7 .cse9)) (or (and .cse16 .cse15 .cse17 .cse25 .cse33 .cse4 .cse18 .cse19 .cse26 .cse27) (and .cse16 .cse17 .cse25 .cse33 .cse4 .cse18 .cse19 .cse26 .cse27 .cse31))) (or .cse1 .cse3 .cse11 .cse22 .cse0 .cse2 (and .cse14 .cse16 .cse17 .cse25 .cse4 .cse18 .cse19 .cse26 .cse27 .cse31) .cse5 .cse28 .cse7 .cse8 .cse9) (or .cse0 (and .cse26 .cse27) (or .cse1 .cse2 .cse12 .cse6 .cse7 .cse10) .cse8)))) [2018-12-03 01:50:54,474 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2018-12-03 01:50:54,474 INFO L448 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2018-12-03 01:50:54,475 INFO L444 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_pc~0)| 1)) (.cse32 (= 1 |old(~c_dr_pc~0)|)) (.cse36 (+ |old(~c_num_read~0)| 1)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse15 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse16 (= ~q_req_up~0 0)) (.cse17 (= 1 ~c_dr_pc~0)) (.cse39 (+ |old(~p_num_write~0)| 1)) (.cse13 (not (= 0 ~c_dr_st~0))) (.cse18 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse33 (and (not (= ~c_dr_pc~0 1)) .cse13 .cse18)) (.cse37 (<= .cse39 ~p_num_write~0)) (.cse22 (= ~q_free~0 0)) (.cse23 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse38 (not (= |old(~p_dw_st~0)| 0))) (.cse19 (and .cse13 .cse14 .cse15 (<= 2 ~q_write_ev~0) .cse16 .cse17 .cse18)) (.cse25 (not (= .cse36 |old(~p_num_write~0)|))) (.cse26 (not (= |old(~q_free~0)| 0))) (.cse10 (not (= 0 |old(~q_req_up~0)|))) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse34 (= ~c_num_read~0 1)) (.cse35 (= ~p_num_write~0 1)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse32)) (.cse11 (not (= ~q_read_ev~0 2))) (.cse24 (not .cse6)) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (< |old(~q_free~0)| 1)) (.cse20 (= ~p_dw_pc~0 1)) (.cse21 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse29 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= 2 ~c_dr_st~0)) (.cse27 (<= 1 ~q_free~0)) (.cse28 (<= ~q_free~0 1)) (.cse31 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (not (= 2 |old(~c_dr_st~0)|))) (.cse30 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (< 1 |old(~q_free~0)|)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse9 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse10 .cse4 .cse8) (or .cse0 .cse1 .cse3 .cse5 .cse11 .cse10 .cse4 .cse8) (or .cse0 .cse1 .cse3 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse6 .cse10 .cse8) (or .cse0 .cse1 .cse3 .cse19 .cse12 .cse11 .cse10 .cse8) (or .cse1 .cse3 (and .cse14 .cse16 .cse20 .cse21 .cse4 .cse17 .cse18 .cse22 .cse23) .cse11 .cse24 .cse25 (= 0 ~q_write_ev~0) .cse26 .cse5 .cse10 .cse8) (or .cse1 .cse3 .cse11 .cse24 .cse25 .cse0 .cse26 .cse5 .cse8 (and .cse14 .cse20 .cse21 .cse4 .cse17 .cse18 .cse22 .cse23)) (or .cse0 (and .cse27 .cse28) (or .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse10) .cse8) (or (and .cse14 .cse20 .cse16 .cse21 .cse29 .cse4 .cse17 .cse18 .cse27 .cse28) (or .cse0 (or .cse1 .cse2 .cse3 .cse5 .cse7 .cse10) .cse24 .cse30 .cse8)) (or (and .cse13 .cse14 .cse15 .cse17 .cse18 .cse27 .cse28 .cse31) .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9) (or .cse32 .cse1 .cse12 .cse33) (or (and .cse14 .cse4 .cse34 .cse27 .cse35 .cse20 .cse18 .cse28 .cse31) (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) .cse33 (not (= 0 |old(~c_num_read~0)|)) (< .cse36 |old(~q_free~0)|) .cse9 (< |old(~q_free~0)| .cse36) .cse1 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (and .cse14 .cse4 .cse37 (<= ~p_num_write~0 1) .cse20 .cse18 (= ~c_num_read~0 0) .cse22) .cse38 .cse10 (not (= 0 |old(~c_dr_pc~0)|))) (or .cse0 (and .cse28 .cse27) (or .cse1 .cse2 .cse3 .cse12 .cse11 .cse7 .cse10) .cse8) (or (and .cse14 .cse20 .cse4 .cse17 .cse18 .cse37 (<= ~p_num_write~0 .cse39) .cse22 .cse23) (and (or .cse0 .cse24 (or .cse1 .cse2 .cse3 .cse5 .cse11 .cse38 .cse7 .cse10) .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse24 .cse38 .cse30 .cse7 .cse9))) (or (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse14 .cse20 .cse29 .cse4 .cse17 .cse18 .cse27 .cse28 .cse31) .cse1 .cse19 .cse3 .cse11 .cse24 .cse25 .cse0 .cse26 .cse10 .cse8) (or .cse1 .cse3 .cse11 .cse0 .cse2 .cse12 (not (= 1 |old(~p_num_write~0)|)) .cse6 .cse7 (not (= 1 |old(~c_num_read~0)|)) (and .cse34 .cse35) .cse8 .cse9) (or .cse1 .cse3 .cse11 .cse24 .cse0 .cse2 (and .cse14 .cse20 .cse21 .cse29 .cse4 .cse17 .cse18 .cse27 .cse28 .cse31) .cse5 .cse30 .cse7 .cse8 .cse9)))) [2018-12-03 01:50:54,475 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2018-12-03 01:50:54,475 INFO L444 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_pc~0)| 1)) (.cse45 (= 1 |old(~c_dr_pc~0)|)) (.cse44 (+ ~c_num_read~0 1)) (.cse46 (+ |old(~p_num_write~0)| 1)) (.cse41 (+ |old(~c_num_read~0)| 1)) (.cse13 (not (= 0 ~c_dr_st~0))) (.cse14 (<= 2 ~p_dw_st~0)) (.cse15 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse16 (= ~q_req_up~0 0)) (.cse17 (= 1 ~c_dr_pc~0)) (.cse18 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse24 (and .cse13 .cse14 .cse15 (<= 2 ~q_write_ev~0) .cse16 .cse17 .cse18)) (.cse29 (not (= .cse41 |old(~p_num_write~0)|))) (.cse30 (not (= |old(~q_free~0)| 0))) (.cse39 (and (not (= ~c_dr_pc~0 1)) .cse13 .cse18)) (.cse42 (<= .cse46 ~p_num_write~0)) (.cse26 (= ~q_free~0 0)) (.cse27 (= .cse44 ~p_num_write~0)) (.cse10 (not (= 0 |old(~q_req_up~0)|))) (.cse43 (not (= |old(~p_dw_st~0)| 0))) (.cse34 (= ~p_dw_st~0 0)) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse32 (= ~c_num_read~0 1)) (.cse33 (= ~p_num_write~0 1)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse45)) (.cse11 (not (= ~q_read_ev~0 2))) (.cse28 (not .cse6)) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (< |old(~q_free~0)| 1)) (.cse19 (= ~p_dw_pc~0 1)) (.cse25 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse20 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= 2 ~c_dr_st~0)) (.cse21 (<= 1 ~q_free~0)) (.cse22 (<= ~q_free~0 1)) (.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (not (= 2 |old(~c_dr_st~0)|))) (.cse31 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (< 1 |old(~q_free~0)|)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse9 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse10 .cse4 .cse8) (or .cse0 .cse1 .cse3 .cse5 .cse11 .cse10 .cse4 .cse8) (or .cse0 .cse1 .cse3 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse6 .cse10 .cse8) (or (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse14 .cse19 .cse20 .cse4 .cse17 .cse18 .cse21 .cse22 .cse23) .cse1 .cse24 .cse3 (and .cse14 .cse16 .cse19 .cse25 .cse17 .cse18 .cse26 .cse27) .cse11 .cse28 .cse29 .cse0 .cse30 .cse10 .cse8) (or .cse0 .cse1 .cse3 .cse24 .cse12 .cse11 .cse10 .cse8) (or .cse1 .cse3 (and .cse14 .cse16 .cse19 .cse25 .cse4 .cse17 .cse18 .cse26 .cse27) .cse11 .cse28 .cse29 (= 0 ~q_write_ev~0) .cse30 .cse5 .cse10 .cse8) (or .cse1 .cse3 .cse11 .cse28 .cse29 .cse0 .cse30 .cse5 .cse8 (and .cse14 .cse19 .cse25 .cse4 .cse17 .cse18 .cse26 .cse27)) (or .cse0 (and .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse10) .cse8) (or (and .cse14 .cse19 .cse16 .cse25 .cse20 .cse4 .cse17 .cse18 .cse21 .cse22) (or .cse0 (or .cse1 .cse2 .cse3 .cse5 .cse7 .cse10) .cse28 .cse31 .cse8)) (or (and .cse13 .cse14 .cse15 .cse17 .cse18 .cse21 .cse22 .cse23) .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9) (let ((.cse35 (= ~c_dr_pc~0 0)) (.cse36 (= ~c_num_read~0 0)) (.cse37 (<= .cse44 ~q_free~0)) (.cse40 (<= 1 eval_~tmp___1~0)) (.cse38 (= 0 ~p_num_write~0))) (or (and .cse14 .cse4 .cse32 .cse21 .cse33 .cse19 .cse18 .cse22 .cse23) (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and .cse34 .cse35 .cse15 .cse16 .cse18 .cse36 .cse37 .cse22 .cse23 .cse38) .cse39 (and (= ~p_dw_st~0 2) .cse33 .cse35 .cse19 .cse18 .cse36 .cse26 .cse40) (not (= 0 |old(~c_num_read~0)|)) (< .cse41 |old(~q_free~0)|) .cse9 (< |old(~q_free~0)| .cse41) .cse1 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (and .cse14 .cse4 .cse42 (<= ~p_num_write~0 1) .cse19 .cse18 .cse36 .cse26) .cse43 (and .cse34 .cse4 .cse15 (= |old(~c_num_read~0)| ~c_num_read~0) .cse16 .cse18 .cse37 .cse22 .cse40 .cse23 .cse38) .cse10 (not (= 0 |old(~c_dr_pc~0)|)))) (or .cse45 .cse1 .cse12 .cse39) (or .cse0 (and .cse22 .cse21) (or .cse1 .cse2 .cse3 .cse12 .cse11 .cse7 .cse10) .cse8) (or (and .cse14 .cse19 .cse4 .cse17 .cse18 .cse42 (<= ~p_num_write~0 .cse46) .cse26 .cse27) (and (or .cse0 .cse28 (or .cse1 .cse2 .cse3 .cse5 .cse11 .cse43 .cse7 .cse10) .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse28 .cse43 .cse31 .cse7 .cse9)) (or (and .cse19 .cse16 .cse25 .cse20 .cse34 .cse4 .cse17 .cse18 .cse21 .cse22) (and .cse19 .cse25 .cse20 .cse34 .cse4 .cse17 .cse18 .cse21 .cse22 .cse23))) (or .cse1 .cse3 .cse11 .cse0 .cse2 .cse12 (not (= 1 |old(~p_num_write~0)|)) .cse6 .cse7 (not (= 1 |old(~c_num_read~0)|)) (and .cse32 .cse33) .cse8 .cse9) (or .cse1 .cse3 .cse11 .cse28 .cse0 .cse2 (and .cse14 .cse19 .cse25 .cse20 .cse4 .cse17 .cse18 .cse21 .cse22 .cse23) .cse5 .cse31 .cse7 .cse8 .cse9)))) [2018-12-03 01:50:54,475 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2018-12-03 01:50:54,476 INFO L444 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse25 (+ |old(~c_num_read~0)| 1)) (.cse12 (= |old(~p_dw_pc~0)| 1))) (let ((.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse6 (not .cse12)) (.cse7 (not (= .cse25 |old(~p_num_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse11 (< |old(~q_free~0)| 1)) (.cse2 (not .cse15)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= ~q_read_ev~0 2))) (.cse17 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse13 (< 1 |old(~q_free~0)|)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse16 (and (not (= ~c_dr_pc~0 1)) (not (= 0 ~c_dr_st~0)) .cse22)) (.cse14 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse20 (= 2 ~c_dr_st~0)) (.cse19 (= ~q_req_up~0 0)) (.cse23 (<= ~q_free~0 1)) (.cse18 (<= 1 eval_~tmp___1~0)) (.cse24 (not (= |old(~p_dw_st~0)| 0))) (.cse10 (not (= 0 |old(~q_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse9 .cse5 .cse10 .cse8) (or .cse0 .cse1 .cse11 .cse2 .cse9 .cse12 .cse13 .cse8 .cse14) (or .cse15 .cse1 .cse9 .cse16) (or .cse0 (or .cse1 .cse11 .cse2 .cse4 .cse13 .cse10) .cse17 .cse8) (or (and .cse18 (and (= |old(~p_num_write~0)| ~p_num_write~0) (= ~c_num_read~0 ~p_num_write~0) (and (let ((.cse21 (= 1 ~c_dr_pc~0))) (or (and .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse20 .cse21 .cse22))) (= ~p_dw_pc~0 1)))) (and (or .cse0 .cse6 (or .cse1 .cse11 .cse2 .cse4 .cse5 .cse24 .cse13 .cse10) .cse17) (or .cse0 .cse1 .cse11 .cse2 .cse4 .cse5 .cse6 .cse24 .cse17 .cse13 .cse14))) (or .cse0 .cse1 .cse2 .cse9 .cse12 .cse10 .cse8) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 (= 0 ~q_write_ev~0) .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse8) (or .cse0 .cse1 .cse11 .cse2 .cse4 .cse5 .cse17 .cse13 .cse8 .cse14) (let ((.cse29 (+ ~c_num_read~0 1))) (let ((.cse26 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse28 (<= .cse29 ~q_free~0)) (.cse30 (= 0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) .cse16 (not (= 0 |old(~c_num_read~0)|)) (< .cse25 |old(~q_free~0)|) .cse14 (< |old(~q_free~0)| .cse25) .cse1 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (let ((.cse27 (+ ~p_num_write~0 1))) (and (and .cse26 .cse19 .cse20 .cse22) (<= .cse27 ~q_free~0) .cse28 (<= ~q_free~0 .cse29) .cse18 (<= ~q_free~0 .cse27) .cse30)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (and (= ~c_dr_pc~0 0) .cse26 .cse19 .cse22 (= ~c_num_read~0 0) .cse28 .cse23 .cse18 (= ~c_last_read~0 ~p_last_write~0) .cse30) .cse24 .cse10 (not (= 0 |old(~c_dr_pc~0)|)))))))) [2018-12-03 01:50:54,476 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2018-12-03 01:50:54,476 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2018-12-03 01:50:54,476 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-12-03 01:50:54,476 INFO L444 ceAbstractionStarter]: At program point L330(line 330) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_pc~0)| 1)) (.cse45 (= 1 |old(~c_dr_pc~0)|)) (.cse44 (+ ~c_num_read~0 1)) (.cse46 (+ |old(~p_num_write~0)| 1)) (.cse41 (+ |old(~c_num_read~0)| 1)) (.cse13 (not (= 0 ~c_dr_st~0))) (.cse14 (<= 2 ~p_dw_st~0)) (.cse15 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse16 (= ~q_req_up~0 0)) (.cse17 (= 1 ~c_dr_pc~0)) (.cse18 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse24 (and .cse13 .cse14 .cse15 (<= 2 ~q_write_ev~0) .cse16 .cse17 .cse18)) (.cse29 (not (= .cse41 |old(~p_num_write~0)|))) (.cse30 (not (= |old(~q_free~0)| 0))) (.cse39 (and (not (= ~c_dr_pc~0 1)) .cse13 .cse18)) (.cse42 (<= .cse46 ~p_num_write~0)) (.cse26 (= ~q_free~0 0)) (.cse27 (= .cse44 ~p_num_write~0)) (.cse10 (not (= 0 |old(~q_req_up~0)|))) (.cse43 (not (= |old(~p_dw_st~0)| 0))) (.cse34 (= ~p_dw_st~0 0)) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse32 (= ~c_num_read~0 1)) (.cse33 (= ~p_num_write~0 1)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse45)) (.cse11 (not (= ~q_read_ev~0 2))) (.cse28 (not .cse6)) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (< |old(~q_free~0)| 1)) (.cse19 (= ~p_dw_pc~0 1)) (.cse25 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse20 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= 2 ~c_dr_st~0)) (.cse21 (<= 1 ~q_free~0)) (.cse22 (<= ~q_free~0 1)) (.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (not (= 2 |old(~c_dr_st~0)|))) (.cse31 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (< 1 |old(~q_free~0)|)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse9 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse10 .cse4 .cse8) (or .cse0 .cse1 .cse3 .cse5 .cse11 .cse10 .cse4 .cse8) (or .cse0 .cse1 .cse3 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse6 .cse10 .cse8) (or (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse14 .cse19 .cse20 .cse4 .cse17 .cse18 .cse21 .cse22 .cse23) .cse1 .cse24 .cse3 (and .cse14 .cse16 .cse19 .cse25 .cse17 .cse18 .cse26 .cse27) .cse11 .cse28 .cse29 .cse0 .cse30 .cse10 .cse8) (or .cse0 .cse1 .cse3 .cse24 .cse12 .cse11 .cse10 .cse8) (or .cse1 .cse3 (and .cse14 .cse16 .cse19 .cse25 .cse4 .cse17 .cse18 .cse26 .cse27) .cse11 .cse28 .cse29 (= 0 ~q_write_ev~0) .cse30 .cse5 .cse10 .cse8) (or .cse1 .cse3 .cse11 .cse28 .cse29 .cse0 .cse30 .cse5 .cse8 (and .cse14 .cse19 .cse25 .cse4 .cse17 .cse18 .cse26 .cse27)) (or .cse0 (and .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse10) .cse8) (or (and .cse14 .cse19 .cse16 .cse25 .cse20 .cse4 .cse17 .cse18 .cse21 .cse22) (or .cse0 (or .cse1 .cse2 .cse3 .cse5 .cse7 .cse10) .cse28 .cse31 .cse8)) (or (and .cse13 .cse14 .cse15 .cse17 .cse18 .cse21 .cse22 .cse23) .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9) (let ((.cse35 (= ~c_dr_pc~0 0)) (.cse36 (= ~c_num_read~0 0)) (.cse37 (<= .cse44 ~q_free~0)) (.cse40 (<= 1 eval_~tmp___1~0)) (.cse38 (= 0 ~p_num_write~0))) (or (and .cse14 .cse4 .cse32 .cse21 .cse33 .cse19 .cse18 .cse22 .cse23) (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and .cse34 .cse35 .cse15 .cse16 .cse18 .cse36 .cse37 .cse22 .cse23 .cse38) .cse39 (and (= ~p_dw_st~0 2) .cse33 .cse35 .cse19 .cse18 .cse36 .cse26 .cse40) (not (= 0 |old(~c_num_read~0)|)) (< .cse41 |old(~q_free~0)|) .cse9 (< |old(~q_free~0)| .cse41) .cse1 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (and .cse14 .cse4 .cse42 (<= ~p_num_write~0 1) .cse19 .cse18 .cse36 .cse26) .cse43 (and .cse34 .cse4 .cse15 (= |old(~c_num_read~0)| ~c_num_read~0) .cse16 .cse18 .cse37 .cse22 .cse40 .cse23 .cse38) .cse10 (not (= 0 |old(~c_dr_pc~0)|)))) (or .cse45 .cse1 .cse12 .cse39) (or .cse0 (and .cse22 .cse21) (or .cse1 .cse2 .cse3 .cse12 .cse11 .cse7 .cse10) .cse8) (or (and .cse14 .cse19 .cse4 .cse17 .cse18 .cse42 (<= ~p_num_write~0 .cse46) .cse26 .cse27) (and (or .cse0 .cse28 (or .cse1 .cse2 .cse3 .cse5 .cse11 .cse43 .cse7 .cse10) .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse28 .cse43 .cse31 .cse7 .cse9)) (or (and .cse19 .cse16 .cse25 .cse20 .cse34 .cse4 .cse17 .cse18 .cse21 .cse22) (and .cse19 .cse25 .cse20 .cse34 .cse4 .cse17 .cse18 .cse21 .cse22 .cse23))) (or .cse1 .cse3 .cse11 .cse0 .cse2 .cse12 (not (= 1 |old(~p_num_write~0)|)) .cse6 .cse7 (not (= 1 |old(~c_num_read~0)|)) (and .cse32 .cse33) .cse8 .cse9) (or .cse1 .cse3 .cse11 .cse28 .cse0 .cse2 (and .cse14 .cse19 .cse25 .cse20 .cse4 .cse17 .cse18 .cse21 .cse22 .cse23) .cse5 .cse31 .cse7 .cse8 .cse9)))) [2018-12-03 01:50:54,476 INFO L444 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse25 (+ |old(~c_num_read~0)| 1)) (.cse15 (= |old(~p_dw_pc~0)| 1))) (let ((.cse16 (= 1 |old(~c_dr_pc~0)|)) (.cse21 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse20 (not (= 0 ~c_dr_st~0))) (.cse19 (<= 2 ~p_dw_st~0)) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= ~q_free~0 0)) (.cse18 (<= 1 eval_~tmp___1~0)) (.cse14 (= 0 |old(~c_dr_st~0)|)) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (< |old(~q_free~0)| 1)) (.cse7 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse8 (< 1 |old(~q_free~0)|)) (.cse9 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse4 (not (= ~q_read_ev~0 2))) (.cse5 (not .cse15)) (.cse12 (not (= .cse25 |old(~p_num_write~0)|))) (.cse10 (not (= 0 |old(~q_req_up~0)|))) (.cse13 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse5 (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse10) .cse7) (or .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse12 .cse13) (or .cse0 (or .cse1 .cse2 .cse3 .cse8 .cse10) .cse7 .cse13) (or .cse0 .cse1 .cse14 .cse15 .cse10 .cse13) (or .cse16 .cse1 .cse14) (or .cse0 .cse1 .cse14 .cse4 .cse10 .cse13) (or .cse0 .cse1 (not .cse16) .cse11 (and .cse17 (= |old(~c_num_read~0)| ~c_num_read~0) .cse18 (= |old(~p_num_write~0)| ~p_num_write~0) (and .cse19 (and .cse20 (and .cse21 (= 1 ~c_dr_pc~0) .cse22)))) .cse4 .cse5 .cse12 .cse10 .cse13) (let ((.cse23 (= ~c_dr_pc~0 0)) (.cse24 (= ~c_num_read~0 0))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and .cse20 (= ~p_dw_st~0 0) .cse23 .cse21 (= ~q_req_up~0 0) .cse22 .cse24 (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) .cse18 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse25 |old(~q_free~0)|) .cse9 (< |old(~q_free~0)| .cse25) .cse1 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse6 (and .cse20 .cse19 (= ~p_num_write~0 1) .cse23 (= ~p_dw_pc~0 1) .cse22 .cse24 .cse17 .cse18) .cse10 (not (= 0 |old(~c_dr_pc~0)|)))) (or .cse0 .cse1 .cse2 .cse14 .cse15 .cse8 .cse13 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse13 .cse9) (or .cse1 .cse11 .cse3 .cse4 .cse5 .cse12 .cse10 (= 0 ~q_write_ev~0) .cse13)))) [2018-12-03 01:50:54,476 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2018-12-03 01:50:54,477 INFO L444 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse20 (= 1 ~c_dr_pc~0)) (.cse19 (not (= ~q_read_ev~0 2))) (.cse11 (+ ~c_num_read~0 1))) (let ((.cse4 (not (= ~p_dw_st~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (= .cse11 ~p_num_write~0))) (.cse17 (not (= 1 ~p_dw_pc~0))) (.cse18 (not (= ~q_free~0 0))) (.cse13 (or (not .cse20) .cse19)) (.cse7 (= ~p_dw_pc~0 1)) (.cse3 (not (= 2 ~c_dr_st~0))) (.cse9 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse10 (not (= ~q_read_ev~0 1))) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (< ~q_free~0 1)) (.cse15 (= 0 ~c_dr_st~0)) (.cse5 (< 1 ~q_free~0)) (.cse6 (not (= 0 ~q_req_up~0))) (.cse14 (< ~p_dw_st~0 2)) (.cse8 (not (= ~c_num_read~0 ~p_num_write~0)))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not .cse7) .cse8) .cse9 .cse10) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse11 ~q_free~0) .cse12 (< ~q_free~0 .cse11) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (= is_do_read_c_triggered_~__retres1~1 0) .cse4 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse9 .cse1 .cse0 .cse2 .cse3 .cse13 .cse8 .cse5 .cse14 .cse12) (or .cse0 .cse1 .cse2 .cse15 .cse9 .cse7 .cse5 .cse14 .cse12) (or .cse9 .cse1 .cse16 .cse17 .cse0 .cse18 .cse3 .cse13 .cse14) (or .cse1 (= 1 ~q_write_ev~0) .cse9 .cse16 (= 0 ~q_write_ev~0) .cse17 .cse18 .cse3 .cse13 .cse6 .cse14) (or .cse0 .cse1 .cse9 .cse15 .cse19 .cse6 .cse14) (or .cse0 .cse1 .cse9 .cse15 .cse7 .cse6 .cse14) (or (or .cse8 (or .cse0 (or (or .cse1 .cse2 .cse3 .cse5) .cse6) .cse14)) .cse9) (or .cse9 .cse1 .cse15 .cse20) (or .cse9 .cse10 (or .cse0 (or .cse1 .cse2 .cse15 .cse5 .cse6) .cse14) .cse8)))) [2018-12-03 01:50:54,477 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2018-12-03 01:50:54,477 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-12-03 01:50:54,477 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2018-12-03 01:50:54,477 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2018-12-03 01:50:54,477 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2018-12-03 01:50:54,477 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1))) (let ((.cse0 (= ~q_free~0 0)) (.cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse10 (not (= 0 ~c_dr_st~0))) (.cse11 (not .cse3)) (.cse8 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 2 ~q_read_ev~0)) (.cse12 (<= ~q_free~0 1)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (= 2 ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 1 ~q_free~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse15 (= ~c_num_read~0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) (and .cse4 .cse5 .cse6 .cse7)) (< .cse8 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and .cse0 .cse1 .cse3 (and (and .cse5 .cse6 .cse7) .cse2 .cse9)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse2 .cse9 (and .cse10 .cse4 .cse6 .cse7)) (and .cse10 .cse2 .cse9 .cse11 .cse4 .cse6) (not (= 0 |old(~c_dr_pc~0)|)) (and (not (= ~c_dr_pc~0 1)) .cse10 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse10 .cse2 .cse11 .cse9 .cse12 .cse13 .cse6 .cse14) (< |old(~q_free~0)| .cse8) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse2 .cse9 .cse15 (and .cse12 .cse13 .cse5 .cse6 .cse7 .cse14)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (and (and (and .cse12 .cse4 .cse5 .cse6 .cse14) .cse2 .cse9) .cse15)))) [2018-12-03 01:50:54,477 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-12-03 01:50:54,477 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1)) (.cse17 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~q_free~0 0)) (.cse1 (= .cse17 ~p_num_write~0)) (.cse10 (not (= 0 ~c_dr_st~0))) (.cse11 (not .cse3)) (.cse8 (+ |old(~c_num_read~0)| 1)) (.cse7 (= 2 ~q_read_ev~0)) (.cse5 (= 2 ~c_dr_st~0)) (.cse16 (<= 1 ~q_free~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse15 (= ~p_dw_st~0 0)) (.cse4 (= ~q_req_up~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= ~q_free~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) (and .cse4 .cse5 .cse6 .cse7)) (< .cse8 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and .cse0 .cse1 .cse3 (and (and .cse5 .cse6 .cse7) .cse2 .cse9)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse0 (and (= 1 ~c_dr_pc~0) .cse6 .cse7) .cse1 .cse2 .cse9 .cse4 .cse3) (and .cse2 .cse9 (and .cse10 .cse4 .cse6 .cse7)) (and .cse10 .cse2 .cse9 .cse11 .cse4 .cse6) (and .cse9 .cse3 .cse12 (and .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse16)) (not (= 0 |old(~c_dr_pc~0)|)) (and (not (= ~c_dr_pc~0 1)) .cse10 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse10 .cse2 .cse11 .cse9 .cse13 .cse14 .cse6 .cse16) (< |old(~q_free~0)| .cse8) (not (= 2 |old(~q_write_ev~0)|)) (and .cse3 .cse12 (and (and .cse13 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16) .cse9)) (not (= 0 |old(~p_num_write~0)|)) (and .cse2 .cse9 .cse12 (and .cse13 .cse14 .cse5 .cse6 .cse7 .cse16)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (and (and (and .cse13 .cse4 .cse5 .cse6 .cse16) .cse2 .cse9) .cse12) (and .cse15 (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse4 .cse6 (= ~c_num_read~0 0) (<= .cse17 ~q_free~0) .cse13 .cse14 (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0))))) [2018-12-03 01:50:54,477 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-03 01:50:54,477 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2018-12-03 01:50:54,478 INFO L444 ceAbstractionStarter]: At program point L409-1(lines 406 431) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1)) (.cse17 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~q_free~0 0)) (.cse1 (= .cse17 ~p_num_write~0)) (.cse10 (not (= 0 ~c_dr_st~0))) (.cse11 (not .cse3)) (.cse8 (+ |old(~c_num_read~0)| 1)) (.cse7 (= 2 ~q_read_ev~0)) (.cse5 (= 2 ~c_dr_st~0)) (.cse16 (<= 1 ~q_free~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse15 (= ~p_dw_st~0 0)) (.cse4 (= ~q_req_up~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= ~q_free~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) (and .cse4 .cse5 .cse6 .cse7)) (< .cse8 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and .cse0 .cse1 .cse3 (and (and .cse5 .cse6 .cse7) .cse2 .cse9)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse0 (and (= 1 ~c_dr_pc~0) .cse6 .cse7) .cse1 .cse2 .cse9 .cse4 .cse3) (and .cse2 .cse9 (and .cse10 .cse4 .cse6 .cse7)) (and .cse10 .cse2 .cse9 .cse11 .cse4 .cse6) (and .cse9 .cse3 .cse12 (and .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse16)) (not (= 0 |old(~c_dr_pc~0)|)) (and (not (= ~c_dr_pc~0 1)) .cse10 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse10 .cse2 .cse11 .cse9 .cse13 .cse14 .cse6 .cse16) (< |old(~q_free~0)| .cse8) (not (= 2 |old(~q_write_ev~0)|)) (and .cse3 .cse12 (and (and .cse13 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16) .cse9)) (not (= 0 |old(~p_num_write~0)|)) (and .cse2 .cse9 .cse12 (and .cse13 .cse14 .cse5 .cse6 .cse7 .cse16)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (and (and (and .cse13 .cse4 .cse5 .cse6 .cse16) .cse2 .cse9) .cse12) (and .cse15 (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse4 .cse6 (= ~c_num_read~0 0) (<= .cse17 ~q_free~0) .cse13 .cse14 (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0))))) [2018-12-03 01:50:54,478 INFO L444 ceAbstractionStarter]: At program point L405(line 405) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-03 01:50:54,478 INFO L444 ceAbstractionStarter]: At program point L403(line 403) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-03 01:50:54,482 INFO L451 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2018-12-03 01:50:54,482 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-12-03 01:50:54,482 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-12-03 01:50:54,483 INFO L444 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 1))) (let ((.cse5 (= ~p_dw_st~0 0)) (.cse9 (= ~q_read_ev~0 1)) (.cse10 (not (= 0 ~c_dr_st~0))) (.cse17 (not .cse2)) (.cse15 (+ |old(~c_num_read~0)| 1)) (.cse12 (= ~q_free~0 0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= 2 ~q_read_ev~0)) (.cse1 (<= ~q_free~0 1)) (.cse3 (= ~q_req_up~0 0)) (.cse6 (= 2 ~c_dr_st~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 1 ~q_free~0)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse4 (= ~c_num_read~0 ~p_num_write~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (not (= ~p_dw_i~0 1)) (and (and .cse10 .cse1 .cse3 .cse7 .cse8) .cse11 .cse0 .cse4 .cse9) (not (= 1 ~c_dr_i~0)) (and .cse12 .cse13 .cse11 .cse2 (not (= 0 ~q_write_ev~0)) (and .cse3 .cse6 .cse7 .cse14)) (< .cse15 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and .cse12 .cse13 .cse2 (and (and .cse6 .cse7 .cse14) .cse11 .cse0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse16 .cse9) (and .cse11 .cse0 (and .cse10 .cse3 .cse7 .cse14)) (and .cse10 .cse11 .cse0 .cse17 .cse3 .cse7) (not (= 0 |old(~c_dr_pc~0)|)) (and (not (= ~c_dr_pc~0 1)) .cse10 .cse7) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse10 .cse11 .cse17 .cse0 .cse1 .cse16 .cse7 .cse8) (< |old(~q_free~0)| .cse15) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse12 (and (= 1 ~c_dr_pc~0) .cse7 .cse14) .cse13 .cse11 .cse3 .cse2 (= 1 ~q_write_ev~0)) (and .cse11 .cse0 .cse4 (and .cse1 .cse16 .cse6 .cse7 .cse14 .cse8)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (and (and (and .cse1 .cse3 .cse6 .cse7 .cse8) .cse11 .cse0) .cse4)))) [2018-12-03 01:50:54,483 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 395 437) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-03 01:50:54,485 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-03 01:50:54,486 INFO L444 ceAbstractionStarter]: At program point L404(line 404) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-03 01:50:54,486 INFO L444 ceAbstractionStarter]: At program point L402(line 402) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-03 01:50:54,486 INFO L444 ceAbstractionStarter]: At program point L402-1(line 402) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-03 01:50:54,488 INFO L444 ceAbstractionStarter]: At program point L423(line 423) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1))) (let ((.cse0 (= ~q_free~0 0)) (.cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse10 (not (= 0 ~c_dr_st~0))) (.cse11 (not .cse3)) (.cse8 (+ |old(~c_num_read~0)| 1)) (.cse15 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 2 ~q_read_ev~0)) (.cse13 (<= ~q_free~0 1)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (= 2 ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (<= 1 ~q_free~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) (and .cse4 .cse5 .cse6 .cse7)) (< .cse8 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and .cse0 .cse1 .cse3 (and (and .cse5 .cse6 .cse7) .cse2 .cse9)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse0 (and (= 1 ~c_dr_pc~0) .cse6 .cse7) .cse1 .cse2 .cse9 .cse4 .cse3) (and .cse2 .cse9 (and .cse10 .cse4 .cse6 .cse7)) (and .cse10 .cse2 .cse9 .cse11 .cse4 .cse6) (and .cse9 .cse3 .cse12 (and .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse16)) (not (= 0 |old(~c_dr_pc~0)|)) (and (not (= ~c_dr_pc~0 1)) .cse10 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse10 .cse2 .cse11 .cse9 .cse13 .cse14 .cse6 .cse16) (< |old(~q_free~0)| .cse8) (not (= 2 |old(~q_write_ev~0)|)) (and .cse3 .cse12 (and (and .cse13 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16) .cse9)) (not (= 0 |old(~p_num_write~0)|)) (and .cse2 .cse9 .cse12 (and .cse13 .cse14 .cse5 .cse6 .cse7 .cse16)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (and (and (and .cse13 .cse4 .cse5 .cse6 .cse16) .cse2 .cse9) .cse12)))) [2018-12-03 01:50:54,489 INFO L444 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1))) (let ((.cse0 (= ~q_free~0 0)) (.cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse10 (not (= 0 ~c_dr_st~0))) (.cse11 (not .cse3)) (.cse8 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 2 ~q_read_ev~0)) (.cse12 (<= ~q_free~0 1)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (= 2 ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 1 ~q_free~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse15 (= ~c_num_read~0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7)) (< .cse8 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and .cse0 .cse1 .cse3 (and (and .cse5 .cse6 .cse7) .cse2 .cse9)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse2 .cse9 (and .cse10 .cse4 .cse6 .cse7)) (and .cse10 .cse2 .cse9 .cse11 .cse4 .cse6) (not (= 0 |old(~c_dr_pc~0)|)) (and (not (= ~c_dr_pc~0 1)) .cse10 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse10 .cse2 .cse11 .cse9 .cse12 .cse13 .cse6 .cse14) (< |old(~q_free~0)| .cse8) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse2 .cse9 .cse15 (and .cse12 .cse13 .cse5 .cse6 .cse7 .cse14)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (and (and (and .cse12 .cse4 .cse5 .cse6 .cse14) .cse2 .cse9) .cse15)))) [2018-12-03 01:50:54,490 INFO L444 ceAbstractionStarter]: At program point L421-1(line 421) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1))) (let ((.cse0 (= ~q_free~0 0)) (.cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse10 (not (= 0 ~c_dr_st~0))) (.cse11 (not .cse3)) (.cse8 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 2 ~q_read_ev~0)) (.cse12 (<= ~q_free~0 1)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (= 2 ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 1 ~q_free~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse15 (= ~c_num_read~0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) (and .cse4 .cse5 .cse6 .cse7)) (< .cse8 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and .cse0 .cse1 .cse3 (and (and .cse5 .cse6 .cse7) .cse2 .cse9)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse2 .cse9 (and .cse10 .cse4 .cse6 .cse7)) (and .cse10 .cse2 .cse9 .cse11 .cse4 .cse6) (not (= 0 |old(~c_dr_pc~0)|)) (and (not (= ~c_dr_pc~0 1)) .cse10 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse10 .cse2 .cse11 .cse9 .cse12 .cse13 .cse6 .cse14) (< |old(~q_free~0)| .cse8) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse2 .cse9 .cse15 (and .cse12 .cse13 .cse5 .cse6 .cse7 .cse14)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (and (and (and .cse12 .cse4 .cse5 .cse6 .cse14) .cse2 .cse9) .cse15)))) [2018-12-03 01:50:54,490 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 261 278) the Hoare annotation is: (let ((.cse17 (+ ~c_num_read~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse18 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse13 (and .cse18 .cse19)) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (< ~q_free~0 1)) (.cse7 (< 1 ~q_free~0)) (.cse6 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse2 (< |old(~q_write_ev~0)| 2)) (.cse14 (= 0 ~c_dr_st~0)) (.cse4 (and .cse19 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse12 (not (= ~q_free~0 0))) (.cse5 (not (= 2 ~c_dr_st~0))) (.cse1 (not (= |old(~q_read_ev~0)| 2))) (.cse10 (not .cse15)) (.cse11 (not (= .cse17 ~p_num_write~0))) (.cse16 (not (= 0 ~q_req_up~0))) (.cse8 (< ~p_dw_st~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse10 .cse11 .cse2 .cse12 .cse5 .cse8 .cse4) (or .cse13 .cse2 .cse0 .cse3 .cse14 .cse15 .cse7 .cse8 .cse9) (or .cse2 .cse0 .cse14 .cse13 .cse15 .cse16 .cse8) (or (= 1 ~c_dr_pc~0) .cse0 .cse13 .cse14) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_read_ev~0 ~q_write_ev~0)) (not (= 0 ~c_num_read~0)) (< .cse17 ~q_free~0) .cse9 (< ~q_free~0 .cse17) .cse0 (not (= 2 |old(~q_write_ev~0)|)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_dw_st~0 0)) .cse16 (not (= 0 ~c_dr_pc~0))) (or .cse4 (or .cse2 (or .cse0 .cse3 .cse5 .cse7 .cse16) .cse6 .cse8)) (or .cse2 .cse0 (and .cse18 (= 2 ~q_read_ev~0)) .cse14 .cse1 .cse16 .cse8) (or .cse4 .cse0 .cse12 .cse5 .cse1 .cse10 .cse11 .cse16 .cse8)))) [2018-12-03 01:50:54,493 INFO L448 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2018-12-03 01:50:54,493 INFO L448 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2018-12-03 01:50:54,493 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2018-12-03 01:50:54,494 INFO L444 ceAbstractionStarter]: At program point update_channelsENTRY(lines 208 222) the Hoare annotation is: (let ((.cse17 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse2 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse3 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse21 (+ ~c_num_read~0 1)) (.cse20 (= ~p_dw_pc~0 1))) (let ((.cse5 (not .cse20)) (.cse6 (not (= .cse21 ~p_num_write~0))) (.cse7 (not (= ~q_free~0 0))) (.cse13 (and .cse2 .cse3)) (.cse4 (not (= |old(~q_read_ev~0)| 2))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (and .cse17 .cse2)) (.cse22 (= 1 ~c_dr_pc~0)) (.cse18 (= 0 ~c_dr_st~0)) (.cse1 (= ~q_req_up~0 0)) (.cse11 (< |old(~q_write_ev~0)| 2)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse12 (< ~q_free~0 1)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse15 (< 1 ~q_free~0)) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse14 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse10 (< ~p_dw_st~0 2))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 (= 0 |old(~q_write_ev~0)|) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse4 .cse11 .cse12 .cse13 .cse8 .cse14 .cse15 .cse10 .cse16) (or .cse0 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse10 .cse13) (or .cse11 .cse0 (and .cse17 .cse1 (= 2 ~q_read_ev~0)) .cse18 .cse4 .cse9 .cse10) (or .cse19 .cse11 .cse0 .cse12 .cse18 .cse20 .cse15 .cse10 .cse16) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse1 (= ~q_read_ev~0 ~q_write_ev~0)) (not (= 0 ~c_num_read~0)) (< .cse21 ~q_free~0) .cse16 (< ~q_free~0 .cse21) .cse0 (not (= 2 |old(~q_write_ev~0)|)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_dw_st~0 0)) .cse9 (not (= 0 ~c_dr_pc~0))) (or .cse11 .cse0 .cse18 (and .cse17 .cse1 .cse2) .cse20 .cse9 .cse10) (or .cse22 .cse0 .cse19 .cse18) (or .cse22 .cse0 .cse1 .cse18 .cse9) (or (and (and .cse1 .cse2) .cse3) (or .cse11 (or .cse0 .cse12 .cse8 .cse15 .cse9) .cse14 .cse10))))) [2018-12-03 01:50:54,498 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2018-12-03 01:50:54,498 INFO L444 ceAbstractionStarter]: At program point L214(line 214) the Hoare annotation is: (let ((.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse18 (+ ~c_num_read~0 1)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse1 (not (= ~q_free~0 0))) (.cse4 (not .cse12)) (.cse5 (not (= .cse18 ~p_num_write~0))) (.cse15 (= 1 ~c_dr_pc~0)) (.cse8 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse19)) (.cse11 (= 0 ~c_dr_st~0)) (.cse16 (and .cse19 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse3 (not (= |old(~q_read_ev~0)| 2))) (.cse9 (< |old(~q_write_ev~0)| 2)) (.cse10 (< ~q_free~0 1)) (.cse2 (not (= 2 ~c_dr_st~0))) (.cse17 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse13 (< 1 ~q_free~0)) (.cse7 (< ~p_dw_st~0 2)) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse6 (not (= 0 |old(~q_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 |old(~q_write_ev~0)|) .cse7) (or .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse7 .cse14) (or .cse15 .cse0 .cse11 .cse6) (or .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7) (or .cse9 .cse0 .cse11 .cse3 .cse6 .cse7) (or .cse9 .cse0 .cse11 .cse12 .cse6 .cse7) (or .cse9 (or .cse0 .cse10 .cse2 .cse13 .cse6) .cse17 .cse7) (or .cse15 .cse0 .cse8 .cse11) (or .cse0 .cse16 .cse3 .cse9 .cse10 .cse2 .cse17 .cse13 .cse7 .cse14) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse18 ~q_free~0) .cse14 (< ~q_free~0 .cse18) .cse0 (not (= 2 |old(~q_write_ev~0)|)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_dw_st~0 0)) .cse6 (not (= 0 ~c_dr_pc~0)))))) [2018-12-03 01:50:54,498 INFO L448 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2018-12-03 01:50:54,498 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 01:50:54,498 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~c_dr_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= 0 ~p_num_write~0)) [2018-12-03 01:50:54,500 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 01:50:54,500 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 01:50:54,500 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2018-12-03 01:50:54,500 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2018-12-03 01:50:54,500 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2018-12-03 01:50:54,500 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2018-12-03 01:50:54,500 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2018-12-03 01:50:54,500 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2018-12-03 01:50:54,500 INFO L444 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse5 (+ ~c_num_read~0 1)) (.cse10 (= ~p_dw_pc~0 1))) (let ((.cse8 (< ~q_write_ev~0 2)) (.cse9 (< ~q_free~0 1)) (.cse14 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse11 (< 1 ~q_free~0)) (.cse6 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= 1 ~c_dr_pc~0)) (.cse2 (= 0 ~c_dr_st~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse15 (not .cse10)) (.cse16 (not (= .cse5 ~p_num_write~0))) (.cse17 (not (= ~q_free~0 0))) (.cse13 (not (= 2 ~c_dr_st~0))) (.cse7 (not (= 0 ~q_req_up~0))) (.cse12 (< ~p_dw_st~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= ~p_dw_i~0 1)) (= is_do_write_p_triggered_~__retres1~0 0) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse5 ~q_free~0) .cse6 (< ~q_free~0 .cse5) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (not (= ~p_dw_st~0 0)) .cse7 (not (= 0 ~c_dr_pc~0))) (or .cse4 .cse8 .cse1 .cse9 .cse2 .cse10 .cse11 .cse12 .cse6) (or (= ~q_read_ev~0 1) (or .cse8 (or .cse1 .cse9 (not .cse0) .cse13 .cse11 .cse7) .cse14 .cse12) .cse4) (or .cse1 .cse4 .cse3 .cse15 .cse16 .cse8 .cse17 .cse13 .cse12) (or .cse8 .cse1 .cse4 .cse2 .cse3 .cse7 .cse12) (or .cse8 .cse1 .cse4 .cse2 .cse10 .cse7 .cse12) (or .cse1 .cse3 .cse4 .cse8 .cse9 .cse13 .cse14 .cse11 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse2 (and (= 1 ~p_dw_pc~0) (not (= 0 ~q_read_ev~0)))) (or .cse1 .cse4 .cse3 .cse15 .cse16 (= 0 ~q_write_ev~0) .cse17 .cse13 .cse7 .cse12)))) [2018-12-03 01:50:54,501 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2018-12-03 01:50:54,501 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2018-12-03 01:50:54,501 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2018-12-03 01:50:54,501 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2018-12-03 01:50:54,501 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2018-12-03 01:50:54,501 INFO L444 ceAbstractionStarter]: At program point L193(line 193) the Hoare annotation is: (let ((.cse1 (+ |old(~c_num_read~0)| 1)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (not (= ~q_read_ev~0 2))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse3 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse0 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (= 0 |old(~c_dr_pc~0)|))) (.cse6 (< ~p_dw_st~0 2))) (and (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) .cse0 (< .cse1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse1) .cse2 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse3 .cse4 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse5) (or (or (< ~q_write_ev~0 2) .cse6 (or (or .cse2 (not (= 1 |old(~c_dr_pc~0)|))) .cse4 .cse7)) .cse8 .cse9 (not (= .cse1 ~p_num_write~0))) (or .cse2 .cse7 .cse9 .cse3 .cse8 .cse4 (not (= 1 ~p_num_write~0)) .cse0 .cse5 .cse6))) [2018-12-03 01:50:54,502 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2018-12-03 01:50:54,502 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 155 207) the Hoare annotation is: (let ((.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (not (= 0 |old(~c_num_read~0)|))) (.cse3 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (not (= 0 |old(~c_dr_pc~0)|))) (.cse12 (< ~p_dw_st~0 2)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse1 (not (= ~q_read_ev~0 2))) (.cse4 (not (= |old(~q_free~0)| 0))) (.cse2 (not (= ~p_dw_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse6 (not (= 0 ~c_dr_st~0))) (.cse13 (+ |old(~c_num_read~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9) (not (= 1 ~p_num_write~0)) .cse10 .cse11 .cse12) (or (and .cse6 .cse7 (= ~q_req_up~0 0) .cse8 (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) .cse10 (< .cse13 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse13) .cse0 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse3 .cse5 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse11) (or (or (< ~q_write_ev~0 2) .cse12 (or (or .cse0 (not (= 1 |old(~c_dr_pc~0)|))) .cse5 .cse1)) .cse4 .cse2 (and .cse9 (= |old(~c_num_read~0)| ~c_num_read~0) (and .cse6 (= 1 ~c_dr_pc~0))) (not (= .cse13 ~p_num_write~0))))) [2018-12-03 01:50:54,502 INFO L448 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2018-12-03 01:50:54,503 INFO L444 ceAbstractionStarter]: At program point L202(lines 155 207) the Hoare annotation is: (let ((.cse1 (+ |old(~c_num_read~0)| 1)) (.cse6 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse12 (not (= ~q_read_ev~0 2))) (.cse14 (not (= ~p_dw_pc~0 1))) (.cse7 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse2 (= 2 ~c_dr_st~0)) (.cse10 (<= 1 ~q_free~0)) (.cse3 (= 1 ~c_dr_pc~0)) (.cse4 (<= ~q_free~0 1)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (not (= |old(~q_free~0)| 0))) (.cse8 (= 0 |old(~c_dr_st~0)|)) (.cse0 (not (= 0 |old(~c_num_read~0)|))) (.cse9 (not (= 0 |old(~c_dr_pc~0)|))) (.cse11 (< ~p_dw_st~0 2))) (and (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) .cse0 (< .cse1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (and .cse2 (= |old(~c_num_read~0)| ~c_num_read~0) (= ~q_req_up~0 0) .cse3 (<= (+ ~c_num_read~0 1) ~q_free~0) .cse4 .cse5) (< |old(~q_free~0)| .cse1) .cse6 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse7 .cse8 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse9) (or (and (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse10 .cse4 .cse5) (or (< ~q_write_ev~0 2) .cse11 (or (or .cse6 (not (= 1 |old(~c_dr_pc~0)|))) .cse8 .cse12)) .cse13 .cse14 (not (= .cse1 ~p_num_write~0))) (or .cse6 .cse12 .cse14 .cse7 (and .cse2 (= ~c_num_read~0 1) .cse10 .cse3 .cse4 .cse5) .cse13 .cse8 (not (= 1 ~p_num_write~0)) .cse0 .cse9 .cse11))) [2018-12-03 01:50:54,503 INFO L444 ceAbstractionStarter]: At program point L198(line 198) the Hoare annotation is: (let ((.cse1 (+ |old(~c_num_read~0)| 1)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (not (= ~q_read_ev~0 2))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse3 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse0 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (= 0 |old(~c_dr_pc~0)|))) (.cse6 (< ~p_dw_st~0 2))) (and (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) .cse0 (< .cse1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse1) .cse2 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse3 .cse4 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse5) (or (or (< ~q_write_ev~0 2) .cse6 (or (or .cse2 (not (= 1 |old(~c_dr_pc~0)|))) .cse4 .cse7)) .cse8 .cse9 (not (= .cse1 ~p_num_write~0))) (or .cse2 .cse7 .cse9 .cse3 .cse8 .cse4 (not (= 1 ~p_num_write~0)) .cse0 .cse5 .cse6))) [2018-12-03 01:50:54,503 INFO L444 ceAbstractionStarter]: At program point L198-1(lines 158 206) the Hoare annotation is: (let ((.cse1 (+ |old(~c_num_read~0)| 1)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse12 (not (= ~q_read_ev~0 2))) (.cse14 (not (= ~p_dw_pc~0 1))) (.cse3 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse15 (<= 1 ~q_free~0)) (.cse8 (<= ~q_free~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (not (= |old(~q_free~0)| 0))) (.cse5 (not (= 0 ~c_dr_st~0))) (.cse7 (= ~c_num_read~0 0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse0 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (= 0 |old(~c_dr_pc~0)|))) (.cse11 (< ~p_dw_st~0 2))) (and (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) .cse0 (< .cse1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse1) .cse2 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse3 .cse4 (not (= ~p_dw_st~0 0)) (and .cse5 .cse6 (= ~q_req_up~0 0) .cse7 (<= (+ ~c_num_read~0 1) ~q_free~0) .cse8 .cse9) (not (= 0 |old(~q_req_up~0)|)) .cse10) (or (or (< ~q_write_ev~0 2) .cse11 (or (or .cse2 (not (= 1 |old(~c_dr_pc~0)|))) .cse4 .cse12)) .cse13 .cse14 (not (= .cse1 ~p_num_write~0)) (and .cse5 (= ~c_num_read~0 ~p_num_write~0) .cse15 .cse8 .cse9)) (or .cse2 .cse12 .cse14 .cse3 (and .cse5 (= ~c_num_read~0 1) .cse15 .cse8 .cse9) .cse13 (and .cse5 .cse7 (= ~q_free~0 0) .cse6) .cse4 (not (= 1 ~p_num_write~0)) .cse0 .cse10 .cse11))) [2018-12-03 01:50:54,503 INFO L444 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse3 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse0 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (= 0 |old(~c_dr_pc~0)|))) (.cse9 (< ~p_dw_st~0 2)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse1 (+ |old(~c_num_read~0)| 1))) (and (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) .cse0 (< .cse1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse1) .cse2 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse3 .cse4 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse5) (or .cse2 .cse6 .cse7 .cse3 .cse8 .cse4 (not (= 1 ~p_num_write~0)) .cse0 .cse5 .cse9) (or (or (< ~q_write_ev~0 2) .cse9 (or (or .cse2 (not (= 1 |old(~c_dr_pc~0)|))) .cse4 .cse6)) .cse8 .cse7 (and (= ~q_free~0 0) (= |old(~c_num_read~0)| ~c_num_read~0) (and (not (= 0 ~c_dr_st~0)) (= 1 ~c_dr_pc~0))) (not (= .cse1 ~p_num_write~0))))) [2018-12-03 01:50:54,505 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2018-12-03 01:50:54,505 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2018-12-03 01:50:54,505 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 438 454) the Hoare annotation is: (or (not (= ~q_buf_0~0 ~p_last_write~0)) (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~c_dr_pc~0 0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 0)) (not (= ~p_dw_st~0 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 ~q_req_up~0)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= 0 ~c_dr_st~0))) [2018-12-03 01:50:54,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:50:54 BoogieIcfgContainer [2018-12-03 01:50:54,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:50:54,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:50:54,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:50:54,536 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:50:54,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:49:25" (3/4) ... [2018-12-03 01:50:54,539 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-03 01:50:54,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-03 01:50:54,544 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-12-03 01:50:54,544 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-12-03 01:50:54,544 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-03 01:50:54,547 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-03 01:50:54,548 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 01:50:54,565 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || (((((q_free == 0 && c_num_read + 1 == p_num_write) && 2 <= p_dw_st) && p_dw_pc == 1) && !(0 == q_write_ev)) && ((q_req_up == 0 && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev)) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || (((q_free == 0 && c_num_read + 1 == p_num_write) && p_dw_pc == 1) && (((2 == c_dr_st && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_dw_pc) == 0)) || !(\old(q_read_ev) == \old(q_write_ev))) || ((((((q_free == 0 && (1 == c_dr_pc && p_last_write == q_buf_0) && 2 == q_read_ev) && c_num_read + 1 == p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && q_req_up == 0) && p_dw_pc == 1)) || ((2 <= p_dw_st && 2 <= q_write_ev) && ((!(0 == c_dr_st) && q_req_up == 0) && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && q_req_up == 0) && p_last_write == q_buf_0)) || (((2 <= q_write_ev && p_dw_pc == 1) && c_num_read == p_num_write) && (((((q_free <= 1 && c_last_read == p_last_write) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free)) || !(0 == \old(c_dr_pc))) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || \old(q_free) < 1) || \old(p_num_write) + 1 < \old(q_free)) || (((((((!(0 == c_dr_st) && 2 <= p_dw_st) && !(p_dw_pc == 1)) && 2 <= q_write_ev) && q_free <= 1) && c_last_read == p_last_write) && p_last_write == q_buf_0) && 1 <= q_free)) || \old(q_free) < \old(c_num_read) + 1) || !(2 == \old(q_write_ev))) || ((p_dw_pc == 1 && c_num_read == p_num_write) && ((((((q_free <= 1 && q_req_up == 0) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && 2 <= q_write_ev)) || !(0 == \old(p_num_write))) || (((2 <= p_dw_st && 2 <= q_write_ev) && c_num_read == p_num_write) && ((((q_free <= 1 && c_last_read == p_last_write) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || (((((((q_free <= 1 && q_req_up == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 <= q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_num_read == p_num_write)) || (((((((((((p_dw_st == 0 && c_dr_pc == 0) && p_dw_pc == \old(p_dw_pc)) && q_read_ev == \old(q_read_ev)) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && q_read_ev == q_write_ev) && 0 == p_num_write) [2018-12-03 01:50:54,566 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((((((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && p_dw_pc == 1) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || !(1 == \old(c_dr_pc))) || (((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || ((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || ((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) < 2) || (((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write))) && (((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((2 <= p_dw_st && p_dw_pc == 1) && q_req_up == 0) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) || (((q_write_ev < 2 || ((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || \old(p_dw_st) < 2)) && ((((((((((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((((((((((2 <= p_dw_st && 2 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free <= 1) && c_last_read == p_last_write) || !(p_dw_i == 1)) || !(1 == c_dr_i)) || (((((((((p_dw_st == 0 && c_dr_pc == 0) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((((((p_dw_st == 2 && p_num_write == 1) && c_dr_pc == 0) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 1 <= tmp___1)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || \old(q_free) < \old(c_num_read) + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((((2 <= p_dw_st && 2 == c_dr_st) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0)) || !(\old(p_dw_st) == 0)) || ((((((((((p_dw_st == 0 && 2 == c_dr_st) && p_dw_pc == \old(p_dw_pc)) && \old(c_num_read) == c_num_read) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= 1) && 1 <= tmp___1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && (((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || 0 == \old(c_dr_st)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((q_write_ev < 2 || (q_free <= 1 && 1 <= q_free)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((2 <= p_dw_st && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && c_num_read + 1 == p_num_write) || ((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(c_num_read) == \old(p_num_write))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))))) || (((((((((p_dw_pc == 1 && q_req_up == 0) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) || (((((((((p_dw_pc == 1 && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || q_write_ev < 2) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(1 == \old(c_num_read))) || (c_num_read == 1 && p_num_write == 1)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || q_write_ev < 2) || \old(q_free) < 1) || (((((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) [2018-12-03 01:50:54,566 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || ((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || ((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) < 2) || (((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write))) && (((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((2 <= p_dw_st && p_dw_pc == 1) && q_req_up == 0) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) || (((q_write_ev < 2 || ((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || \old(p_dw_st) < 2)) && ((((((((((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && (((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || 0 == \old(c_dr_st)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && ((((((((((((((((((((((((2 <= p_dw_st && 2 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free <= 1) && c_last_read == p_last_write) || !(p_dw_i == 1)) || !(1 == c_dr_i)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || \old(q_free) < \old(c_num_read) + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((((2 <= p_dw_st && 2 == c_dr_st) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && (((q_write_ev < 2 || (q_free <= 1 && 1 <= q_free)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((2 <= p_dw_st && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && c_num_read + 1 == p_num_write) || ((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(c_num_read) == \old(p_num_write))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))))) && (((((((((((((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && p_dw_pc == 1) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || q_write_ev < 2) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(1 == \old(c_num_read))) || (c_num_read == 1 && p_num_write == 1)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || q_write_ev < 2) || \old(q_free) < 1) || (((((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) [2018-12-03 01:50:54,566 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == c_dr_pc || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || 0 == c_dr_st) && ((!(c_num_read == \old(p_num_write)) || ((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1)) || (((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write))) && ((((((((\old(q_free) < c_num_read + 1 || (((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || (((((p_dw_pc == \old(p_dw_pc) && q_req_up == 0) && p_last_write == q_buf_0) && q_free <= 1) && p_num_write + 1 <= q_free) && 0 == p_num_write)) || \old(q_free) < \old(p_num_write) + 1) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || \old(p_num_write) + 1 < \old(q_free)) || ((((\old(p_num_write) + 1 <= p_num_write && p_num_write <= 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0)) || c_num_read + 1 < \old(q_free))) && (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((p_dw_pc == \old(p_dw_pc) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc)) || (((p_num_write == 1 && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0)) [2018-12-03 01:50:54,566 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || 0 == c_dr_st) || p_last_write == q_buf_0) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || p_dw_pc == \old(p_dw_pc)) || 0 == c_dr_st) || !(1 == \old(p_dw_pc)))) && (((((((\old(q_free) < c_num_read + 1 || (((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(q_free) < \old(p_num_write) + 1) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((2 <= p_dw_st && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0)) || \old(p_num_write) + 1 < \old(q_free)) || c_num_read + 1 < \old(q_free))) && (((((2 <= p_dw_st && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write) || !(c_num_read == \old(p_num_write)) || ((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1))) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || ((((p_dw_st == 2 && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc)) [2018-12-03 01:50:54,566 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == c_dr_pc || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || 0 == c_dr_st) && ((((((((\old(q_free) < c_num_read + 1 || (((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(q_free) < \old(p_num_write) + 1) || !(0 == \old(p_num_write))) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= p_num_write + 1) && 0 == p_num_write)) || !(q_read_ev == q_write_ev)) || \old(p_num_write) + 1 < \old(q_free)) || \old(p_dw_pc) == 1) || c_num_read + 1 < \old(q_free))) && ((!(c_num_read == \old(p_num_write)) || ((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1)) || ((p_last_write == q_buf_0 && p_dw_pc == 1) && c_num_read == p_num_write))) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || (((((p_last_write == q_buf_0 && p_dw_pc == 0) && q_req_up == 0) && c_num_read + 1 <= q_free) && q_free <= c_num_read + 1) && 0 == p_num_write)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc)) [2018-12-03 01:50:54,566 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || ((((((!(0 == c_dr_st) && c_dr_pc == 0) && q_req_up == 0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) && ((((((q_write_ev < 2 || p_dw_st < 2) || ((!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) || ((((!(0 == c_dr_st) && c_num_read == p_num_write) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && c_dr_pc == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) [2018-12-03 01:50:54,566 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || ((((((2 == c_dr_st && \old(c_num_read) == c_num_read) && q_req_up == 0) && 1 == c_dr_pc) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) && (((((((((c_num_read == p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || (q_write_ev < 2 || p_dw_st < 2) || ((!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write))) && ((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) [2018-12-03 01:50:54,566 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) && (((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2)) && ((((((q_write_ev < 2 || p_dw_st < 2) || ((!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || ((q_free == 0 && \old(c_num_read) == c_num_read) && !(0 == c_dr_st) && 1 == c_dr_pc)) || !(\old(c_num_read) + 1 == p_num_write)) [2018-12-03 01:50:54,587 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f5ad106c-fb32-48ea-8be6-da9930a41a85/bin-2019/utaipan/witness.graphml [2018-12-03 01:50:54,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:50:54,587 INFO L168 Benchmark]: Toolchain (without parser) took 89962.86 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 961.4 MB in the beginning and 947.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-03 01:50:54,588 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:50:54,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.42 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 945.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-03 01:50:54,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.58 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:50:54,588 INFO L168 Benchmark]: Boogie Preprocessor took 50.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-03 01:50:54,588 INFO L168 Benchmark]: RCFGBuilder took 246.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-12-03 01:50:54,588 INFO L168 Benchmark]: TraceAbstraction took 89421.36 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 947.4 MB in the end (delta: 135.2 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-03 01:50:54,588 INFO L168 Benchmark]: Witness Printer took 50.77 ms. Allocated memory is still 4.3 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:50:54,589 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.42 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 945.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.58 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 246.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 89421.36 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 947.4 MB in the end (delta: 135.2 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 50.77 ms. Allocated memory is still 4.3 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 158]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) && (((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2)) && ((((((q_write_ev < 2 || p_dw_st < 2) || ((!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || ((q_free == 0 && \old(c_num_read) == c_num_read) && !(0 == c_dr_st) && 1 == c_dr_pc)) || !(\old(c_num_read) + 1 == p_num_write)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || 0 == c_dr_st) || p_last_write == q_buf_0) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || p_dw_pc == \old(p_dw_pc)) || 0 == c_dr_st) || !(1 == \old(p_dw_pc)))) && (((((((\old(q_free) < c_num_read + 1 || (((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(q_free) < \old(p_num_write) + 1) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((2 <= p_dw_st && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0)) || \old(p_num_write) + 1 < \old(q_free)) || c_num_read + 1 < \old(q_free))) && (((((2 <= p_dw_st && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write) || !(c_num_read == \old(p_num_write)) || ((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1))) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || ((((p_dw_st == 2 && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc)) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((((((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && p_dw_pc == 1) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || !(1 == \old(c_dr_pc))) || (((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || ((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || ((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) < 2) || (((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write))) && (((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((2 <= p_dw_st && p_dw_pc == 1) && q_req_up == 0) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) || (((q_write_ev < 2 || ((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || \old(p_dw_st) < 2)) && ((((((((((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((((((((((2 <= p_dw_st && 2 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free <= 1) && c_last_read == p_last_write) || !(p_dw_i == 1)) || !(1 == c_dr_i)) || (((((((((p_dw_st == 0 && c_dr_pc == 0) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((((((p_dw_st == 2 && p_num_write == 1) && c_dr_pc == 0) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 1 <= tmp___1)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || \old(q_free) < \old(c_num_read) + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((((2 <= p_dw_st && 2 == c_dr_st) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0)) || !(\old(p_dw_st) == 0)) || ((((((((((p_dw_st == 0 && 2 == c_dr_st) && p_dw_pc == \old(p_dw_pc)) && \old(c_num_read) == c_num_read) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= 1) && 1 <= tmp___1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && (((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || 0 == \old(c_dr_st)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((q_write_ev < 2 || (q_free <= 1 && 1 <= q_free)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((2 <= p_dw_st && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && c_num_read + 1 == p_num_write) || ((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(c_num_read) == \old(p_num_write))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))))) || (((((((((p_dw_pc == 1 && q_req_up == 0) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) || (((((((((p_dw_pc == 1 && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || q_write_ev < 2) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(1 == \old(c_num_read))) || (c_num_read == 1 && p_num_write == 1)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || q_write_ev < 2) || \old(q_free) < 1) || (((((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || 0 == c_dr_st) || !(q_read_ev == 2)) || 0 == __retres1) && ((((((((((((((!(p_dw_i == 1) || __retres1 == 0) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < q_free) || !(c_last_read == p_last_write)) || q_free < c_num_read + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(0 == c_dr_pc))) && ((((((((0 == __retres1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || q_free < 1) || 0 == c_dr_st) || p_dw_pc == 1) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write))) && ((q_read_ev == 1 || ((q_write_ev < 2 || ((((!(q_buf_0 == p_last_write) || q_free < 1) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || 1 < q_free) || !(0 == q_req_up)) || !(c_num_read == p_num_write)) || p_dw_st < 2) || 0 == __retres1)) && ((((((((!(q_buf_0 == p_last_write) || 0 == __retres1) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(c_num_read + 1 == p_num_write)) || q_write_ev < 2) || !(q_free == 0)) || !(2 == c_dr_st)) || p_dw_st < 2)) && ((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || 0 == __retres1) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(0 == q_req_up)) || p_dw_st < 2)) && ((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || 0 == __retres1) || 0 == c_dr_st) || p_dw_pc == 1) || !(0 == q_req_up)) || p_dw_st < 2)) && (((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || 0 == __retres1) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || !(c_num_read == p_num_write)) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write))) && ((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || 0 == __retres1) || 0 == c_dr_st) || (1 == p_dw_pc && !(0 == q_read_ev)))) && (((((((((!(q_buf_0 == p_last_write) || 0 == __retres1) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(c_num_read + 1 == p_num_write)) || 0 == q_write_ev) || !(q_free == 0)) || !(2 == c_dr_st)) || !(0 == q_req_up)) || p_dw_st < 2) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || ((((((2 == c_dr_st && \old(c_num_read) == c_num_read) && q_req_up == 0) && 1 == c_dr_pc) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) && (((((((((c_num_read == p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || (q_write_ev < 2 || p_dw_st < 2) || ((!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write))) && ((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || (((((q_free == 0 && c_num_read + 1 == p_num_write) && 2 <= p_dw_st) && p_dw_pc == 1) && !(0 == q_write_ev)) && ((q_req_up == 0 && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev)) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || (((q_free == 0 && c_num_read + 1 == p_num_write) && p_dw_pc == 1) && (((2 == c_dr_st && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_dw_pc) == 0)) || !(\old(q_read_ev) == \old(q_write_ev))) || ((((((q_free == 0 && (1 == c_dr_pc && p_last_write == q_buf_0) && 2 == q_read_ev) && c_num_read + 1 == p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && q_req_up == 0) && p_dw_pc == 1)) || ((2 <= p_dw_st && 2 <= q_write_ev) && ((!(0 == c_dr_st) && q_req_up == 0) && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && q_req_up == 0) && p_last_write == q_buf_0)) || (((2 <= q_write_ev && p_dw_pc == 1) && c_num_read == p_num_write) && (((((q_free <= 1 && c_last_read == p_last_write) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free)) || !(0 == \old(c_dr_pc))) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || \old(q_free) < 1) || \old(p_num_write) + 1 < \old(q_free)) || (((((((!(0 == c_dr_st) && 2 <= p_dw_st) && !(p_dw_pc == 1)) && 2 <= q_write_ev) && q_free <= 1) && c_last_read == p_last_write) && p_last_write == q_buf_0) && 1 <= q_free)) || \old(q_free) < \old(c_num_read) + 1) || !(2 == \old(q_write_ev))) || ((p_dw_pc == 1 && c_num_read == p_num_write) && ((((((q_free <= 1 && q_req_up == 0) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && 2 <= q_write_ev)) || !(0 == \old(p_num_write))) || (((2 <= p_dw_st && 2 <= q_write_ev) && c_num_read == p_num_write) && ((((q_free <= 1 && c_last_read == p_last_write) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || (((((((q_free <= 1 && q_req_up == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 <= q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_num_read == p_num_write)) || (((((((((((p_dw_st == 0 && c_dr_pc == 0) && p_dw_pc == \old(p_dw_pc)) && q_read_ev == \old(q_read_ev)) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && q_read_ev == q_write_ev) && 0 == p_num_write) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((1 == c_dr_pc || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || 0 == c_dr_st) && ((((((((\old(q_free) < c_num_read + 1 || (((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(q_free) < \old(p_num_write) + 1) || !(0 == \old(p_num_write))) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= p_num_write + 1) && 0 == p_num_write)) || !(q_read_ev == q_write_ev)) || \old(p_num_write) + 1 < \old(q_free)) || \old(p_dw_pc) == 1) || c_num_read + 1 < \old(q_free))) && ((!(c_num_read == \old(p_num_write)) || ((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1)) || ((p_last_write == q_buf_0 && p_dw_pc == 1) && c_num_read == p_num_write))) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || (((((p_last_write == q_buf_0 && p_dw_pc == 0) && q_req_up == 0) && c_num_read + 1 <= q_free) && q_free <= c_num_read + 1) && 0 == p_num_write)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc)) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || ((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || ((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) < 2) || (((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write))) && (((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((2 <= p_dw_st && p_dw_pc == 1) && q_req_up == 0) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) || (((q_write_ev < 2 || ((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || \old(p_dw_st) < 2)) && ((((((((((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && (((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || 0 == \old(c_dr_st)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && ((((((((((((((((((((((((2 <= p_dw_st && 2 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free <= 1) && c_last_read == p_last_write) || !(p_dw_i == 1)) || !(1 == c_dr_i)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || \old(q_free) < \old(c_num_read) + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((((2 <= p_dw_st && 2 == c_dr_st) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && (((q_write_ev < 2 || (q_free <= 1 && 1 <= q_free)) || (((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((2 <= p_dw_st && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && c_num_read + 1 == p_num_write) || ((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(c_num_read) == \old(p_num_write))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))))) && (((((((((((((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && p_dw_pc == 1) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || q_write_ev < 2) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(1 == \old(c_num_read))) || (c_num_read == 1 && p_num_write == 1)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || q_write_ev < 2) || \old(q_free) < 1) || (((((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((1 == c_dr_pc || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || 0 == c_dr_st) && ((!(c_num_read == \old(p_num_write)) || ((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1)) || (((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write))) && ((((((((\old(q_free) < c_num_read + 1 || (((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || (((((p_dw_pc == \old(p_dw_pc) && q_req_up == 0) && p_last_write == q_buf_0) && q_free <= 1) && p_num_write + 1 <= q_free) && 0 == p_num_write)) || \old(q_free) < \old(p_num_write) + 1) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || \old(p_num_write) + 1 < \old(q_free)) || ((((\old(p_num_write) + 1 <= p_num_write && p_num_write <= 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0)) || c_num_read + 1 < \old(q_free))) && (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((p_dw_pc == \old(p_dw_pc) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc)) || (((p_num_write == 1 && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0)) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: ((((((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(0 == c_dr_st)) || 1 <= __retres1) && (1 == __retres1 || ((((q_write_ev < 2 || !(p_dw_pc == 1)) || (((((!(q_buf_0 == p_last_write) || q_free < 1) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || 1 < q_free) || !(0 == q_req_up)) || !(c_num_read == p_num_write)) && (((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || q_free < 1) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 0)) || !(c_num_read == p_num_write)) || 1 < q_free) || !(c_last_read == p_last_write))))) && ((((((((((!(q_buf_0 == p_last_write) || !(0 == c_dr_st)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(c_num_read + 1 == p_num_write)) || 1 <= __retres1) || q_write_ev < 2) || !(q_free == 0)) || !(0 == q_req_up)) || p_dw_st < 2)) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < q_free) || !(c_last_read == p_last_write)) || q_free < c_num_read + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(0 == c_dr_pc)) || 1 == __retres1)) && ((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || 0 == c_dr_st) || !(p_dw_st == 0)) || 1 == __retres1)) && ((((((((((((q_free < c_num_read + 1 || !(q_buf_0 == p_last_write)) || 1 == __retres1) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || q_free < 1) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || 1 < q_free) || !(0 == q_req_up)) || !(c_last_read == p_last_write)) || c_num_read + 1 < q_free) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || ((((((!(0 == c_dr_st) && c_dr_pc == 0) && q_req_up == 0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) && ((((((q_write_ev < 2 || p_dw_st < 2) || ((!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) || ((((!(0 == c_dr_st) && c_num_read == p_num_write) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((!(q_buf_0 == p_last_write) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && c_dr_pc == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((((q_write_ev < 2 || ((((!(q_buf_0 == p_last_write) || q_free < 1) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || 1 < q_free) || !(0 == q_req_up)) || !(p_dw_pc == 1)) || !(c_num_read == p_num_write)) || 0 == __retres1) || !(q_read_ev == 1)) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < q_free) || !(c_last_read == p_last_write)) || q_free < c_num_read + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || __retres1 == 0) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(0 == c_dr_pc))) && (((((((((0 == __retres1 || !(q_buf_0 == p_last_write)) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || !(c_num_read == p_num_write)) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write))) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || q_free < 1) || 0 == c_dr_st) || 0 == __retres1) || p_dw_pc == 1) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write))) && ((((((((0 == __retres1 || !(q_buf_0 == p_last_write)) || !(c_num_read + 1 == p_num_write)) || !(1 == p_dw_pc)) || q_write_ev < 2) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || p_dw_st < 2)) && ((((((((((!(q_buf_0 == p_last_write) || 1 == q_write_ev) || 0 == __retres1) || !(c_num_read + 1 == p_num_write)) || 0 == q_write_ev) || !(1 == p_dw_pc)) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || !(0 == q_req_up)) || p_dw_st < 2)) && ((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || 0 == __retres1) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(0 == q_req_up)) || p_dw_st < 2)) && ((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || 0 == __retres1) || 0 == c_dr_st) || p_dw_pc == 1) || !(0 == q_req_up)) || p_dw_st < 2)) && ((!(c_num_read == p_num_write) || (q_write_ev < 2 || (((!(q_buf_0 == p_last_write) || q_free < 1) || !(2 == c_dr_st)) || 1 < q_free) || !(0 == q_req_up)) || p_dw_st < 2) || 0 == __retres1)) && (((0 == __retres1 || !(q_buf_0 == p_last_write)) || 0 == c_dr_st) || 1 == c_dr_pc)) && (((0 == __retres1 || !(q_read_ev == 1)) || (q_write_ev < 2 || (((!(q_buf_0 == p_last_write) || q_free < 1) || 0 == c_dr_st) || 1 < q_free) || !(0 == q_req_up)) || p_dw_st < 2) || !(c_num_read == p_num_write)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 130 locations, 1 error locations. SAFE Result, 89.3s OverallTime, 22 OverallIterations, 8 TraceHistogramMax, 19.2s AutomataDifference, 0.0s DeadEndRemovalTime, 56.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 4988 SDtfs, 8364 SDslu, 12150 SDs, 0 SdLazy, 10389 SolverSat, 2999 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3767 GetRequests, 3444 SyntacticMatches, 46 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19665occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.2s AbstIntTime, 9 AbstIntIterations, 2 AbstIntStrong, 0.9829408920928772 AbsIntWeakeningRatio, 0.751269035532995 AbsIntAvgWeakeningVarsNumRemoved, 23.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 11614 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 45917 PreInvPairs, 49430 NumberOfFragments, 15942 HoareAnnotationTreeSize, 45917 FomulaSimplifications, 405905 FormulaSimplificationTreeSizeReduction, 5.0s HoareSimplificationTime, 56 FomulaSimplificationsInter, 318437 FormulaSimplificationTreeSizeReductionInter, 51.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 4763 NumberOfCodeBlocks, 4763 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6360 ConstructedInterpolants, 0 QuantifiedInterpolants, 2153595 SizeOfPredicates, 10 NumberOfNonLiveVariables, 7630 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 36 InterpolantComputations, 18 PerfectInterpolantSequences, 4310/4589 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...