./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/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_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/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-aa41828 [2018-11-23 01:24:25,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:24:25,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:24:25,885 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:24:25,885 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:24:25,886 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:24:25,886 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:24:25,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:24:25,889 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:24:25,889 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:24:25,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:24:25,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:24:25,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:24:25,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:24:25,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:24:25,893 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:24:25,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:24:25,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:24:25,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:24:25,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:24:25,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:24:25,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:24:25,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:24:25,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:24:25,900 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:24:25,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:24:25,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:24:25,902 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:24:25,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:24:25,903 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:24:25,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:24:25,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:24:25,904 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:24:25,904 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:24:25,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:24:25,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:24:25,905 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 01:24:25,915 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:24:25,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:24:25,915 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:24:25,915 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:24:25,916 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:24:25,916 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:24:25,916 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:24:25,916 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:24:25,916 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:24:25,916 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:24:25,916 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:24:25,917 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:24:25,917 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:24:25,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:24:25,917 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:24:25,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:24:25,918 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:24:25,918 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:24:25,918 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:24:25,918 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:24:25,918 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:24:25,918 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:24:25,918 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:24:25,919 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:24:25,919 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:24:25,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:24:25,919 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:24:25,919 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:24:25,919 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:24:25,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:24:25,919 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:24:25,920 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:24:25,920 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:24:25,920 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:24:25,920 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:24:25,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:24:25,920 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 01:24:25,920 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_ae57521f-27b0-49e5-bb39-1c707d3b47ea/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-11-23 01:24:25,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:24:25,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:24:25,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:24:25,956 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:24:25,957 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:24:25,957 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-23 01:24:25,992 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/data/4c2d6e3e8/19676b516a3d4f73af41929e67c2ab8b/FLAGf03135be2 [2018-11-23 01:24:26,334 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:24:26,335 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-23 01:24:26,341 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/data/4c2d6e3e8/19676b516a3d4f73af41929e67c2ab8b/FLAGf03135be2 [2018-11-23 01:24:26,754 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/data/4c2d6e3e8/19676b516a3d4f73af41929e67c2ab8b [2018-11-23 01:24:26,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:24:26,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:24:26,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:24:26,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:24:26,760 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:24:26,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:26,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c1ff7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26, skipping insertion in model container [2018-11-23 01:24:26,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:26,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:24:26,796 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:24:26,923 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:24:26,925 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:24:26,948 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:24:26,960 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:24:26,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26 WrapperNode [2018-11-23 01:24:26,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:24:26,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:24:26,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:24:26,961 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:24:26,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:26,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:26,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:24:26,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:24:26,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:24:26,974 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:24:27,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:27,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:27,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:27,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:27,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:27,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:27,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (1/1) ... [2018-11-23 01:24:27,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:24:27,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:24:27,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:24:27,034 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:24:27,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:24:27,068 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-23 01:24:27,069 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-23 01:24:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-23 01:24:27,069 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-23 01:24:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-11-23 01:24:27,069 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-11-23 01:24:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-23 01:24:27,069 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-23 01:24:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-23 01:24:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-23 01:24:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:24:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:24:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-23 01:24:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-23 01:24:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-23 01:24:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-23 01:24:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:24:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:24:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-23 01:24:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-23 01:24:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-23 01:24:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-23 01:24:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-23 01:24:27,071 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-23 01:24:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-23 01:24:27,071 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-23 01:24:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-23 01:24:27,071 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-23 01:24:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-23 01:24:27,071 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-23 01:24:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:24:27,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:24:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-23 01:24:27,071 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-23 01:24:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-23 01:24:27,071 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-23 01:24:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-23 01:24:27,071 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-23 01:24:27,349 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:24:27,349 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 01:24:27,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:24:27 BoogieIcfgContainer [2018-11-23 01:24:27,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:24:27,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:24:27,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:24:27,352 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:24:27,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:24:26" (1/3) ... [2018-11-23 01:24:27,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2219a904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:24:27, skipping insertion in model container [2018-11-23 01:24:27,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:26" (2/3) ... [2018-11-23 01:24:27,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2219a904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:24:27, skipping insertion in model container [2018-11-23 01:24:27,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:24:27" (3/3) ... [2018-11-23 01:24:27,354 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-23 01:24:27,360 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:24:27,365 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:24:27,374 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:24:27,396 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:24:27,396 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:24:27,396 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:24:27,396 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:24:27,397 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:24:27,397 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:24:27,397 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:24:27,397 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:24:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-11-23 01:24:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 01:24:27,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:27,418 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-11-23 01:24:27,419 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:27,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash 11439179, now seen corresponding path program 1 times [2018-11-23 01:24:27,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:27,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:27,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:27,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:27,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:27,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:27,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:27,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:27,630 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 5 states. [2018-11-23 01:24:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:28,084 INFO L93 Difference]: Finished difference Result 379 states and 545 transitions. [2018-11-23 01:24:28,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:28,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-11-23 01:24:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:28,097 INFO L225 Difference]: With dead ends: 379 [2018-11-23 01:24:28,098 INFO L226 Difference]: Without dead ends: 252 [2018-11-23 01:24:28,101 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-11-23 01:24:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-23 01:24:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2018-11-23 01:24:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-23 01:24:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2018-11-23 01:24:28,168 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2018-11-23 01:24:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:28,168 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2018-11-23 01:24:28,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2018-11-23 01:24:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 01:24:28,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:28,172 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-11-23 01:24:28,172 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:28,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1438317323, now seen corresponding path program 1 times [2018-11-23 01:24:28,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:28,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:28,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:28,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:28,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:28,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:28,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:24:28,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:28,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:24:28,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:24:28,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:28,260 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2018-11-23 01:24:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:28,761 INFO L93 Difference]: Finished difference Result 628 states and 843 transitions. [2018-11-23 01:24:28,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:28,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-23 01:24:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:28,766 INFO L225 Difference]: With dead ends: 628 [2018-11-23 01:24:28,766 INFO L226 Difference]: Without dead ends: 422 [2018-11-23 01:24:28,768 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-11-23 01:24:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-11-23 01:24:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2018-11-23 01:24:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-23 01:24:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-11-23 01:24:28,809 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2018-11-23 01:24:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:28,810 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-11-23 01:24:28,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:24:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-11-23 01:24:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 01:24:28,813 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:28,813 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-11-23 01:24:28,814 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:28,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:28,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1469864563, now seen corresponding path program 1 times [2018-11-23 01:24:28,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:28,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:28,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:28,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:28,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:28,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:28,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:24:28,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:28,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:24:28,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:24:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:28,890 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2018-11-23 01:24:28,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:28,939 INFO L93 Difference]: Finished difference Result 685 states and 908 transitions. [2018-11-23 01:24:28,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:28,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-23 01:24:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:28,944 INFO L225 Difference]: With dead ends: 685 [2018-11-23 01:24:28,944 INFO L226 Difference]: Without dead ends: 369 [2018-11-23 01:24:28,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-23 01:24:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2018-11-23 01:24:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-23 01:24:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2018-11-23 01:24:28,971 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2018-11-23 01:24:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:28,971 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2018-11-23 01:24:28,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:24:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2018-11-23 01:24:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 01:24:28,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:28,974 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-11-23 01:24:28,974 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:28,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:28,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1221718069, now seen corresponding path program 1 times [2018-11-23 01:24:28,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:28,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:28,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:28,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:28,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:29,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:29,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:24:29,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:29,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:24:29,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:24:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:24:29,040 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2018-11-23 01:24:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:29,207 INFO L93 Difference]: Finished difference Result 991 states and 1319 transitions. [2018-11-23 01:24:29,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:24:29,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 01:24:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:29,210 INFO L225 Difference]: With dead ends: 991 [2018-11-23 01:24:29,210 INFO L226 Difference]: Without dead ends: 670 [2018-11-23 01:24:29,211 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-11-23 01:24:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-23 01:24:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-11-23 01:24:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-23 01:24:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2018-11-23 01:24:29,241 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2018-11-23 01:24:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:29,242 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2018-11-23 01:24:29,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:24:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2018-11-23 01:24:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 01:24:29,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:29,243 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-11-23 01:24:29,243 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:29,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:29,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2116320844, now seen corresponding path program 1 times [2018-11-23 01:24:29,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:29,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:29,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:29,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:29,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:24:29,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:29,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:24:29,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:24:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:29,307 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2018-11-23 01:24:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:29,353 INFO L93 Difference]: Finished difference Result 1280 states and 1639 transitions. [2018-11-23 01:24:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:29,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-23 01:24:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:29,356 INFO L225 Difference]: With dead ends: 1280 [2018-11-23 01:24:29,356 INFO L226 Difference]: Without dead ends: 672 [2018-11-23 01:24:29,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-11-23 01:24:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2018-11-23 01:24:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-11-23 01:24:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2018-11-23 01:24:29,379 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2018-11-23 01:24:29,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:29,380 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2018-11-23 01:24:29,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:24:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2018-11-23 01:24:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 01:24:29,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:29,381 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-11-23 01:24:29,381 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:29,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2043934286, now seen corresponding path program 1 times [2018-11-23 01:24:29,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:29,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:29,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:29,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:29,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:29,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:29,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:24:29,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:29,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:24:29,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:24:29,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:29,448 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2018-11-23 01:24:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:29,870 INFO L93 Difference]: Finished difference Result 1359 states and 1714 transitions. [2018-11-23 01:24:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:24:29,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-23 01:24:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:29,873 INFO L225 Difference]: With dead ends: 1359 [2018-11-23 01:24:29,873 INFO L226 Difference]: Without dead ends: 831 [2018-11-23 01:24:29,874 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-11-23 01:24:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-11-23 01:24:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2018-11-23 01:24:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-11-23 01:24:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2018-11-23 01:24:29,899 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2018-11-23 01:24:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:29,899 INFO L480 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2018-11-23 01:24:29,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:24:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2018-11-23 01:24:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 01:24:29,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:29,901 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-11-23 01:24:29,901 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:29,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:29,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1534461196, now seen corresponding path program 1 times [2018-11-23 01:24:29,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:29,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:29,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:29,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:29,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:29,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:29,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:29,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:29,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:29,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:29,936 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2018-11-23 01:24:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:29,992 INFO L93 Difference]: Finished difference Result 1887 states and 2417 transitions. [2018-11-23 01:24:29,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:29,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-11-23 01:24:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:29,997 INFO L225 Difference]: With dead ends: 1887 [2018-11-23 01:24:29,997 INFO L226 Difference]: Without dead ends: 1276 [2018-11-23 01:24:29,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-11-23 01:24:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2018-11-23 01:24:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-11-23 01:24:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2018-11-23 01:24:30,050 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2018-11-23 01:24:30,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:30,051 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2018-11-23 01:24:30,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2018-11-23 01:24:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 01:24:30,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:30,053 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-11-23 01:24:30,076 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:30,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash -578263435, now seen corresponding path program 1 times [2018-11-23 01:24:30,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:30,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:30,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:30,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:30,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:30,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:30,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:30,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:30,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:30,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:30,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:30,140 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2018-11-23 01:24:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:30,251 INFO L93 Difference]: Finished difference Result 3564 states and 4733 transitions. [2018-11-23 01:24:30,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:24:30,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-23 01:24:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:30,259 INFO L225 Difference]: With dead ends: 3564 [2018-11-23 01:24:30,259 INFO L226 Difference]: Without dead ends: 2309 [2018-11-23 01:24:30,262 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-11-23 01:24:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-11-23 01:24:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2018-11-23 01:24:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-11-23 01:24:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2018-11-23 01:24:30,341 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2018-11-23 01:24:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:30,341 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2018-11-23 01:24:30,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2018-11-23 01:24:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 01:24:30,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:30,342 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-11-23 01:24:30,343 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:30,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:30,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1713093210, now seen corresponding path program 1 times [2018-11-23 01:24:30,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:30,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:30,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:30,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:30,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:30,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:30,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:30,399 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:30,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:30,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:30,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:30,399 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 5 states. [2018-11-23 01:24:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:30,856 INFO L93 Difference]: Finished difference Result 6956 states and 9741 transitions. [2018-11-23 01:24:30,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:30,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-11-23 01:24:30,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:30,872 INFO L225 Difference]: With dead ends: 6956 [2018-11-23 01:24:30,872 INFO L226 Difference]: Without dead ends: 4830 [2018-11-23 01:24:30,879 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-11-23 01:24:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2018-11-23 01:24:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4685. [2018-11-23 01:24:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4685 states. [2018-11-23 01:24:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2018-11-23 01:24:31,078 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 87 [2018-11-23 01:24:31,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:31,079 INFO L480 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2018-11-23 01:24:31,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2018-11-23 01:24:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 01:24:31,081 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:31,081 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-11-23 01:24:31,082 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:31,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:31,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1488980751, now seen corresponding path program 1 times [2018-11-23 01:24:31,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:31,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:31,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:31,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:31,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:24:31,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:31,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:24:31,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:24:31,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:24:31,160 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand 4 states. [2018-11-23 01:24:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:31,431 INFO L93 Difference]: Finished difference Result 6313 states and 8477 transitions. [2018-11-23 01:24:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:24:31,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-23 01:24:31,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:31,449 INFO L225 Difference]: With dead ends: 6313 [2018-11-23 01:24:31,449 INFO L226 Difference]: Without dead ends: 6310 [2018-11-23 01:24:31,452 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-11-23 01:24:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6310 states. [2018-11-23 01:24:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6310 to 6141. [2018-11-23 01:24:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6141 states. [2018-11-23 01:24:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 8233 transitions. [2018-11-23 01:24:31,686 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 8233 transitions. Word has length 88 [2018-11-23 01:24:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:31,687 INFO L480 AbstractCegarLoop]: Abstraction has 6141 states and 8233 transitions. [2018-11-23 01:24:31,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:24:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 8233 transitions. [2018-11-23 01:24:31,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 01:24:31,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:31,688 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-11-23 01:24:31,689 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:31,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:31,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1162820814, now seen corresponding path program 1 times [2018-11-23 01:24:31,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:31,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:31,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 01:24:31,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:31,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:24:31,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:31,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:24:31,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:24:31,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:24:31,721 INFO L87 Difference]: Start difference. First operand 6141 states and 8233 transitions. Second operand 4 states. [2018-11-23 01:24:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:31,999 INFO L93 Difference]: Finished difference Result 11956 states and 16039 transitions. [2018-11-23 01:24:32,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:24:32,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-11-23 01:24:32,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:32,016 INFO L225 Difference]: With dead ends: 11956 [2018-11-23 01:24:32,016 INFO L226 Difference]: Without dead ends: 5872 [2018-11-23 01:24:32,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:24:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5872 states. [2018-11-23 01:24:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5872 to 5872. [2018-11-23 01:24:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2018-11-23 01:24:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 7872 transitions. [2018-11-23 01:24:32,247 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 7872 transitions. Word has length 89 [2018-11-23 01:24:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:32,247 INFO L480 AbstractCegarLoop]: Abstraction has 5872 states and 7872 transitions. [2018-11-23 01:24:32,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:24:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 7872 transitions. [2018-11-23 01:24:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 01:24:32,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:32,248 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-11-23 01:24:32,249 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:32,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1085920016, now seen corresponding path program 1 times [2018-11-23 01:24:32,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:32,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:32,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:32,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:32,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:24:32,335 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2018-11-23 01:24:32,336 INFO L202 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-11-23 01:24:32,361 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:24:32,362 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:24:32,557 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 01:24:32,559 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-11-23 01:24:32,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:32,582 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 01:24:32,726 INFO L227 lantSequenceWeakener]: Weakened 85 states. On average, predicates are now at 78.88% of their original sizes. [2018-11-23 01:24:32,726 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 01:24:32,959 INFO L415 sIntCurrentIteration]: We unified 88 AI predicates to 88 [2018-11-23 01:24:32,960 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 01:24:32,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:24:32,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [6] total 34 [2018-11-23 01:24:32,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:32,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 01:24:32,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 01:24:32,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-11-23 01:24:32,961 INFO L87 Difference]: Start difference. First operand 5872 states and 7872 transitions. Second operand 30 states. [2018-11-23 01:24:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:37,419 INFO L93 Difference]: Finished difference Result 17394 states and 23832 transitions. [2018-11-23 01:24:37,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 01:24:37,419 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2018-11-23 01:24:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:37,467 INFO L225 Difference]: With dead ends: 17394 [2018-11-23 01:24:37,467 INFO L226 Difference]: Without dead ends: 11541 [2018-11-23 01:24:37,485 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=434, Invalid=2016, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 01:24:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11541 states. [2018-11-23 01:24:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11541 to 10667. [2018-11-23 01:24:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10667 states. [2018-11-23 01:24:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 14383 transitions. [2018-11-23 01:24:37,987 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 14383 transitions. Word has length 89 [2018-11-23 01:24:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:37,987 INFO L480 AbstractCegarLoop]: Abstraction has 10667 states and 14383 transitions. [2018-11-23 01:24:37,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 01:24:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 14383 transitions. [2018-11-23 01:24:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 01:24:37,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:37,989 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-11-23 01:24:37,989 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:37,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash -131765010, now seen corresponding path program 1 times [2018-11-23 01:24:37,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:38,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 01:24:38,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:38,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:24:38,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:38,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:24:38,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:24:38,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:38,044 INFO L87 Difference]: Start difference. First operand 10667 states and 14383 transitions. Second operand 7 states. [2018-11-23 01:24:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:39,691 INFO L93 Difference]: Finished difference Result 33769 states and 50119 transitions. [2018-11-23 01:24:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 01:24:39,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-11-23 01:24:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:39,756 INFO L225 Difference]: With dead ends: 33769 [2018-11-23 01:24:39,756 INFO L226 Difference]: Without dead ends: 21075 [2018-11-23 01:24:39,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-11-23 01:24:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21075 states. [2018-11-23 01:24:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21075 to 19665. [2018-11-23 01:24:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19665 states. [2018-11-23 01:24:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19665 states to 19665 states and 25847 transitions. [2018-11-23 01:24:40,807 INFO L78 Accepts]: Start accepts. Automaton has 19665 states and 25847 transitions. Word has length 100 [2018-11-23 01:24:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:40,807 INFO L480 AbstractCegarLoop]: Abstraction has 19665 states and 25847 transitions. [2018-11-23 01:24:40,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:24:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 19665 states and 25847 transitions. [2018-11-23 01:24:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 01:24:40,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:40,809 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-11-23 01:24:40,809 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:40,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:40,809 INFO L82 PathProgramCache]: Analyzing trace with hash 193904721, now seen corresponding path program 1 times [2018-11-23 01:24:40,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:40,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:40,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 01:24:40,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:40,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:24:40,931 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2018-11-23 01:24:40,931 INFO L202 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-11-23 01:24:40,933 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:24:40,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:24:40,981 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 01:24:40,981 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-11-23 01:24:41,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:41,002 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 01:24:41,099 INFO L227 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 79.69% of their original sizes. [2018-11-23 01:24:41,099 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 01:24:41,514 INFO L415 sIntCurrentIteration]: We unified 109 AI predicates to 109 [2018-11-23 01:24:41,514 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 01:24:41,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:24:41,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [8] total 45 [2018-11-23 01:24:41,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:41,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 01:24:41,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 01:24:41,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 01:24:41,515 INFO L87 Difference]: Start difference. First operand 19665 states and 25847 transitions. Second operand 39 states. [2018-11-23 01:24:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:49,450 INFO L93 Difference]: Finished difference Result 34683 states and 45484 transitions. [2018-11-23 01:24:49,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 01:24:49,450 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 110 [2018-11-23 01:24:49,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:49,486 INFO L225 Difference]: With dead ends: 34683 [2018-11-23 01:24:49,486 INFO L226 Difference]: Without dead ends: 15167 [2018-11-23 01:24:49,510 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=622, Invalid=2918, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 01:24:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15167 states. [2018-11-23 01:24:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15167 to 11151. [2018-11-23 01:24:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11151 states. [2018-11-23 01:24:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11151 states to 11151 states and 14463 transitions. [2018-11-23 01:24:49,956 INFO L78 Accepts]: Start accepts. Automaton has 11151 states and 14463 transitions. Word has length 110 [2018-11-23 01:24:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:49,956 INFO L480 AbstractCegarLoop]: Abstraction has 11151 states and 14463 transitions. [2018-11-23 01:24:49,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 01:24:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 11151 states and 14463 transitions. [2018-11-23 01:24:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-23 01:24:49,966 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:49,966 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-11-23 01:24:49,966 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:49,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash -185069534, now seen corresponding path program 1 times [2018-11-23 01:24:49,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:49,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:49,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 01:24:50,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:50,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:24:50,069 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-11-23 01:24:50,069 INFO L202 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-11-23 01:24:50,072 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:24:50,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:24:50,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:24:50,260 INFO L272 AbstractInterpreter]: Visited 104 different actions 354 times. Merged at 23 different actions 107 times. Never widened. Performed 3723 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3723 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 26 fixpoints after 9 different actions. Largest state had 40 variables. [2018-11-23 01:24:50,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:50,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:24:50,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:50,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:24:50,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:50,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:24:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:50,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:24:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 01:24:50,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:24:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-23 01:24:50,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:24:50,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 4] total 10 [2018-11-23 01:24:50,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:50,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:50,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:24:50,707 INFO L87 Difference]: Start difference. First operand 11151 states and 14463 transitions. Second operand 3 states. [2018-11-23 01:24:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:51,225 INFO L93 Difference]: Finished difference Result 20011 states and 26260 transitions. [2018-11-23 01:24:51,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:51,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-11-23 01:24:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:51,249 INFO L225 Difference]: With dead ends: 20011 [2018-11-23 01:24:51,249 INFO L226 Difference]: Without dead ends: 9694 [2018-11-23 01:24:51,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:24:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9694 states. [2018-11-23 01:24:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9694 to 9691. [2018-11-23 01:24:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9691 states. [2018-11-23 01:24:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9691 states to 9691 states and 11686 transitions. [2018-11-23 01:24:51,717 INFO L78 Accepts]: Start accepts. Automaton has 9691 states and 11686 transitions. Word has length 188 [2018-11-23 01:24:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:51,718 INFO L480 AbstractCegarLoop]: Abstraction has 9691 states and 11686 transitions. [2018-11-23 01:24:51,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 9691 states and 11686 transitions. [2018-11-23 01:24:51,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-23 01:24:51,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:51,721 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-11-23 01:24:51,721 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:51,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:51,721 INFO L82 PathProgramCache]: Analyzing trace with hash 745588165, now seen corresponding path program 1 times [2018-11-23 01:24:51,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:51,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:51,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:51,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:51,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 01:24:51,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:51,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:24:51,812 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-11-23 01:24:51,812 INFO L202 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-11-23 01:24:51,815 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:24:51,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:24:52,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:24:52,221 INFO L272 AbstractInterpreter]: Visited 139 different actions 1328 times. Merged at 63 different actions 404 times. Never widened. Performed 13152 root evaluator evaluations with a maximum evaluation depth of 3. Performed 13152 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 111 fixpoints after 17 different actions. Largest state had 40 variables. [2018-11-23 01:24:52,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:52,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:24:52,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:52,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:24:52,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:52,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:24:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:52,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:24:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 01:24:52,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:24:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-23 01:24:52,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:24:52,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-23 01:24:52,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:24:52,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:24:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:24:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:24:52,617 INFO L87 Difference]: Start difference. First operand 9691 states and 11686 transitions. Second operand 11 states. [2018-11-23 01:24:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:54,027 INFO L93 Difference]: Finished difference Result 28937 states and 36125 transitions. [2018-11-23 01:24:54,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 01:24:54,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-11-23 01:24:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:54,068 INFO L225 Difference]: With dead ends: 28937 [2018-11-23 01:24:54,068 INFO L226 Difference]: Without dead ends: 18240 [2018-11-23 01:24:54,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 384 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2018-11-23 01:24:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18240 states. [2018-11-23 01:24:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18240 to 17124. [2018-11-23 01:24:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17124 states. [2018-11-23 01:24:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 20263 transitions. [2018-11-23 01:24:54,839 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 20263 transitions. Word has length 189 [2018-11-23 01:24:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:54,839 INFO L480 AbstractCegarLoop]: Abstraction has 17124 states and 20263 transitions. [2018-11-23 01:24:54,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:24:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 20263 transitions. [2018-11-23 01:24:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-23 01:24:54,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:54,845 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-11-23 01:24:54,845 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:54,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash 480424814, now seen corresponding path program 1 times [2018-11-23 01:24:54,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:54,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:54,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:54,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:54,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 01:24:54,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:54,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:24:54,953 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-11-23 01:24:54,953 INFO L202 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-11-23 01:24:54,955 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:24:54,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:24:55,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:24:55,224 INFO L272 AbstractInterpreter]: Visited 135 different actions 608 times. Merged at 32 different actions 120 times. Never widened. Performed 6211 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6211 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 40 fixpoints after 9 different actions. Largest state had 40 variables. [2018-11-23 01:24:55,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:55,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:24:55,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:55,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:24:55,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:55,236 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:24:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:55,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:24:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 01:24:55,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:24:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 01:24:55,581 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:24:55,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [9] total 11 [2018-11-23 01:24:55,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:55,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:55,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:55,582 INFO L87 Difference]: Start difference. First operand 17124 states and 20263 transitions. Second operand 3 states. [2018-11-23 01:24:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:56,150 INFO L93 Difference]: Finished difference Result 32734 states and 39004 transitions. [2018-11-23 01:24:56,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:56,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-11-23 01:24:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:56,183 INFO L225 Difference]: With dead ends: 32734 [2018-11-23 01:24:56,183 INFO L226 Difference]: Without dead ends: 16835 [2018-11-23 01:24:56,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 388 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16835 states. [2018-11-23 01:24:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16835 to 16702. [2018-11-23 01:24:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16702 states. [2018-11-23 01:24:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16702 states to 16702 states and 19684 transitions. [2018-11-23 01:24:56,923 INFO L78 Accepts]: Start accepts. Automaton has 16702 states and 19684 transitions. Word has length 196 [2018-11-23 01:24:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:56,924 INFO L480 AbstractCegarLoop]: Abstraction has 16702 states and 19684 transitions. [2018-11-23 01:24:56,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 16702 states and 19684 transitions. [2018-11-23 01:24:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-23 01:24:56,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:56,926 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-11-23 01:24:56,927 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:56,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:56,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1558206204, now seen corresponding path program 1 times [2018-11-23 01:24:56,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:56,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:56,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:56,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 01:24:56,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:56,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:24:56,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:24:56,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:24:56,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:24:56,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:24:56,977 INFO L87 Difference]: Start difference. First operand 16702 states and 19684 transitions. Second operand 4 states. [2018-11-23 01:24:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:57,405 INFO L93 Difference]: Finished difference Result 25087 states and 29825 transitions. [2018-11-23 01:24:57,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:24:57,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-11-23 01:24:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:57,422 INFO L225 Difference]: With dead ends: 25087 [2018-11-23 01:24:57,422 INFO L226 Difference]: Without dead ends: 9300 [2018-11-23 01:24:57,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:24:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9300 states. [2018-11-23 01:24:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9300 to 9234. [2018-11-23 01:24:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2018-11-23 01:24:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 10544 transitions. [2018-11-23 01:24:57,827 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 10544 transitions. Word has length 197 [2018-11-23 01:24:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:57,828 INFO L480 AbstractCegarLoop]: Abstraction has 9234 states and 10544 transitions. [2018-11-23 01:24:57,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:24:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 10544 transitions. [2018-11-23 01:24:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-23 01:24:57,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:57,829 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-11-23 01:24:57,829 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:57,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:57,829 INFO L82 PathProgramCache]: Analyzing trace with hash 918395428, now seen corresponding path program 1 times [2018-11-23 01:24:57,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:24:57,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:57,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:57,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:57,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:24:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 01:24:58,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:58,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:24:58,007 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-23 01:24:58,007 INFO L202 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-11-23 01:24:58,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:24:58,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:24:58,404 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:24:58,404 INFO L272 AbstractInterpreter]: Visited 137 different actions 905 times. Merged at 55 different actions 225 times. Widened at 1 different actions 1 times. Performed 9632 root evaluator evaluations with a maximum evaluation depth of 3. Performed 9632 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 74 fixpoints after 17 different actions. Largest state had 40 variables. [2018-11-23 01:24:58,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:58,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:24:58,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:58,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:24:58,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:58,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:24:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:58,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:24:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 66 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 01:24:58,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:24:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 01:24:58,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:24:58,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2018-11-23 01:24:58,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:24:58,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:24:58,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:24:58,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-23 01:24:58,943 INFO L87 Difference]: Start difference. First operand 9234 states and 10544 transitions. Second operand 13 states. [2018-11-23 01:25:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:00,672 INFO L93 Difference]: Finished difference Result 18498 states and 21470 transitions. [2018-11-23 01:25:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 01:25:00,672 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 198 [2018-11-23 01:25:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:00,706 INFO L225 Difference]: With dead ends: 18498 [2018-11-23 01:25:00,706 INFO L226 Difference]: Without dead ends: 18495 [2018-11-23 01:25:00,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 386 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-11-23 01:25:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18495 states. [2018-11-23 01:25:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18495 to 17979. [2018-11-23 01:25:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17979 states. [2018-11-23 01:25:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17979 states to 17979 states and 20794 transitions. [2018-11-23 01:25:01,427 INFO L78 Accepts]: Start accepts. Automaton has 17979 states and 20794 transitions. Word has length 198 [2018-11-23 01:25:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:01,427 INFO L480 AbstractCegarLoop]: Abstraction has 17979 states and 20794 transitions. [2018-11-23 01:25:01,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:25:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 17979 states and 20794 transitions. [2018-11-23 01:25:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-23 01:25:01,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:01,430 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-11-23 01:25:01,430 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:25:01,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1414839607, now seen corresponding path program 2 times [2018-11-23 01:25:01,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:01,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:01,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:01,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:01,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-23 01:25:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:25:01,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:01,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:25:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:25:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:01,480 INFO L87 Difference]: Start difference. First operand 17979 states and 20794 transitions. Second operand 3 states. [2018-11-23 01:25:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:02,122 INFO L93 Difference]: Finished difference Result 30606 states and 35586 transitions. [2018-11-23 01:25:02,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:25:02,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-11-23 01:25:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:02,152 INFO L225 Difference]: With dead ends: 30606 [2018-11-23 01:25:02,152 INFO L226 Difference]: Without dead ends: 17570 [2018-11-23 01:25:02,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17570 states. [2018-11-23 01:25:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17570 to 17253. [2018-11-23 01:25:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17253 states. [2018-11-23 01:25:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17253 states to 17253 states and 19687 transitions. [2018-11-23 01:25:02,913 INFO L78 Accepts]: Start accepts. Automaton has 17253 states and 19687 transitions. Word has length 201 [2018-11-23 01:25:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:02,913 INFO L480 AbstractCegarLoop]: Abstraction has 17253 states and 19687 transitions. [2018-11-23 01:25:02,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:25:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 17253 states and 19687 transitions. [2018-11-23 01:25:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-23 01:25:02,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:02,918 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-11-23 01:25:02,918 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:25:02,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash -138167773, now seen corresponding path program 1 times [2018-11-23 01:25:02,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:02,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:02,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:25:02,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:02,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-23 01:25:02,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:02,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:25:02,999 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-11-23 01:25:02,999 INFO L202 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-11-23 01:25:03,001 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:25:03,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:25:03,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:25:03,298 INFO L272 AbstractInterpreter]: Visited 138 different actions 1195 times. Merged at 58 different actions 363 times. Never widened. Performed 10850 root evaluator evaluations with a maximum evaluation depth of 3. Performed 10850 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 126 fixpoints after 20 different actions. Largest state had 40 variables. [2018-11-23 01:25:03,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:03,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:25:03,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:03,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:25:03,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:03,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:25:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:03,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:25:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-23 01:25:03,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:25:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 41 proven. 21 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 01:25:03,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:25:03,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2018-11-23 01:25:03,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:03,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:25:03,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:25:03,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:25:03,582 INFO L87 Difference]: Start difference. First operand 17253 states and 19687 transitions. Second operand 6 states. [2018-11-23 01:25:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:04,066 INFO L93 Difference]: Finished difference Result 27933 states and 32481 transitions. [2018-11-23 01:25:04,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:25:04,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 275 [2018-11-23 01:25:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:04,087 INFO L225 Difference]: With dead ends: 27933 [2018-11-23 01:25:04,087 INFO L226 Difference]: Without dead ends: 10782 [2018-11-23 01:25:04,102 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-11-23 01:25:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10782 states. [2018-11-23 01:25:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10782 to 8449. [2018-11-23 01:25:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8449 states. [2018-11-23 01:25:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8449 states to 8449 states and 9643 transitions. [2018-11-23 01:25:04,493 INFO L78 Accepts]: Start accepts. Automaton has 8449 states and 9643 transitions. Word has length 275 [2018-11-23 01:25:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:04,493 INFO L480 AbstractCegarLoop]: Abstraction has 8449 states and 9643 transitions. [2018-11-23 01:25:04,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:25:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8449 states and 9643 transitions. [2018-11-23 01:25:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-23 01:25:04,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:04,498 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-11-23 01:25:04,498 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:25:04,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 823377233, now seen corresponding path program 1 times [2018-11-23 01:25:04,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:04,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:04,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-11-23 01:25:04,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:04,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:25:04,606 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 294 with the following transitions: [2018-11-23 01:25:04,607 INFO L202 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-11-23 01:25:04,608 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:25:04,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:25:05,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:25:05,694 INFO L272 AbstractInterpreter]: Visited 144 different actions 2545 times. Merged at 78 different actions 911 times. Widened at 1 different actions 3 times. Performed 22939 root evaluator evaluations with a maximum evaluation depth of 3. Performed 22939 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 256 fixpoints after 25 different actions. Largest state had 40 variables. [2018-11-23 01:25:05,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:05,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:25:05,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:05,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/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-11-23 01:25:05,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:05,708 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:25:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:05,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:25:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 277 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-23 01:25:05,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:25:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 75 proven. 7 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-11-23 01:25:06,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:25:06,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 01:25:06,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:25:06,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:25:06,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:25:06,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:25:06,070 INFO L87 Difference]: Start difference. First operand 8449 states and 9643 transitions. Second operand 8 states. [2018-11-23 01:25:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:06,717 INFO L93 Difference]: Finished difference Result 13290 states and 15318 transitions. [2018-11-23 01:25:06,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:25:06,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 293 [2018-11-23 01:25:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:06,730 INFO L225 Difference]: With dead ends: 13290 [2018-11-23 01:25:06,730 INFO L226 Difference]: Without dead ends: 5355 [2018-11-23 01:25:06,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 581 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-11-23 01:25:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5355 states. [2018-11-23 01:25:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5355 to 5197. [2018-11-23 01:25:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5197 states. [2018-11-23 01:25:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5197 states to 5197 states and 5921 transitions. [2018-11-23 01:25:06,996 INFO L78 Accepts]: Start accepts. Automaton has 5197 states and 5921 transitions. Word has length 293 [2018-11-23 01:25:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:06,996 INFO L480 AbstractCegarLoop]: Abstraction has 5197 states and 5921 transitions. [2018-11-23 01:25:06,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:25:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5197 states and 5921 transitions. [2018-11-23 01:25:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-23 01:25:06,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:06,999 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-11-23 01:25:06,999 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:25:06,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash 585639202, now seen corresponding path program 1 times [2018-11-23 01:25:06,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:07,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:07,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-11-23 01:25:07,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:07,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:25:07,061 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-11-23 01:25:07,062 INFO L202 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-11-23 01:25:07,063 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:25:07,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:25:07,791 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:25:07,791 INFO L272 AbstractInterpreter]: Visited 138 different actions 2674 times. Merged at 59 different actions 913 times. Widened at 3 different actions 4 times. Performed 26385 root evaluator evaluations with a maximum evaluation depth of 3. Performed 26385 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 315 fixpoints after 20 different actions. Largest state had 40 variables. [2018-11-23 01:25:07,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:07,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:25:07,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:07,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/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-11-23 01:25:07,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:07,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:25:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:07,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:25:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-23 01:25:07,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:25:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-11-23 01:25:08,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:25:08,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2018-11-23 01:25:08,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:08,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:25:08,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:25:08,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:25:08,070 INFO L87 Difference]: Start difference. First operand 5197 states and 5921 transitions. Second operand 5 states. [2018-11-23 01:25:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:08,363 INFO L93 Difference]: Finished difference Result 6061 states and 6874 transitions. [2018-11-23 01:25:08,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:25:08,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2018-11-23 01:25:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:08,366 INFO L225 Difference]: With dead ends: 6061 [2018-11-23 01:25:08,366 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 01:25:08,370 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-11-23 01:25:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 01:25:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 01:25:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 01:25:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 01:25:08,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 294 [2018-11-23 01:25:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:08,372 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:25:08,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:25:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:25:08,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 01:25:08,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 01:25:08,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,783 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 182 [2018-11-23 01:25:08,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:08,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:09,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,704 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 185 [2018-11-23 01:25:10,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:10,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:11,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:12,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,502 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 200 [2018-11-23 01:25:13,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:13,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,283 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 200 [2018-11-23 01:25:14,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:25:14,879 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 83 [2018-11-23 01:25:15,716 WARN L180 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 109 [2018-11-23 01:25:16,309 WARN L180 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 103 [2018-11-23 01:25:18,338 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 355 DAG size of output: 169 [2018-11-23 01:25:20,065 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 340 DAG size of output: 108 [2018-11-23 01:25:20,367 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 1 [2018-11-23 01:25:21,310 WARN L180 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 122 [2018-11-23 01:25:22,587 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 383 DAG size of output: 101 [2018-11-23 01:25:22,726 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2018-11-23 01:25:23,400 WARN L180 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 111 [2018-11-23 01:25:23,657 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 1 [2018-11-23 01:25:23,913 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 1 [2018-11-23 01:25:24,925 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 322 DAG size of output: 99 [2018-11-23 01:25:25,824 WARN L180 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 91 [2018-11-23 01:25:26,020 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 1 [2018-11-23 01:25:26,713 WARN L180 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 109 [2018-11-23 01:25:26,993 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 63 [2018-11-23 01:25:27,831 WARN L180 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 111 [2018-11-23 01:25:28,315 WARN L180 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 100 [2018-11-23 01:25:28,795 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 98 [2018-11-23 01:25:29,969 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 322 DAG size of output: 99 [2018-11-23 01:25:31,508 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 322 DAG size of output: 154 [2018-11-23 01:25:31,988 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 100 [2018-11-23 01:25:33,248 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 364 DAG size of output: 110 [2018-11-23 01:25:34,065 WARN L180 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 89 [2018-11-23 01:25:36,038 WARN L180 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 355 DAG size of output: 169 [2018-11-23 01:25:36,342 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 357 DAG size of output: 1 [2018-11-23 01:25:37,238 WARN L180 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 117 [2018-11-23 01:25:37,784 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 404 DAG size of output: 1 [2018-11-23 01:25:39,422 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 367 DAG size of output: 158 [2018-11-23 01:25:39,976 WARN L180 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 91 [2018-11-23 01:25:41,326 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 353 DAG size of output: 92 [2018-11-23 01:25:41,551 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 92 [2018-11-23 01:25:42,399 WARN L180 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 117 [2018-11-23 01:25:43,416 WARN L180 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 131 [2018-11-23 01:25:44,035 WARN L180 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 102 [2018-11-23 01:25:44,268 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 93 [2018-11-23 01:25:45,138 WARN L180 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 99 [2018-11-23 01:25:45,266 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2018-11-23 01:25:45,528 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 95 [2018-11-23 01:25:45,612 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-11-23 01:25:45,612 INFO L448 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-11-23 01:25:45,612 INFO L448 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2018-11-23 01:25:45,612 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-11-23 01:25:45,613 INFO L444 ceAbstractionStarter]: At program point L303(line 303) the Hoare annotation is: (let ((.cse18 (= 1 ~c_dr_pc~0)) (.cse11 (= 2 ~c_dr_st~0)) (.cse23 (not (= 0 ~c_dr_st~0))) (.cse25 (<= 2 ~p_dw_st~0)) (.cse16 (+ ~c_num_read~0 1)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse15 (= ~p_dw_st~0 0)) (.cse17 (not (= |old(~p_dw_st~0)| 0))) (.cse19 (not .cse12)) (.cse20 (not (= .cse16 ~p_num_write~0))) (.cse22 (not (= ~q_free~0 0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse7 (and .cse23 .cse25)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse9 (< ~q_free~0 1)) (.cse13 (< 1 ~q_free~0)) (.cse21 (and .cse25 .cse11)) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not .cse18)) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= ~q_read_ev~0 2))) (.cse6 (not (= 0 ~q_req_up~0))) (.cse8 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse8 .cse14) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse7 .cse4 .cse12 .cse13 .cse8 .cse14) (or .cse2 (and .cse15 (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse16 ~q_free~0) .cse14 (not .cse4) (< ~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 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse18 .cse1 .cse2 .cse15 .cse4 .cse17) (or .cse1 .cse2 .cse3 .cse5 .cse19 .cse20 .cse21 .cse0 .cse22 .cse10 .cse8) (or .cse2 .cse1 .cse3 .cse5 .cse19 .cse20 (= 0 ~q_write_ev~0) .cse22 .cse10 .cse21 .cse6 .cse8) (or .cse18 .cse1 .cse2 .cse4 .cse23) (or .cse2 .cse1 .cse3 .cse5 .cse21 .cse0 .cse9 .cse10 .cse24 .cse13 .cse8 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse12 .cse6 .cse8) (or (or .cse0 .cse24 (or .cse1 .cse2 .cse9 .cse3 .cse10 .cse13 .cse6) .cse8) .cse21) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)))) [2018-11-23 01:25:45,613 INFO L444 ceAbstractionStarter]: At program point L305-2(lines 305 309) the Hoare annotation is: (let ((.cse11 (= 2 ~c_dr_st~0)) (.cse15 (= activate_threads_~tmp~1 0)) (.cse19 (+ ~c_num_read~0 1)) (.cse5 (= ~p_dw_pc~0 1)) (.cse26 (= 1 ~c_dr_pc~0)) (.cse21 (not (= 0 ~c_dr_st~0))) (.cse18 (<= 2 ~p_dw_st~0))) (let ((.cse7 (and .cse21 .cse18)) (.cse6 (not (= 0 ~q_req_up~0))) (.cse9 (< ~q_free~0 1)) (.cse16 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (< 1 ~q_free~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (not .cse26)) (.cse14 (not (= ~q_read_ev~0 2))) (.cse23 (not .cse5)) (.cse24 (not (= .cse19 ~p_num_write~0))) (.cse0 (< ~q_write_ev~0 2)) (.cse25 (not (= ~q_free~0 0))) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse22 (and .cse18 .cse11 .cse15)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse20 (not (= |old(~p_dw_st~0)| 0))) (.cse17 (= ~p_dw_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse8 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse7 .cse4 .cse5 .cse12 .cse8 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse4 .cse14 .cse5 .cse15 .cse12 .cse8 .cse13) (or (or .cse0 .cse16 (or .cse1 .cse2 .cse9 .cse3 .cse10 .cse12 .cse6) .cse8) (and (and .cse17 .cse11) (= ~q_read_ev~0 1)) (and .cse18 .cse11)) (or .cse2 (not (= 1 ~c_dr_i~0)) (and .cse17 (= ~c_dr_st~0 0) .cse15) (not (= 0 ~c_num_read~0)) (< .cse19 ~q_free~0) .cse13 (not .cse4) (< ~q_free~0 .cse19) .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)) .cse20 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse14 .cse11 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 (and .cse21 .cse18 .cse15) .cse8) (or .cse22 .cse2 .cse1 .cse3 .cse14 .cse23 .cse24 (= 0 ~q_write_ev~0) .cse25 .cse10 .cse6 .cse8) (or .cse26 .cse1 .cse2 .cse4 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse8) (or .cse2 .cse1 .cse3 .cse14 .cse0 .cse9 .cse22 .cse10 .cse16 .cse12 .cse8 .cse13) (or .cse26 .cse1 .cse2 .cse4 .cse14 .cse15) (or .cse2 .cse1 .cse3 .cse14 .cse23 .cse24 .cse0 .cse25 .cse10 .cse22 .cse8) (or .cse26 .cse1 .cse2 .cse4 .cse20 .cse17)))) [2018-11-23 01:25:45,614 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 297 321) the Hoare annotation is: (let ((.cse18 (= 1 ~c_dr_pc~0)) (.cse11 (= 2 ~c_dr_st~0)) (.cse23 (not (= 0 ~c_dr_st~0))) (.cse25 (<= 2 ~p_dw_st~0)) (.cse16 (+ ~c_num_read~0 1)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse15 (= ~p_dw_st~0 0)) (.cse17 (not (= |old(~p_dw_st~0)| 0))) (.cse19 (not .cse12)) (.cse20 (not (= .cse16 ~p_num_write~0))) (.cse22 (not (= ~q_free~0 0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse7 (and .cse23 .cse25)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse9 (< ~q_free~0 1)) (.cse13 (< 1 ~q_free~0)) (.cse21 (and .cse25 .cse11)) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not .cse18)) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= ~q_read_ev~0 2))) (.cse6 (not (= 0 ~q_req_up~0))) (.cse8 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse8 .cse14) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse7 .cse4 .cse12 .cse13 .cse8 .cse14) (or .cse2 (and .cse15 (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse16 ~q_free~0) .cse14 (not .cse4) (< ~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 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse18 .cse1 .cse2 .cse15 .cse4 .cse17) (or .cse1 .cse2 .cse3 .cse5 .cse19 .cse20 .cse21 .cse0 .cse22 .cse10 .cse8) (or .cse2 .cse1 .cse3 .cse5 .cse19 .cse20 (= 0 ~q_write_ev~0) .cse22 .cse10 .cse21 .cse6 .cse8) (or .cse18 .cse1 .cse2 .cse4 .cse23) (or .cse2 .cse1 .cse3 .cse5 .cse21 .cse0 .cse9 .cse10 .cse24 .cse13 .cse8 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse12 .cse6 .cse8) (or (or .cse0 .cse24 (or .cse1 .cse2 .cse9 .cse3 .cse10 .cse13 .cse6) .cse8) .cse21) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)))) [2018-11-23 01:25:45,614 INFO L448 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2018-11-23 01:25:45,614 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2018-11-23 01:25:45,614 INFO L444 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse14 (+ ~c_num_read~0 1)) (.cse3 (= 0 ~c_dr_st~0))) (let ((.cse8 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse10 (not (= ~q_free~0 0))) (.cse13 (not .cse3)) (.cse15 (< ~q_write_ev~0 2)) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse11 (not (= 0 ~c_num_read~0))) (.cse12 (not (= 0 ~c_dr_pc~0))) (.cse23 (< ~q_free~0 .cse14)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse6 (not (= ~q_read_ev~0 2))) (.cse5 (= 1 exists_runnable_thread_~__retres1~2)) (.cse24 (not (= 0 ~p_num_write~0))) (.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse17 (< ~q_free~0 1)) (.cse18 (not (= 2 ~c_dr_st~0))) (.cse4 (not (= ~p_dw_st~0 0))) (.cse20 (< 1 ~q_free~0)) (.cse16 (not (= 0 ~q_req_up~0))) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (< .cse14 ~q_free~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse2 .cse1 .cse6 .cse7 (not (= ~p_dw_st~0 2)) .cse8 .cse9 .cse10 (not (= 1 ~p_num_write~0)) .cse11 .cse12 .cse13) (or .cse8 .cse1 .cse2 (not .cse0) .cse6 .cse7 (not (= .cse14 ~p_num_write~0)) .cse15 .cse10 .cse16 (< ~p_dw_st~0 2) .cse13) (or .cse5 (let ((.cse19 (not (= ~c_num_read~0 ~p_num_write~0)))) (and (or .cse2 .cse1 .cse6 .cse7 .cse15 .cse17 .cse18 .cse4 .cse19 .cse20 .cse21) (or .cse15 .cse7 (or .cse1 .cse17 .cse2 .cse18 .cse6 .cse4 .cse20 .cse16) .cse19)))) (or .cse2 (not (= 1 ~c_dr_i~0)) .cse11 .cse22 .cse21 .cse23 .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) .cse24 .cse9 .cse4 .cse16 .cse12 .cse5) (or .cse23 .cse2 .cse1 .cse6 .cse5 .cse24 .cse9 .cse17 .cse18 .cse4 .cse20 .cse16 .cse21 .cse22)))) [2018-11-23 01:25:45,614 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2018-11-23 01:25:45,614 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2018-11-23 01:25:45,614 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2018-11-23 01:25:45,614 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2018-11-23 01:25:45,614 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2018-11-23 01:25:45,614 INFO L444 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 21 40) the Hoare annotation is: (let ((.cse12 (= 1 ~c_dr_pc~0)) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse5 (= ~p_dw_pc~0 1)) (.cse9 (= 0 ~c_dr_st~0)) (.cse8 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse13)) (.cse7 (< |old(~q_write_ev~0)| 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse0 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse3 (not (= 2 ~c_dr_st~0))) (.cse10 (or (< ~q_free~0 1) (not .cse12) (< 1 ~q_free~0))) (.cse4 (not (= |old(~q_read_ev~0)| 2))) (.cse6 (< ~p_dw_st~0 2)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse0) (or .cse1 .cse2 (not (= ~q_free~0 0)) .cse3 .cse4 (not .cse5) (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= 0 |old(~q_write_ev~0)|) .cse6)) (or .cse7 .cse1 .cse2 .cse8 .cse9 .cse10 .cse5 .cse6 .cse11) (or .cse12 .cse1 .cse2 .cse9 .cse8) (or .cse7 .cse1 .cse2 (and .cse13 .cse0) .cse3 .cse10 .cse4 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse11)))) [2018-11-23 01:25:45,615 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-11-23 01:25:45,615 INFO L448 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2018-11-23 01:25:45,615 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2018-11-23 01:25:45,615 INFO L448 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2018-11-23 01:25:45,615 INFO L448 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2018-11-23 01:25:45,615 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2018-11-23 01:25:45,615 INFO L448 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2018-11-23 01:25:45,615 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 279 296) the Hoare annotation is: (let ((.cse24 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse25 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse16 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse19 (+ ~c_num_read~0 1)) (.cse18 (= ~p_dw_pc~0 1))) (let ((.cse21 (not (= ~p_dw_st~0 0))) (.cse15 (= 1 ~c_dr_pc~0)) (.cse3 (not .cse18)) (.cse4 (not (= .cse19 ~p_num_write~0))) (.cse7 (not (= ~q_free~0 0))) (.cse23 (= ~q_read_ev~0 1)) (.cse22 (not (= |old(~q_read_ev~0)| 1))) (.cse17 (= 0 ~c_dr_st~0)) (.cse13 (not (= 0 ~q_req_up~0))) (.cse14 (and .cse25 .cse16)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= |old(~q_read_ev~0)| 2))) (.cse5 (and .cse16 .cse24)) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse11 (< ~q_free~0 1)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse10 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (< 1 ~q_free~0)) (.cse9 (< ~p_dw_st~0 2)) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (or .cse6 .cse10 (or .cse0 .cse1 .cse11 .cse8 .cse12 .cse13) .cse9) .cse14) (or .cse1 .cse0 (not .cse15) .cse2 .cse3 .cse4 .cse7 (and .cse16 (= 1 ~q_write_ev~0)) (not (= 1 |old(~q_write_ev~0)|)) .cse13 .cse9) (or .cse6 .cse0 .cse1 .cse14 .cse17 .cse18 .cse13 .cse9) (or .cse1 (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)) (< .cse19 ~q_free~0) .cse20 (< ~q_free~0 .cse19) .cse0 (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse21 .cse13 (not (= 0 ~c_dr_pc~0)) (or .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (or (and (or .cse22 (or .cse6 (or .cse0 .cse1 .cse11 .cse8 .cse21 .cse12 .cse13) .cse3 .cse10)) (or .cse6 .cse0 .cse11 .cse1 .cse8 .cse22 .cse3 .cse21 .cse10 .cse12 .cse20)) (and .cse23 .cse24)) (or .cse6 .cse0 .cse11 .cse1 .cse14 .cse17 .cse18 .cse12 .cse9 .cse20) (or .cse15 .cse0 .cse1 .cse17 .cse14) (or .cse1 .cse0 .cse2 .cse3 .cse4 (= 0 |old(~q_write_ev~0)|) .cse7 .cse8 .cse5 .cse13 .cse9) (or .cse6 (and .cse25 .cse23) .cse22 (or .cse0 .cse1 .cse11 .cse17 .cse12 .cse13) .cse10 .cse9) (or .cse6 .cse0 .cse1 .cse17 .cse2 .cse13 .cse14 .cse9) (or .cse1 .cse0 .cse2 .cse5 .cse6 .cse11 .cse8 .cse10 .cse12 .cse9 .cse20)))) [2018-11-23 01:25:45,615 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2018-11-23 01:25:45,616 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-11-23 01:25:45,616 INFO L448 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2018-11-23 01:25:45,616 INFO L448 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2018-11-23 01:25:45,616 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 455 466) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (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) (not (= ~p_dw_i~0 1)) (= ~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-11-23 01:25:45,616 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-23 01:25:45,616 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2018-11-23 01:25:45,616 INFO L444 ceAbstractionStarter]: At program point L460(line 460) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (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) (not (= ~p_dw_i~0 1)) (= ~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-11-23 01:25:45,616 INFO L444 ceAbstractionStarter]: At program point L460-1(line 460) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (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-11-23 01:25:45,616 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2018-11-23 01:25:45,617 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 114 153) the Hoare annotation is: (let ((.cse12 (= 1 ~c_dr_pc~0)) (.cse17 (+ ~c_num_read~0 1))) (let ((.cse16 (< |old(~q_free~0)| .cse17)) (.cse4 (not (= 2 ~c_dr_st~0))) (.cse3 (not .cse12)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse19 (not (= 0 |old(~p_num_write~0)|))) (.cse20 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (= |old(~p_dw_pc~0)| 1)) (.cse14 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= 0 ~p_num_write~0)) (.cse15 (< .cse17 |old(~q_free~0)|)) (.cse9 (= ~q_req_up~0 0)) (.cse11 (<= ~q_free~0 1)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse21 (< |old(~q_free~0)| 1)) (.cse13 (= 0 ~c_dr_st~0)) (.cse7 (< 1 |old(~q_free~0)|)) (.cse6 (not (= 0 |old(~q_req_up~0)|)))) (and (or (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse0 (< ~q_write_ev~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 (or .cse4 (or .cse2 (or .cse1 .cse3 .cse5 .cse7)))))) (not .cse8))) (and (and (or (and .cse9 .cse10) (and .cse10 .cse11)) (= ~p_dw_pc~0 1)) (= ~c_num_read~0 ~p_num_write~0))) (or .cse12 .cse1 .cse2 .cse13 (and .cse14 .cse10)) (or .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse13) .cse16 .cse1 (and .cse14 .cse9 .cse10 (<= .cse17 ~q_free~0) .cse11 (= ~c_last_read~0 ~p_last_write~0) .cse18) (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) .cse19 .cse20 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse16 (or .cse4 (or .cse2 (or .cse1 .cse21 .cse3 .cse5)) .cse6) .cse19 .cse20 (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) .cse8 (and (and .cse14 .cse9 .cse10 .cse11) (<= (+ ~p_num_write~0 1) ~q_free~0) .cse18) .cse15) (or .cse12 .cse1 .cse2 .cse9 .cse13 .cse6) (or .cse12 (and .cse11 (<= 1 ~q_free~0)) .cse1 .cse2 .cse21 .cse13 .cse7 .cse6)))) [2018-11-23 01:25:45,617 INFO L444 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse14 (= 1 ~c_dr_pc~0)) (.cse17 (+ ~c_num_read~0 1)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse10 (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse16)) (.cse13 (< .cse17 |old(~q_free~0)|)) (.cse15 (= 0 ~c_dr_st~0)) (.cse0 (< |old(~q_free~0)| .cse17)) (.cse9 (<= .cse17 ~q_free~0)) (.cse11 (= 0 ~p_num_write~0)) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse8 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse6 (not (= 0 |old(~q_req_up~0)|))) (.cse1 (not (= 2 ~c_dr_st~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (not .cse14)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse12 (= |old(~p_dw_pc~0)| 1))) (and (or .cse0 (or .cse1 (or .cse2 (or .cse3 (< |old(~q_free~0)| 1) .cse4 .cse5)) .cse6) .cse7 .cse8 (and .cse9 .cse10 (<= ~q_free~0 (+ ~p_num_write~0 1)) .cse11) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) .cse12 .cse13) (or .cse14 .cse3 .cse2 .cse10 .cse15) (or .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse13 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse15) .cse0 .cse3 (not (= 2 ~q_write_ev~0)) (and .cse16 (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) .cse9 (<= ~q_free~0 .cse17) .cse11) (not (= |old(~p_dw_pc~0)| 0)) .cse7 .cse8 .cse6 (not (= 0 ~c_dr_pc~0))) (or (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse18 (< ~q_write_ev~0 2))) (and (or .cse18 .cse3 .cse2 .cse4 .cse1 .cse5 .cse6) (or .cse18 (or .cse1 (or .cse2 (or .cse3 .cse4 .cse5 (< 1 |old(~q_free~0)|))))))) (not .cse12))) (and .cse16 (= ~p_dw_pc~0 1) (= ~c_num_read~0 ~p_num_write~0)))))) [2018-11-23 01:25:45,617 INFO L444 ceAbstractionStarter]: At program point L129-1(lines 117 152) the Hoare annotation is: (let ((.cse19 (= 1 ~c_dr_pc~0)) (.cse8 (+ ~c_num_read~0 1))) (let ((.cse2 (= 0 ~c_dr_st~0)) (.cse3 (< |old(~q_free~0)| .cse8)) (.cse11 (= ~q_free~0 0)) (.cse17 (not (= 2 ~c_dr_st~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse4 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse16 (not .cse19)) (.cse18 (not (= ~q_read_ev~0 2))) (.cse14 (not (= 0 |old(~q_req_up~0)|))) (.cse12 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (= ~q_req_up~0 0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= 0 ~p_num_write~0)) (.cse1 (< .cse8 |old(~q_free~0)|))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse1 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse2) .cse3 .cse4 (and .cse5 .cse6 .cse7 (<= .cse8 ~q_free~0) .cse9 (= ~c_last_read~0 ~p_last_write~0) .cse10) (not (= 2 ~q_write_ev~0)) (and (= ~p_num_write~0 1) .cse5 .cse7 .cse11) (not (= |old(~p_dw_pc~0)| 0)) .cse12 .cse13 .cse14 (not (= 0 ~c_dr_pc~0))) (or (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse15 (< ~q_write_ev~0 2))) (and (or .cse15 .cse4 .cse0 .cse16 .cse17 .cse18 .cse14) (or .cse15 (or .cse17 (or .cse0 (or .cse4 .cse16 .cse18 (< 1 |old(~q_free~0)|))))))) (not (= |old(~p_dw_pc~0)| 1)))) (and (= ~p_dw_pc~0 1) .cse7 .cse11 (= .cse8 ~p_num_write~0))) (or .cse19 .cse4 .cse0 (and .cse5 .cse7) .cse2) (let ((.cse20 (+ |old(~p_num_write~0)| 1))) (or .cse3 (and (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 1) .cse5 .cse7 .cse11) (or .cse17 (or .cse0 (or .cse4 (< |old(~q_free~0)| 1) .cse16 .cse18)) .cse14) .cse12 .cse13 (< .cse20 |old(~q_free~0)|) (and (and .cse5 .cse6 .cse7 .cse9) (<= (+ ~p_num_write~0 1) ~q_free~0) .cse10) .cse1))))) [2018-11-23 01:25:45,617 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2018-11-23 01:25:45,618 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2018-11-23 01:25:45,618 INFO L444 ceAbstractionStarter]: At program point L148(lines 114 153) the Hoare annotation is: (let ((.cse17 (= 1 ~c_dr_pc~0)) (.cse11 (+ ~c_num_read~0 1))) (let ((.cse14 (< |old(~q_free~0)| .cse11)) (.cse4 (not (= 2 ~c_dr_st~0))) (.cse3 (not .cse17)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse6 (not (= 0 |old(~q_req_up~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse7 (<= 2 ~p_dw_st~0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~q_free~0 0)) (.cse12 (< .cse11 |old(~q_free~0)|)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse13 (= 0 ~c_dr_st~0))) (and (or (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse0 (< ~q_write_ev~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 (or .cse4 (or .cse2 (or .cse1 .cse3 .cse5 (< 1 |old(~q_free~0)|))))))) (not (= |old(~p_dw_pc~0)| 1)))) (and .cse7 .cse8 .cse9 .cse10 (= .cse11 ~p_num_write~0))) (or .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse13) .cse14 .cse1 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) .cse15 .cse16 (and (= ~p_dw_st~0 2) (= ~p_num_write~0 1) .cse8 .cse9 .cse10) .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse17 .cse1 .cse2 .cse13 .cse9) (let ((.cse18 (+ |old(~p_num_write~0)| 1))) (or .cse14 (or .cse4 (or .cse2 (or .cse1 (< |old(~q_free~0)| 1) .cse3 .cse5)) .cse6) .cse15 .cse16 (and .cse7 (<= .cse18 ~p_num_write~0) (<= ~p_num_write~0 1) .cse8 .cse9 .cse10) (< .cse18 |old(~q_free~0)|) .cse12)) (or .cse17 .cse1 .cse2 .cse13 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (not (= 1 |old(~p_dw_pc~0)|)))))) [2018-11-23 01:25:45,618 INFO L448 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2018-11-23 01:25:45,618 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-23 01:25:45,618 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-23 01:25:45,618 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-23 01:25:45,618 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-23 01:25:45,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:25:45,618 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-11-23 01:25:45,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:25:45,618 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-23 01:25:45,618 INFO L451 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2018-11-23 01:25:45,618 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-23 01:25:45,618 INFO L451 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2018-11-23 01:25:45,618 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2018-11-23 01:25:45,619 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2018-11-23 01:25:45,619 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2018-11-23 01:25:45,619 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 322 375) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse32 (= |old(~p_dw_pc~0)| 1)) (.cse24 (<= 1 ~q_free~0)) (.cse23 (<= ~q_free~0 1)) (.cse36 (+ ~c_num_read~0 1)) (.cse34 (+ |old(~c_num_read~0)| 1)) (.cse4 (not (= 0 ~c_dr_st~0))) (.cse13 (<= 2 ~p_dw_st~0)) (.cse5 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse14 (= ~q_req_up~0 0)) (.cse18 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse33 (and .cse4 .cse13 .cse5 .cse14 .cse18 .cse6)) (.cse10 (not (= .cse34 |old(~p_num_write~0)|))) (.cse19 (= ~q_free~0 0)) (.cse20 (= .cse36 ~p_num_write~0)) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse38 (and .cse24 .cse23)) (.cse15 (= ~p_dw_pc~0 1)) (.cse16 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse27 (= ~c_num_read~0 ~p_num_write~0)) (.cse35 (= ~p_dw_st~0 0)) (.cse17 (= 2 ~c_dr_st~0)) (.cse9 (not .cse32)) (.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse8 (not (= ~q_read_ev~0 2))) (.cse37 (not (= |old(~p_dw_st~0)| 0))) (.cse21 (not (= 0 |old(~q_req_up~0)|))) (.cse30 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse29 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse25 (< |old(~q_free~0)| 1)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse7 (not .cse0)) (.cse28 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse26 (< 1 |old(~q_free~0)|)) (.cse22 (< |old(~p_dw_st~0)| 2)) (.cse31 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (not (= ~c_dr_pc~0 1)) .cse4 .cse5 .cse6)) (or .cse2 .cse1 .cse7 .cse8 .cse9 .cse10 (= 0 ~q_write_ev~0) .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse6 .cse19 .cse20) .cse21 .cse22) (or .cse0 (and .cse23 .cse24) .cse1 .cse2 .cse25 .cse3 .cse26 .cse21) (or .cse2 .cse1 .cse7 .cse8 .cse9 (and .cse13 .cse15 .cse16 .cse27 .cse17 .cse18 .cse6 .cse24 .cse23 .cse28) .cse29 .cse25 .cse12 .cse30 .cse26 .cse22 .cse31) (or .cse29 .cse1 .cse25 .cse2 .cse7 .cse12 .cse17 .cse32 .cse26 .cse22 .cse31) (or .cse29 .cse1 .cse2 .cse7 .cse33 .cse3 .cse32 .cse21 .cse22) (or .cse29 .cse1 .cse2 .cse7 .cse3 .cse8 .cse21 .cse33 .cse22) (or .cse1 .cse2 .cse7 .cse8 .cse9 .cse10 .cse29 .cse11 .cse21 .cse22 (and .cse13 .cse14 .cse15 .cse16 .cse18 .cse6 .cse19 .cse20)) (or .cse1 .cse2 .cse7 .cse8 .cse9 .cse10 (and .cse13 .cse15 .cse16 .cse17 .cse18 .cse6 .cse19 .cse20) .cse29 .cse11 .cse12 .cse22) (or .cse0 .cse1 .cse2 .cse14 .cse3 .cse21) (or .cse29 .cse1 .cse2 .cse7 .cse12 .cse17 .cse32 .cse21 .cse22) (or .cse2 .cse1 .cse7 .cse8 (and (= ~c_num_read~0 1) (= ~p_num_write~0 1)) .cse29 .cse25 .cse3 (not (= 1 |old(~p_num_write~0)|)) .cse32 (not (= 1 |old(~c_num_read~0)|)) .cse26 .cse22 .cse31) (or .cse29 .cse17 .cse1 .cse2 .cse7 .cse12 .cse8 .cse21 .cse22) (or .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse34 |old(~q_free~0)|) .cse31 (not .cse3) (< |old(~q_free~0)| .cse34) .cse1 (and .cse35 (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) .cse5 .cse14 .cse6 (= ~c_num_read~0 0) (<= .cse36 ~q_free~0) .cse23 .cse28 (= 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)) .cse37 .cse21 (not (= 0 |old(~c_dr_pc~0)|))) (or .cse0 .cse1 .cse2 .cse35 .cse3 .cse37) (or (or .cse29 .cse9 .cse30 (or .cse1 .cse2 .cse25 .cse7 .cse12 .cse26 .cse21) .cse22) (and .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse6 .cse24 .cse23)) (or .cse29 .cse38 (or .cse1 .cse2 .cse25 .cse3 .cse32 .cse26 .cse21) .cse22) (or (or .cse1 .cse25 .cse2 .cse3 .cse8 .cse26 .cse21) .cse38 .cse29 .cse22) (or (or (and .cse15 .cse16 .cse27 .cse35 .cse17 .cse18 .cse6 .cse24 .cse23 .cse28) (and .cse15 .cse14 .cse16 .cse27 .cse35 .cse17 .cse18 .cse6 .cse24 .cse23)) (and (or .cse2 .cse1 .cse7 .cse8 .cse9 .cse29 .cse25 .cse12 .cse37 .cse30 .cse26 .cse31) (or .cse29 .cse9 (or .cse1 .cse25 .cse2 .cse7 .cse12 .cse8 .cse37 .cse26 .cse21) .cse30))) (or .cse29 .cse1 .cse25 .cse2 .cse7 (and .cse4 .cse13 .cse5 .cse18 .cse6 .cse24 .cse23 .cse28) .cse3 .cse32 .cse26 .cse22 .cse31)))) [2018-11-23 01:25:45,619 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2018-11-23 01:25:45,619 INFO L448 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2018-11-23 01:25:45,620 INFO L444 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse37 (= 1 |old(~c_dr_pc~0)|)) (.cse26 (+ |old(~p_num_write~0)| 1)) (.cse31 (<= 1 ~q_free~0)) (.cse32 (<= ~q_free~0 1)) (.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse34 (not (= 0 ~c_dr_st~0))) (.cse16 (<= 2 ~p_dw_st~0)) (.cse35 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (= ~q_req_up~0 0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse42 (= ~p_dw_i~0 1)) (.cse41 (+ |old(~c_num_read~0)| 1))) (let ((.cse13 (not (= .cse41 |old(~p_num_write~0)|))) (.cse24 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse36 (and .cse34 .cse16 .cse35 (<= 2 ~q_write_ev~0) .cse17 .cse21 .cse22 (= 2 ~q_read_ev~0) .cse42)) (.cse12 (not .cse7)) (.cse28 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse15 (not (= 2 |old(~c_dr_st~0)|))) (.cse19 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse30 (= ~c_num_read~0 ~p_num_write~0)) (.cse11 (not (= ~q_read_ev~0 2))) (.cse1 (and .cse31 .cse32)) (.cse39 (= ~c_num_read~0 1)) (.cse40 (= ~p_num_write~0 1)) (.cse20 (= 2 ~c_dr_st~0)) (.cse25 (<= .cse26 ~p_num_write~0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse23 (= ~q_free~0 0)) (.cse38 (and (not (= ~c_dr_pc~0 1)) .cse34 .cse22)) (.cse27 (not (= |old(~p_dw_st~0)| 0))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (< |old(~q_free~0)| 1)) (.cse3 (not .cse42)) (.cse5 (not .cse37)) (.cse33 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 0 |old(~c_dr_st~0)|)) (.cse8 (< 1 |old(~q_free~0)|)) (.cse10 (< |old(~p_dw_st~0)| 2)) (.cse29 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse13 (= 0 ~q_write_ev~0) .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse9 .cse10) (or (and .cse16 .cse18 .cse20 .cse21 .cse22 .cse25 (<= ~p_num_write~0 .cse26) .cse23 .cse24) (and (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse0 .cse4 .cse15 .cse27 .cse28 .cse8 .cse29) (or .cse0 .cse12 (or .cse2 .cse4 .cse3 .cse5 .cse15 .cse11 .cse27 .cse8 .cse9) .cse28))) (or .cse3 .cse2 .cse5 .cse11 .cse12 (and .cse16 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse31 .cse32 .cse33) .cse0 .cse4 .cse15 .cse28 .cse8 .cse10 .cse29) (or .cse0 .cse2 .cse4 .cse3 .cse5 .cse15 .cse20 .cse7 .cse8 .cse10 .cse29) (or .cse0 .cse2 .cse3 .cse5 (and .cse34 .cse16 .cse35 .cse17 .cse21 .cse22) .cse6 .cse7 .cse9 .cse10) (or .cse2 .cse3 .cse5 .cse11 .cse12 .cse13 .cse36 .cse0 .cse14 .cse9 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse16 .cse18 .cse30 .cse20 .cse21 .cse22 .cse31 .cse32 .cse33) .cse10) (or .cse2 .cse3 .cse5 .cse11 .cse12 .cse13 (and .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse0 .cse14 .cse15 .cse10) (or .cse37 .cse2 .cse3 .cse6 .cse38) (or .cse0 .cse2 .cse3 .cse5 .cse15 .cse20 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse11 .cse9 .cse36 .cse10) (or .cse3 .cse2 .cse5 .cse11 (and .cse39 .cse40) .cse0 .cse4 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse10 .cse29) (or .cse0 .cse20 .cse2 .cse3 .cse5 .cse15 .cse11 .cse9 .cse10) (or (or .cse0 .cse12 .cse28 (or .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9) .cse10) (and .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse31 .cse32)) (or (or .cse2 .cse4 .cse3 .cse5 .cse6 .cse11 .cse8 .cse9) .cse1 .cse0 .cse10) (or .cse3 (and .cse16 .cse20 .cse39 .cse31 .cse40 .cse18 .cse22 .cse32 .cse33) (not (= 1 ~c_dr_i~0)) (and .cse16 .cse20 .cse25 (<= ~p_num_write~0 1) .cse18 .cse22 (= ~c_num_read~0 0) .cse23) (not (= 0 |old(~c_num_read~0)|)) (< .cse41 |old(~q_free~0)|) .cse29 (< |old(~q_free~0)| .cse41) .cse2 (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)) .cse38 .cse27 .cse9 (not (= 0 |old(~c_dr_pc~0)|))) (or .cse0 .cse2 .cse4 .cse3 .cse5 (and .cse34 .cse16 .cse35 .cse21 .cse22 .cse31 .cse32 .cse33) .cse6 .cse7 .cse8 .cse10 .cse29)))) [2018-11-23 01:25:45,620 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2018-11-23 01:25:45,621 INFO L444 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse47 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse42 (+ ~c_num_read~0 1)) (.cse48 (+ |old(~p_num_write~0)| 1)) (.cse26 (<= 1 ~q_free~0)) (.cse28 (<= ~q_free~0 1)) (.cse16 (<= 2 ~p_dw_st~0)) (.cse32 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (= ~q_req_up~0 0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse49 (= ~p_dw_i~0 1)) (.cse45 (not (= 0 ~c_dr_st~0))) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse36 (+ |old(~c_num_read~0)| 1))) (let ((.cse13 (not (= .cse36 |old(~p_num_write~0)|))) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse40 (and (not (= ~c_dr_pc~0 1)) .cse45 .cse22)) (.cse46 (and .cse45 .cse16 .cse32 (<= 2 ~q_write_ev~0) .cse17 .cse21 .cse22 (= 2 ~q_read_ev~0) .cse49)) (.cse25 (= ~c_num_read~0 1)) (.cse27 (= ~p_num_write~0 1)) (.cse1 (and .cse26 .cse28)) (.cse19 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse43 (= ~c_num_read~0 ~p_num_write~0)) (.cse30 (= ~p_dw_st~0 0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse20 (= 2 ~c_dr_st~0)) (.cse39 (<= .cse48 ~p_num_write~0)) (.cse23 (= ~q_free~0 0)) (.cse24 (= .cse42 ~p_num_write~0)) (.cse12 (not .cse7)) (.cse15 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= ~q_read_ev~0 2))) (.cse41 (not (= |old(~p_dw_st~0)| 0))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse44 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (< |old(~q_free~0)| 1)) (.cse3 (not .cse49)) (.cse5 (not .cse47)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 0 |old(~c_dr_st~0)|)) (.cse8 (< 1 |old(~q_free~0)|)) (.cse10 (< |old(~p_dw_st~0)| 2)) (.cse37 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse13 (= 0 ~q_write_ev~0) .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse9 .cse10) (let ((.cse31 (= ~c_dr_pc~0 0)) (.cse33 (= ~c_num_read~0 0)) (.cse34 (<= .cse42 ~q_free~0)) (.cse38 (<= 1 eval_~tmp___1~0)) (.cse35 (= 0 ~p_num_write~0))) (or .cse3 (and .cse16 .cse20 .cse25 .cse26 .cse27 .cse18 .cse22 .cse28 .cse29) (not (= 1 ~c_dr_i~0)) (and .cse30 .cse31 .cse32 .cse17 .cse22 .cse33 .cse34 .cse28 .cse29 .cse35) (not (= 0 |old(~c_num_read~0)|)) (< .cse36 |old(~q_free~0)|) .cse37 (< |old(~q_free~0)| .cse36) .cse2 (and (= ~p_dw_st~0 2) .cse27 .cse31 .cse18 .cse22 .cse33 .cse23 .cse38) (and .cse16 .cse20 .cse39 (<= ~p_num_write~0 1) .cse18 .cse22 .cse33 .cse23) (and .cse30 .cse20 .cse32 (= |old(~c_num_read~0)| ~c_num_read~0) .cse17 .cse22 .cse34 .cse28 .cse38 .cse29 .cse35) (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)) .cse40 .cse41 .cse9 (not (= 0 |old(~c_dr_pc~0)|)))) (or .cse3 .cse2 .cse5 .cse11 .cse12 (and .cse16 .cse18 .cse19 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) .cse0 .cse4 .cse15 .cse44 .cse8 .cse10 .cse37) (or .cse0 .cse2 .cse4 .cse3 .cse5 .cse15 .cse20 .cse7 .cse8 .cse10 .cse37) (or .cse0 .cse2 .cse3 .cse5 (and .cse45 .cse16 .cse32 .cse17 .cse21 .cse22) .cse6 .cse7 .cse9 .cse10) (or .cse2 .cse3 .cse5 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse16 .cse18 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) .cse11 .cse12 .cse13 .cse46 .cse0 .cse14 (and .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) .cse9 .cse10) (or .cse2 .cse3 .cse5 .cse11 .cse12 .cse13 (and .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse0 .cse14 .cse15 .cse10) (or .cse47 .cse2 .cse3 .cse6 .cse40) (or .cse0 .cse2 .cse3 .cse5 .cse15 .cse20 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse11 .cse9 .cse46 .cse10) (or .cse3 .cse2 .cse5 .cse11 (and .cse25 .cse27) .cse0 .cse4 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse10 .cse37) (or .cse0 .cse20 .cse2 .cse3 .cse5 .cse15 .cse11 .cse9 .cse10) (or (or .cse0 .cse12 .cse44 (or .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9) .cse10) (and .cse16 .cse17 .cse18 .cse19 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28)) (or (or .cse2 .cse4 .cse3 .cse5 .cse6 .cse11 .cse8 .cse9) .cse1 .cse0 .cse10) (or (or (and .cse18 .cse19 .cse43 .cse30 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) (and .cse18 .cse17 .cse19 .cse43 .cse30 .cse20 .cse21 .cse22 .cse26 .cse28)) (and .cse16 .cse18 .cse20 .cse21 .cse22 .cse39 (<= ~p_num_write~0 .cse48) .cse23 .cse24) (and (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse0 .cse4 .cse15 .cse41 .cse44 .cse8 .cse37) (or .cse0 .cse12 (or .cse2 .cse4 .cse3 .cse5 .cse15 .cse11 .cse41 .cse8 .cse9) .cse44))) (or .cse0 .cse2 .cse4 .cse3 .cse5 (and .cse45 .cse16 .cse32 .cse21 .cse22 .cse26 .cse28 .cse29) .cse6 .cse7 .cse8 .cse10 .cse37)))) [2018-11-23 01:25:45,621 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2018-11-23 01:25:45,621 INFO L444 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse23 (= 1 |old(~c_dr_pc~0)|)) (.cse19 (+ |old(~c_num_read~0)| 1)) (.cse30 (= |old(~p_dw_pc~0)| 1)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse21 (and (not (= ~c_dr_pc~0 1)) (not (= 0 ~c_dr_st~0)) .cse16)) (.cse14 (= ~q_req_up~0 0)) (.cse15 (= 2 ~c_dr_st~0)) (.cse17 (<= ~q_free~0 1)) (.cse12 (<= 1 eval_~tmp___1~0)) (.cse22 (not (= |old(~p_dw_st~0)| 0))) (.cse27 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (not (= 2 |old(~c_dr_st~0)|))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse4 (not .cse30)) (.cse5 (not (= .cse19 |old(~p_num_write~0)|))) (.cse26 (< |old(~q_free~0)| 1)) (.cse28 (< 1 |old(~q_free~0)|)) (.cse20 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse25 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse2 (not .cse23)) (.cse24 (= 0 |old(~c_dr_st~0)|)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse8 (not (= 0 |old(~q_req_up~0)|))) (.cse9 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~q_write_ev~0) .cse6 .cse7 .cse8 .cse9) (let ((.cse11 (+ ~c_num_read~0 1))) (let ((.cse13 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse10 (<= .cse11 ~q_free~0)) (.cse18 (= 0 ~p_num_write~0))) (or .cse0 (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (and .cse10 (<= ~q_free~0 .cse11) .cse12 (and .cse13 .cse14 .cse15 .cse16 (<= 1 ~q_free~0) .cse17) .cse18) (< .cse19 |old(~q_free~0)|) .cse20 (< |old(~q_free~0)| .cse19) .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)) .cse21 (and (= ~c_dr_pc~0 0) .cse13 .cse14 .cse16 (= ~c_num_read~0 0) .cse10 .cse17 .cse12 (= ~c_last_read~0 ~p_last_write~0) .cse18) .cse22 .cse8 (not (= 0 |old(~c_dr_pc~0)|))))) (or .cse23 .cse1 .cse0 .cse24 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse25 .cse26 .cse7 .cse27 .cse28 .cse9 .cse20) (or (and (and (and (let ((.cse29 (= 1 ~c_dr_pc~0))) (or (and .cse14 .cse15 .cse29 .cse16) (and .cse15 .cse29 .cse16 .cse17))) (= ~p_dw_pc~0 1)) (= |old(~p_num_write~0)| ~p_num_write~0) (= ~c_num_read~0 ~p_num_write~0)) .cse12) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse26 .cse7 .cse22 .cse27 .cse28 .cse20) (or .cse25 .cse4 (or .cse1 .cse26 .cse0 .cse2 .cse7 .cse3 .cse22 .cse28 .cse8) .cse27))) (or .cse25 .cse27 (or .cse1 .cse0 .cse26 .cse2 .cse7 .cse28 .cse8) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse7 .cse9) (or .cse25 .cse1 .cse0 .cse2 .cse6 .cse3 .cse4 .cse5 .cse8 .cse9) (or .cse25 .cse1 .cse26 .cse0 .cse2 .cse24 .cse30 .cse28 .cse9 .cse20) (or .cse25 .cse1 .cse0 .cse2 .cse24 .cse30 .cse8 .cse9) (or .cse25 .cse1 .cse0 .cse2 .cse24 .cse3 .cse8 .cse9)))) [2018-11-23 01:25:45,621 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2018-11-23 01:25:45,621 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2018-11-23 01:25:45,621 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-23 01:25:45,622 INFO L444 ceAbstractionStarter]: At program point L330(line 330) the Hoare annotation is: (let ((.cse47 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse42 (+ ~c_num_read~0 1)) (.cse48 (+ |old(~p_num_write~0)| 1)) (.cse26 (<= 1 ~q_free~0)) (.cse28 (<= ~q_free~0 1)) (.cse16 (<= 2 ~p_dw_st~0)) (.cse32 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (= ~q_req_up~0 0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse49 (= ~p_dw_i~0 1)) (.cse45 (not (= 0 ~c_dr_st~0))) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse36 (+ |old(~c_num_read~0)| 1))) (let ((.cse13 (not (= .cse36 |old(~p_num_write~0)|))) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse40 (and (not (= ~c_dr_pc~0 1)) .cse45 .cse22)) (.cse46 (and .cse45 .cse16 .cse32 (<= 2 ~q_write_ev~0) .cse17 .cse21 .cse22 (= 2 ~q_read_ev~0) .cse49)) (.cse25 (= ~c_num_read~0 1)) (.cse27 (= ~p_num_write~0 1)) (.cse1 (and .cse26 .cse28)) (.cse19 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse43 (= ~c_num_read~0 ~p_num_write~0)) (.cse30 (= ~p_dw_st~0 0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse20 (= 2 ~c_dr_st~0)) (.cse39 (<= .cse48 ~p_num_write~0)) (.cse23 (= ~q_free~0 0)) (.cse24 (= .cse42 ~p_num_write~0)) (.cse12 (not .cse7)) (.cse15 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= ~q_read_ev~0 2))) (.cse41 (not (= |old(~p_dw_st~0)| 0))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse44 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (< |old(~q_free~0)| 1)) (.cse3 (not .cse49)) (.cse5 (not .cse47)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 0 |old(~c_dr_st~0)|)) (.cse8 (< 1 |old(~q_free~0)|)) (.cse10 (< |old(~p_dw_st~0)| 2)) (.cse37 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse13 (= 0 ~q_write_ev~0) .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse9 .cse10) (let ((.cse31 (= ~c_dr_pc~0 0)) (.cse33 (= ~c_num_read~0 0)) (.cse34 (<= .cse42 ~q_free~0)) (.cse38 (<= 1 eval_~tmp___1~0)) (.cse35 (= 0 ~p_num_write~0))) (or .cse3 (and .cse16 .cse20 .cse25 .cse26 .cse27 .cse18 .cse22 .cse28 .cse29) (not (= 1 ~c_dr_i~0)) (and .cse30 .cse31 .cse32 .cse17 .cse22 .cse33 .cse34 .cse28 .cse29 .cse35) (not (= 0 |old(~c_num_read~0)|)) (< .cse36 |old(~q_free~0)|) .cse37 (< |old(~q_free~0)| .cse36) .cse2 (and (= ~p_dw_st~0 2) .cse27 .cse31 .cse18 .cse22 .cse33 .cse23 .cse38) (and .cse16 .cse20 .cse39 (<= ~p_num_write~0 1) .cse18 .cse22 .cse33 .cse23) (and .cse30 .cse20 .cse32 (= |old(~c_num_read~0)| ~c_num_read~0) .cse17 .cse22 .cse34 .cse28 .cse38 .cse29 .cse35) (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)) .cse40 .cse41 .cse9 (not (= 0 |old(~c_dr_pc~0)|)))) (or .cse3 .cse2 .cse5 .cse11 .cse12 (and .cse16 .cse18 .cse19 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) .cse0 .cse4 .cse15 .cse44 .cse8 .cse10 .cse37) (or .cse0 .cse2 .cse4 .cse3 .cse5 .cse15 .cse20 .cse7 .cse8 .cse10 .cse37) (or .cse0 .cse2 .cse3 .cse5 (and .cse45 .cse16 .cse32 .cse17 .cse21 .cse22) .cse6 .cse7 .cse9 .cse10) (or .cse2 .cse3 .cse5 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse16 .cse18 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) .cse11 .cse12 .cse13 .cse46 .cse0 .cse14 (and .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) .cse9 .cse10) (or .cse2 .cse3 .cse5 .cse11 .cse12 .cse13 (and .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse0 .cse14 .cse15 .cse10) (or .cse47 .cse2 .cse3 .cse6 .cse40) (or .cse0 .cse2 .cse3 .cse5 .cse15 .cse20 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse11 .cse9 .cse46 .cse10) (or .cse3 .cse2 .cse5 .cse11 (and .cse25 .cse27) .cse0 .cse4 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse10 .cse37) (or .cse0 .cse20 .cse2 .cse3 .cse5 .cse15 .cse11 .cse9 .cse10) (or (or .cse0 .cse12 .cse44 (or .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9) .cse10) (and .cse16 .cse17 .cse18 .cse19 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28)) (or (or .cse2 .cse4 .cse3 .cse5 .cse6 .cse11 .cse8 .cse9) .cse1 .cse0 .cse10) (or (or (and .cse18 .cse19 .cse43 .cse30 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) (and .cse18 .cse17 .cse19 .cse43 .cse30 .cse20 .cse21 .cse22 .cse26 .cse28)) (and .cse16 .cse18 .cse20 .cse21 .cse22 .cse39 (<= ~p_num_write~0 .cse48) .cse23 .cse24) (and (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse0 .cse4 .cse15 .cse41 .cse44 .cse8 .cse37) (or .cse0 .cse12 (or .cse2 .cse4 .cse3 .cse5 .cse15 .cse11 .cse41 .cse8 .cse9) .cse44))) (or .cse0 .cse2 .cse4 .cse3 .cse5 (and .cse45 .cse16 .cse32 .cse21 .cse22 .cse26 .cse28 .cse29) .cse6 .cse7 .cse8 .cse10 .cse37)))) [2018-11-23 01:25:45,623 INFO L444 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse27 (= |old(~p_dw_pc~0)| 1)) (.cse10 (+ |old(~c_num_read~0)| 1))) (let ((.cse2 (<= 2 ~p_dw_st~0)) (.cse1 (not (= 0 ~c_dr_st~0))) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse9 (+ ~c_num_read~0 1)) (.cse8 (<= 1 eval_~tmp___1~0)) (.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse23 (= 0 |old(~c_dr_st~0)|)) (.cse18 (not (= .cse10 |old(~p_num_write~0)|))) (.cse20 (not (= |old(~q_free~0)| 0))) (.cse21 (< |old(~p_dw_st~0)| 2)) (.cse11 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse19 (< ~q_write_ev~0 2)) (.cse17 (not .cse27)) (.cse12 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse25 (< |old(~q_free~0)| 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse22 (not (= 2 |old(~c_dr_st~0)|))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse13 (not (= |old(~p_dw_st~0)| 0))) (.cse26 (< 1 |old(~q_free~0)|)) (.cse14 (not (= 0 |old(~q_req_up~0)|))) (.cse24 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)))) (and (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_num_read~0 0))) (or .cse0 (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (= ~p_num_write~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~p_dw_st~0 0) .cse3 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_req_up~0 0) .cse5 .cse6 (<= .cse9 ~q_free~0) (<= ~q_free~0 1) .cse8 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse10 |old(~q_free~0)|) .cse11 (< |old(~q_free~0)| .cse10) .cse12 (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)) .cse13 .cse14 (not (= 0 |old(~c_dr_pc~0)|)))) (or .cse12 .cse0 (not .cse15) .cse16 .cse17 (and .cse2 .cse1 .cse4 (= |old(~p_num_write~0)| ~p_num_write~0) (= 1 ~c_dr_pc~0) .cse5 .cse7 (= .cse9 ~p_num_write~0) .cse8) .cse18 .cse19 .cse20 .cse14 .cse21) (or .cse0 .cse12 .cse16 .cse17 .cse18 (= 0 ~q_write_ev~0) .cse20 .cse22 .cse14 .cse21) (or .cse15 .cse12 .cse0 .cse23) (or .cse19 .cse24 (or .cse12 .cse0 .cse25 .cse22 .cse26 .cse14) .cse21) (or .cse19 .cse12 .cse25 .cse0 .cse23 .cse27 .cse26 .cse21 .cse11) (or .cse0 .cse12 .cse16 .cse17 .cse19 .cse25 .cse22 .cse13 .cse24 .cse26 .cse11) (or .cse19 .cse12 .cse0 .cse23 .cse27 .cse14 .cse21) (or .cse19 .cse12 .cse0 .cse23 .cse16 .cse14 .cse21) (or .cse0 .cse12 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse21) (or .cse0 .cse12 .cse16 .cse19 .cse25 .cse22 .cse24 .cse26 .cse21 .cse11) (or .cse19 .cse17 (or .cse12 .cse25 .cse0 .cse22 .cse16 .cse13 .cse26 .cse14) .cse24)))) [2018-11-23 01:25:45,623 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2018-11-23 01:25:45,623 INFO L444 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse20 (= 1 ~c_dr_pc~0)) (.cse17 (+ ~c_num_read~0 1))) (let ((.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (= .cse17 ~p_num_write~0))) (.cse13 (not (= 1 ~p_dw_pc~0))) (.cse14 (not (= ~q_free~0 0))) (.cse4 (or (not .cse20) (not (= ~q_read_ev~0 2)))) (.cse7 (< ~p_dw_st~0 2)) (.cse3 (= 0 ~c_dr_st~0)) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse8 (< ~q_free~0 1)) (.cse15 (not (= 2 ~c_dr_st~0))) (.cse18 (not (= ~p_dw_st~0 0))) (.cse10 (< 1 ~q_free~0)) (.cse6 (not (= 0 ~q_req_up~0))) (.cse9 (= ~p_dw_pc~0 1)) (.cse16 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse19 (not (= ~q_read_ev~0 1))) (.cse5 (= 0 is_do_read_c_triggered_~__retres1~1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse5 .cse3 .cse9 .cse10 .cse7 .cse11) (or .cse2 .cse1 (= 1 ~q_write_ev~0) .cse12 (= 0 ~q_write_ev~0) .cse5 .cse13 .cse14 .cse15 .cse4 .cse6 .cse7) (or (or .cse16 (or .cse0 (or (or .cse1 .cse2 .cse8 .cse15 .cse10) .cse6) .cse7)) .cse5) (or .cse2 .cse1 .cse0 .cse8 .cse15 .cse4 .cse5 .cse16 .cse10 .cse7 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse6 .cse5 .cse7) (or .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse17 ~q_free~0) .cse11 (< ~q_free~0 .cse17) .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) .cse18 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse2 .cse1 .cse12 .cse13 .cse0 .cse5 .cse14 .cse15 .cse4 .cse7) (or (or .cse0 (or (or .cse1 .cse2 .cse8 .cse3 .cse10) .cse6) .cse7) .cse19 .cse16 .cse5) (or .cse1 .cse2 .cse5 .cse3 .cse20) (or (or .cse0 (or .cse1 .cse2 .cse8 .cse15 .cse18 .cse10 .cse6) (not .cse9) .cse16) .cse19 .cse5)))) [2018-11-23 01:25:45,623 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2018-11-23 01:25:45,623 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-23 01:25:45,623 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2018-11-23 01:25:45,623 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2018-11-23 01:25:45,623 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2018-11-23 01:25:45,624 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse15 (= ~p_dw_pc~0 1)) (.cse5 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~q_read_ev~0))) (let ((.cse9 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~q_free~0 0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (and .cse5 .cse0 .cse6 .cse7)) (.cse10 (= ~q_req_up~0 0)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse11 (not (= 0 ~c_dr_st~0))) (.cse1 (<= 2 ~p_dw_st~0)) (.cse17 (not .cse15)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~q_free~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse9 (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)) (and .cse1 .cse2 (and .cse11 .cse10 .cse6 .cse7)) (and .cse12 .cse13 .cse1 .cse14 .cse10 .cse15 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (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)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse12 .cse13 (and .cse1 .cse14 .cse2) .cse15) (and (not (= ~c_dr_pc~0 1)) .cse11 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse11 .cse1 .cse2 .cse17 .cse10 .cse6) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse11 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse8) (not (= 0 |old(~q_req_up~0)|))))) [2018-11-23 01:25:45,624 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-11-23 01:25:45,624 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1)) (.cse11 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse19 (+ ~c_num_read~0 1))) (let ((.cse1 (= ~q_free~0 0)) (.cse2 (= .cse19 ~p_num_write~0)) (.cse15 (and .cse11 .cse0 .cse7 .cse8)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse14 (not (= 0 ~c_dr_st~0))) (.cse3 (<= 2 ~p_dw_st~0)) (.cse18 (not .cse6)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse12 (<= 1 ~q_free~0)) (.cse17 (= ~p_dw_st~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= 1 ~c_dr_pc~0) .cse7 .cse8)) (and .cse3 .cse4 (and .cse9 .cse10 .cse11 .cse7 .cse8 .cse12) .cse13) (and .cse13 (and .cse3 .cse4 .cse9 .cse5 .cse11 .cse7 .cse12)) (and .cse3 .cse4 (and .cse14 .cse5 .cse7 .cse8)) (and .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse4 .cse6 .cse13 (and .cse9 .cse10 .cse17 .cse11 .cse7 .cse8 .cse12)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse1 .cse2 (and .cse3 .cse15 .cse4) .cse6) (and (not (= ~c_dr_pc~0 1)) .cse14 .cse7) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse14 .cse3 .cse4 .cse18 .cse5 .cse7) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (and .cse6 .cse13 (and .cse4 (and .cse9 .cse5 .cse17 .cse11 .cse7 .cse8 .cse12))) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse14 .cse3 .cse18 .cse4 .cse9 .cse10 .cse7 .cse12) (not (= 0 |old(~q_req_up~0)|)) (and .cse17 (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse5 .cse7 (= ~c_num_read~0 0) (<= .cse19 ~q_free~0) .cse9 .cse10 (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0))))) [2018-11-23 01:25:45,624 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-23 01:25:45,624 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2018-11-23 01:25:45,625 INFO L444 ceAbstractionStarter]: At program point L409-1(lines 406 431) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1)) (.cse11 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse19 (+ ~c_num_read~0 1))) (let ((.cse1 (= ~q_free~0 0)) (.cse2 (= .cse19 ~p_num_write~0)) (.cse15 (and .cse11 .cse0 .cse7 .cse8)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse14 (not (= 0 ~c_dr_st~0))) (.cse3 (<= 2 ~p_dw_st~0)) (.cse18 (not .cse6)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse12 (<= 1 ~q_free~0)) (.cse17 (= ~p_dw_st~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= 1 ~c_dr_pc~0) .cse7 .cse8)) (and .cse3 .cse4 (and .cse9 .cse10 .cse11 .cse7 .cse8 .cse12) .cse13) (and .cse13 (and .cse3 .cse4 .cse9 .cse5 .cse11 .cse7 .cse12)) (and .cse3 .cse4 (and .cse14 .cse5 .cse7 .cse8)) (and .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse4 .cse6 .cse13 (and .cse9 .cse10 .cse17 .cse11 .cse7 .cse8 .cse12)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse1 .cse2 (and .cse3 .cse15 .cse4) .cse6) (and (not (= ~c_dr_pc~0 1)) .cse14 .cse7) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse14 .cse3 .cse4 .cse18 .cse5 .cse7) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (and .cse6 .cse13 (and .cse4 (and .cse9 .cse5 .cse17 .cse11 .cse7 .cse8 .cse12))) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse14 .cse3 .cse18 .cse4 .cse9 .cse10 .cse7 .cse12) (not (= 0 |old(~q_req_up~0)|)) (and .cse17 (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse5 .cse7 (= ~c_num_read~0 0) (<= .cse19 ~q_free~0) .cse9 .cse10 (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0))))) [2018-11-23 01:25:45,625 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-11-23 01:25:45,625 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-11-23 01:25:45,626 INFO L451 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2018-11-23 01:25:45,626 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-11-23 01:25:45,626 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-23 01:25:45,627 INFO L444 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse15 (= ~p_dw_pc~0 1)) (.cse5 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~q_read_ev~0))) (let ((.cse9 (= ~c_num_read~0 ~p_num_write~0)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~q_read_ev~0 1)) (.cse14 (and .cse5 .cse0 .cse6 .cse7)) (.cse12 (= ~q_free~0 0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse10 (= ~q_req_up~0 0)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse11 (not (= 0 ~c_dr_st~0))) (.cse1 (<= 2 ~p_dw_st~0)) (.cse19 (not .cse15)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~q_free~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse9 (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)) (and .cse1 .cse2 (and .cse11 .cse10 .cse6 .cse7)) (and .cse12 .cse13 .cse1 .cse14 .cse10 .cse15 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (and .cse2 .cse3 .cse10 .cse15 .cse9 .cse17 .cse5 .cse6 .cse8) .cse18) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse1 .cse2 .cse9 (and .cse11 .cse3 .cse10 .cse6 .cse8) .cse18) (and .cse2 .cse15 .cse9 .cse17 .cse5 .cse6 .cse8 .cse3 .cse4 .cse18) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse12 .cse13 (and .cse1 .cse14 .cse2) .cse15) (and .cse12 .cse13 .cse1 .cse10 .cse15 (and (= 1 ~c_dr_pc~0) .cse6 .cse7) (= 1 ~q_write_ev~0)) (and (not (= ~c_dr_pc~0 1)) .cse11 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse11 .cse1 .cse2 .cse19 .cse10 .cse6) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse11 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse8) (not (= 0 |old(~q_req_up~0)|))))) [2018-11-23 01:25:45,627 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-11-23 01:25:45,630 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-23 01:25:45,630 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-11-23 01:25:45,630 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-11-23 01:25:45,630 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-11-23 01:25:45,632 INFO L444 ceAbstractionStarter]: At program point L423(line 423) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1)) (.cse11 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 2 ~q_read_ev~0))) (let ((.cse1 (= ~q_free~0 0)) (.cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse15 (and .cse11 .cse0 .cse7 .cse8)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~q_req_up~0 0)) (.cse17 (= ~p_dw_st~0 0)) (.cse14 (not (= 0 ~c_dr_st~0))) (.cse3 (<= 2 ~p_dw_st~0)) (.cse18 (not .cse6)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 1 ~q_free~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= 1 ~c_dr_pc~0) .cse7 .cse8)) (and .cse3 .cse4 (and .cse9 .cse10 .cse11 .cse7 .cse8 .cse12) .cse13) (and .cse13 (and .cse3 .cse4 .cse9 .cse5 .cse11 .cse7 .cse12)) (and .cse3 .cse4 (and .cse14 .cse5 .cse7 .cse8)) (and .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse4 .cse6 .cse13 (and .cse9 .cse10 .cse17 .cse11 .cse7 .cse8 .cse12)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse1 .cse2 (and .cse3 .cse15 .cse4) .cse6) (and (not (= ~c_dr_pc~0 1)) .cse14 .cse7) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse14 .cse3 .cse4 .cse18 .cse5 .cse7) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (and .cse6 .cse13 (and .cse4 (and .cse9 .cse5 .cse17 .cse11 .cse7 .cse8 .cse12))) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse14 .cse3 .cse18 .cse4 .cse9 .cse10 .cse7 .cse12) (not (= 0 |old(~q_req_up~0)|))))) [2018-11-23 01:25:45,632 INFO L444 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse16 (= ~p_dw_pc~0 1)) (.cse5 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~q_read_ev~0))) (let ((.cse9 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= ~q_free~0 0)) (.cse14 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse15 (and .cse5 .cse0 .cse6 .cse7)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (+ |old(~c_num_read~0)| 1)) (.cse11 (not (= 0 ~c_dr_st~0))) (.cse1 (<= 2 ~p_dw_st~0)) (.cse17 (not .cse16)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~q_free~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse9 (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)) (and .cse1 .cse2 (and .cse11 .cse10 .cse6 .cse7)) (< .cse12 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (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)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse13 .cse14 (and .cse1 .cse15 .cse2) .cse16) (and .cse13 .cse14 .cse1 .cse15 .cse10 .cse16) (and (not (= ~c_dr_pc~0 1)) .cse11 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse11 .cse1 .cse2 .cse17 .cse10 .cse6) (< |old(~q_free~0)| .cse12) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse11 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse8) (not (= 0 |old(~q_req_up~0)|))))) [2018-11-23 01:25:45,634 INFO L444 ceAbstractionStarter]: At program point L421-1(line 421) the Hoare annotation is: (let ((.cse15 (= ~p_dw_pc~0 1)) (.cse5 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~q_read_ev~0))) (let ((.cse9 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~q_free~0 0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (and .cse5 .cse0 .cse6 .cse7)) (.cse10 (= ~q_req_up~0 0)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse11 (not (= 0 ~c_dr_st~0))) (.cse1 (<= 2 ~p_dw_st~0)) (.cse17 (not .cse15)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~q_free~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse9 (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)) (and .cse1 .cse2 (and .cse11 .cse10 .cse6 .cse7)) (and .cse12 .cse13 .cse1 .cse14 .cse10 .cse15 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (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)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse12 .cse13 (and .cse1 .cse14 .cse2) .cse15) (and (not (= ~c_dr_pc~0 1)) .cse11 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse11 .cse1 .cse2 .cse17 .cse10 .cse6) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse11 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse8) (not (= 0 |old(~q_req_up~0)|))))) [2018-11-23 01:25:45,635 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 261 278) 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 ((.cse3 (not .cse12)) (.cse4 (not (= .cse18 ~p_num_write~0))) (.cse7 (not (= ~q_free~0 0))) (.cse11 (= 0 ~c_dr_st~0)) (.cse13 (not (= 0 ~q_req_up~0))) (.cse10 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse19)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= |old(~q_read_ev~0)| 2))) (.cse5 (and .cse19 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse15 (< ~q_free~0 1)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse14 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse16 (< 1 ~q_free~0)) (.cse9 (< ~p_dw_st~0 2)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse6 .cse0 .cse1 .cse10 .cse11 .cse12 .cse13 .cse9) (or (or .cse6 .cse14 (or .cse0 .cse1 .cse15 .cse8 .cse16 .cse13) .cse9) .cse5) (or .cse6 .cse0 .cse15 .cse1 .cse10 .cse11 .cse12 .cse16 .cse9 .cse17) (or (= 1 ~c_dr_pc~0) .cse0 .cse1 .cse11 .cse10) (or .cse1 (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)) (< .cse18 ~q_free~0) .cse17 (< ~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)) .cse13 (not (= 0 ~c_dr_pc~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse5 .cse13 .cse9) (or .cse6 .cse0 .cse1 .cse11 .cse2 .cse13 .cse10 .cse9) (or .cse1 .cse0 .cse2 .cse5 .cse6 .cse15 .cse8 .cse14 .cse16 .cse9 .cse17)))) [2018-11-23 01:25:45,639 INFO L448 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2018-11-23 01:25:45,639 INFO L448 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2018-11-23 01:25:45,639 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2018-11-23 01:25:45,639 INFO L444 ceAbstractionStarter]: At program point update_channelsENTRY(lines 208 222) the Hoare annotation is: (let ((.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse14 (= ~q_req_up~0 0)) (.cse17 (+ ~c_num_read~0 1)) (.cse22 (= ~p_dw_pc~0 1)) (.cse24 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse15 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse19 (= 1 ~c_dr_pc~0)) (.cse21 (and .cse24 .cse15)) (.cse3 (not .cse22)) (.cse4 (not (= .cse17 ~p_num_write~0))) (.cse7 (not (= ~q_free~0 0))) (.cse20 (= 0 ~c_dr_st~0)) (.cse13 (not (= 0 |old(~q_req_up~0)|))) (.cse23 (and .cse24 .cse14 .cse15)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= |old(~q_read_ev~0)| 2))) (.cse5 (and .cse15 .cse16)) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse11 (< ~q_free~0 1)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse10 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (< 1 ~q_free~0)) (.cse9 (< ~p_dw_st~0 2)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (or .cse6 .cse10 (or .cse0 .cse1 .cse11 .cse8 .cse12 .cse13) .cse9) (and (and .cse14 .cse15) .cse16)) (or .cse1 (not (= 1 ~c_dr_i~0)) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse14 (= ~q_read_ev~0 ~q_write_ev~0)) (not (= 0 ~c_num_read~0)) (< .cse17 ~q_free~0) .cse18 (< ~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)) .cse13 (not (= 0 ~c_dr_pc~0))) (or .cse19 .cse0 .cse1 .cse14 .cse20 .cse13) (or .cse6 .cse0 .cse11 .cse1 .cse21 .cse20 .cse22 .cse12 .cse9 .cse18) (or .cse19 .cse0 .cse1 .cse20 .cse21) (or .cse6 .cse0 .cse1 .cse23 .cse20 .cse22 .cse13 .cse9) (or .cse1 .cse0 .cse2 .cse3 .cse4 (= 0 |old(~q_write_ev~0)|) .cse7 .cse8 (and .cse14 .cse15 .cse16) .cse13 .cse9) (or .cse6 .cse0 .cse1 .cse20 .cse2 .cse13 .cse23 .cse9) (or .cse1 .cse0 .cse2 .cse5 .cse6 .cse11 .cse8 .cse10 .cse12 .cse9 .cse18)))) [2018-11-23 01:25:45,640 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2018-11-23 01:25:45,641 INFO L444 ceAbstractionStarter]: At program point L214(line 214) the Hoare annotation is: (let ((.cse20 (+ ~c_num_read~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse12 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse6 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse7 (< ~q_free~0 1)) (.cse9 (< 1 ~q_free~0)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse16 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse12)) (.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse5 (< |old(~q_write_ev~0)| 2)) (.cse3 (= 0 ~c_dr_st~0)) (.cse11 (not (= |old(~q_read_ev~0)| 2))) (.cse17 (not .cse15)) (.cse18 (not (= .cse20 ~p_num_write~0))) (.cse19 (not (= ~q_free~0 0))) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse10 (< ~p_dw_st~0 2)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not (= 0 |old(~q_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (or .cse1 .cse2 .cse7 .cse8 .cse9 .cse4) .cse10) (or .cse2 .cse1 .cse11 .cse5 .cse7 (and .cse12 .cse13) .cse8 .cse6 .cse9 .cse10 .cse14) (or .cse5 .cse1 .cse2 .cse3 .cse15 .cse4 .cse10) (or .cse5 .cse1 .cse7 .cse2 .cse16 .cse3 .cse15 .cse9 .cse10 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse16) (or .cse1 .cse2 (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse13) .cse11 .cse17 .cse18 .cse5 .cse19 .cse8 .cse10) (or .cse5 .cse1 .cse2 .cse3 .cse11 .cse4 .cse10) (or .cse2 .cse1 .cse11 .cse17 .cse18 (= 0 |old(~q_write_ev~0)|) .cse19 .cse8 .cse4 .cse10) (or .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse20 ~q_free~0) .cse14 (< ~q_free~0 .cse20) .cse1 (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)) .cse4 (not (= 0 ~c_dr_pc~0)))))) [2018-11-23 01:25:45,641 INFO L448 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2018-11-23 01:25:45,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:25:45,641 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) (not (= ~p_dw_i~0 1)) (= ~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-11-23 01:25:45,641 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:25:45,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:25:45,641 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2018-11-23 01:25:45,642 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2018-11-23 01:25:45,642 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2018-11-23 01:25:45,642 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-23 01:25:45,642 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-23 01:25:45,642 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2018-11-23 01:25:45,642 INFO L444 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse11 (+ ~c_num_read~0 1)) (.cse18 (= ~p_dw_pc~0 1))) (let ((.cse7 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse13 (= 1 ~c_dr_pc~0)) (.cse15 (not .cse18)) (.cse16 (not (= .cse11 ~p_num_write~0))) (.cse17 (not (= ~q_free~0 0))) (.cse5 (not (= 2 ~c_dr_st~0))) (.cse4 (< ~q_free~0 1)) (.cse8 (< 1 ~q_free~0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (< ~q_write_ev~0 2)) (.cse6 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse14 (= 0 ~c_dr_st~0)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse12 (not (= 0 ~q_req_up~0))) (.cse9 (< ~p_dw_st~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (= is_do_write_p_triggered_~__retres1~0 0) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse11 ~q_free~0) .cse10 (< ~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)) (not (= ~p_dw_st~0 0)) .cse12 (not (= 0 ~c_dr_pc~0))) (or .cse13 .cse1 .cse0 .cse6 .cse14 .cse2) (or (or .cse3 .cse7 (or .cse1 .cse0 .cse4 (not .cse13) .cse5 .cse8 .cse12) .cse9) (= ~q_read_ev~0 1) .cse6) (or .cse13 .cse1 .cse0 (and (= 1 ~p_dw_pc~0) (not (= 0 ~q_read_ev~0))) .cse14 .cse6) (or .cse6 .cse0 .cse1 .cse2 .cse15 .cse16 .cse3 .cse17 .cse5 .cse9) (or .cse3 .cse1 .cse0 .cse14 .cse6 .cse18 .cse12 .cse9) (or .cse0 .cse1 .cse6 .cse2 .cse15 .cse16 (= 0 ~q_write_ev~0) .cse17 .cse5 .cse12 .cse9) (or .cse3 .cse1 .cse4 .cse0 .cse14 .cse6 .cse18 .cse8 .cse9 .cse10) (or .cse3 .cse6 .cse1 .cse0 .cse14 .cse2 .cse12 .cse9)))) [2018-11-23 01:25:45,643 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2018-11-23 01:25:45,643 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2018-11-23 01:25:45,643 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2018-11-23 01:25:45,643 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2018-11-23 01:25:45,643 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2018-11-23 01:25:45,643 INFO L444 ceAbstractionStarter]: At program point L193(line 193) the Hoare annotation is: (let ((.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (= 0 |old(~c_dr_pc~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse10 (< ~p_dw_st~0 2)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse2 (+ |old(~c_num_read~0)| 1))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) .cse1 (< .cse2 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse2) .cse3 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 .cse5 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse6) (or .cse0 .cse3 .cse7 .cse8 .cse4 .cse9 .cse5 (not (= 1 ~p_num_write~0)) .cse1 .cse6 .cse10) (or (or (< ~q_write_ev~0 2) (or (or .cse0 (or .cse3 (not (= 1 |old(~c_dr_pc~0)|)))) .cse5 .cse7) .cse10) .cse9 .cse8 (not (= .cse2 ~p_num_write~0))))) [2018-11-23 01:25:45,644 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2018-11-23 01:25:45,644 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 155 207) the Hoare annotation is: (let ((.cse6 (not (= ~q_read_ev~0 2))) (.cse13 (< ~p_dw_st~0 2)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse3 (= ~q_free~0 0)) (.cse0 (not (= 0 ~c_dr_st~0))) (.cse1 (= ~c_dr_pc~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse15 (+ ~c_num_read~0 1)) (.cse4 (not (= ~p_dw_i~0 1))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (+ |old(~c_num_read~0)| 1)) (.cse5 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse8 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse10 (= 0 |old(~c_dr_st~0)|)) (.cse12 (not (= 0 |old(~c_dr_pc~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 1 ~p_num_write~0)) .cse11 .cse12 .cse13) (or (or (< ~q_write_ev~0 2) (or (or .cse4 (or .cse5 (not (= 1 |old(~c_dr_pc~0)|)))) .cse10 .cse6) .cse13) .cse9 .cse7 (not (= .cse14 ~p_num_write~0)) (and .cse0 (= 1 ~c_dr_pc~0) .cse3 (= .cse15 ~p_num_write~0))) (or (and .cse0 .cse1 (= ~q_req_up~0 0) .cse2 (<= .cse15 ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0)) .cse4 (not (= 1 ~c_dr_i~0)) .cse11 (< .cse14 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse14) .cse5 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse8 .cse10 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse12))) [2018-11-23 01:25:45,644 INFO L448 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2018-11-23 01:25:45,644 INFO L444 ceAbstractionStarter]: At program point L202(lines 155 207) the Hoare annotation is: (let ((.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse13 (not (= 0 |old(~c_dr_pc~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse14 (< ~p_dw_st~0 2)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse3 (not (= ~p_dw_pc~0 1))) (.cse15 (+ |old(~c_num_read~0)| 1)) (.cse6 (= 2 ~c_dr_st~0)) (.cse8 (= 1 ~c_dr_pc~0)) (.cse7 (<= 1 ~q_free~0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 (= ~c_num_read~0 1) .cse7 .cse8 .cse9 .cse10) .cse11 (not (= 1 ~p_num_write~0)) .cse12 .cse13 .cse14) (or .cse0 (not (= 1 ~c_dr_i~0)) .cse12 (< .cse15 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse15) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 (and .cse6 (= |old(~c_num_read~0)| ~c_num_read~0) (= ~q_req_up~0 0) .cse8 (<= (+ ~c_num_read~0 1) ~q_free~0) .cse9 .cse10) .cse11 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse13) (or (or (< ~q_write_ev~0 2) (or (or .cse0 (or .cse1 (not (= 1 |old(~c_dr_pc~0)|)))) .cse11 .cse2) .cse14) .cse5 .cse3 (not (= .cse15 ~p_num_write~0)) (and (= ~c_num_read~0 ~p_num_write~0) .cse6 .cse8 .cse7 .cse9 .cse10)))) [2018-11-23 01:25:45,644 INFO L444 ceAbstractionStarter]: At program point L198(line 198) the Hoare annotation is: (let ((.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (= 0 |old(~c_dr_pc~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse10 (< ~p_dw_st~0 2)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse2 (+ |old(~c_num_read~0)| 1))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) .cse1 (< .cse2 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse2) .cse3 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 .cse5 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse6) (or .cse0 .cse3 .cse7 .cse8 .cse4 .cse9 .cse5 (not (= 1 ~p_num_write~0)) .cse1 .cse6 .cse10) (or (or (< ~q_write_ev~0 2) (or (or .cse0 (or .cse3 (not (= 1 |old(~c_dr_pc~0)|)))) .cse5 .cse7) .cse10) .cse9 .cse8 (not (= .cse2 ~p_num_write~0))))) [2018-11-23 01:25:45,648 INFO L444 ceAbstractionStarter]: At program point L198-1(lines 158 206) the Hoare annotation is: (let ((.cse2 (+ |old(~c_num_read~0)| 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse12 (not (= ~q_read_ev~0 2))) (.cse15 (not (= ~p_dw_pc~0 1))) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse6 (not (= 0 ~c_dr_st~0))) (.cse16 (<= 1 ~q_free~0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (not (= 0 |old(~c_dr_pc~0)|))) (.cse13 (< ~p_dw_st~0 2))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) .cse1 (< .cse2 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse2) .cse3 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 .cse5 (not (= ~p_dw_st~0 0)) (and .cse6 .cse7 (= ~q_req_up~0 0) .cse8 (<= (+ ~c_num_read~0 1) ~q_free~0) .cse9 .cse10) (not (= 0 |old(~q_req_up~0)|)) .cse11) (or (or (< ~q_write_ev~0 2) (or (or .cse0 (or .cse3 (not (= 1 |old(~c_dr_pc~0)|)))) .cse5 .cse12) .cse13) .cse14 .cse15 (not (= .cse2 ~p_num_write~0)) (and .cse6 (= ~c_num_read~0 ~p_num_write~0) .cse16 .cse9 .cse10)) (or .cse0 .cse3 .cse12 .cse15 (and .cse6 .cse7 .cse8 (= ~q_free~0 0)) .cse4 (and .cse6 (= ~c_num_read~0 1) .cse16 .cse9 .cse10) .cse14 .cse5 (not (= 1 ~p_num_write~0)) .cse1 .cse11 .cse13))) [2018-11-23 01:25:45,648 INFO L444 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse2 (+ |old(~c_num_read~0)| 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (not (= ~q_read_ev~0 2))) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (= 0 |old(~c_dr_pc~0)|))) (.cse8 (< ~p_dw_st~0 2))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) .cse1 (< .cse2 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse2) .cse3 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 .cse5 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse6) (or (or (< ~q_write_ev~0 2) (or (or .cse0 (or .cse3 (not (= 1 |old(~c_dr_pc~0)|)))) .cse5 .cse7) .cse8) .cse9 .cse10 (not (= .cse2 ~p_num_write~0)) (and (not (= 0 ~c_dr_st~0)) (= 1 ~c_dr_pc~0) (= ~q_free~0 0) (= (+ ~c_num_read~0 1) ~p_num_write~0))) (or .cse0 .cse3 .cse7 .cse10 .cse4 .cse9 .cse5 (not (= 1 ~p_num_write~0)) .cse1 .cse6 .cse8))) [2018-11-23 01:25:45,648 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2018-11-23 01:25:45,648 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2018-11-23 01:25:45,649 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 438 454) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= ~q_buf_0~0 ~p_last_write~0)) (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (not (= ~p_dw_i~0 1)) (= ~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-11-23 01:25:45,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:25:45 BoogieIcfgContainer [2018-11-23 01:25:45,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:25:45,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:25:45,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:25:45,719 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:25:45,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:24:27" (3/4) ... [2018-11-23 01:25:45,725 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 01:25:45,729 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-23 01:25:45,729 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-23 01:25:45,729 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-11-23 01:25:45,729 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-23 01:25:45,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-23 01:25:45,731 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-23 01:25:45,731 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-23 01:25:45,731 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-23 01:25:45,736 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-23 01:25:45,737 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 01:25:45,760 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) && 2 <= q_write_ev) && q_req_up == 0) && p_dw_pc == 1) && (1 == c_dr_pc && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((2 <= p_dw_st && 2 <= q_write_ev) && ((((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) && c_num_read == p_num_write)) || (c_num_read == p_num_write && (((((2 <= p_dw_st && 2 <= q_write_ev) && 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) && ((!(0 == c_dr_st) && q_req_up == 0) && p_last_write == q_buf_0) && 2 == q_read_ev)) || ((((((q_free == 0 && c_num_read + 1 == p_num_write) && 2 <= p_dw_st) && ((2 == c_dr_st && p_dw_i == 1) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_req_up == 0) && p_dw_pc == 1) && !(0 == q_write_ev))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_dw_pc) == 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)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(0 == \old(c_dr_pc))) || (((q_free == 0 && c_num_read + 1 == p_num_write) && (2 <= p_dw_st && ((2 == c_dr_st && p_dw_i == 1) && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 <= q_write_ev) && p_dw_pc == 1)) || ((!(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) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && q_req_up == 0) && p_last_write == q_buf_0)) || \old(q_free) < \old(c_num_read) + 1) || !(2 == \old(q_write_ev))) || ((p_dw_pc == 1 && c_num_read == p_num_write) && 2 <= q_write_ev && (((((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)) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0)) || (((((((!(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)) || !(0 == \old(q_req_up))) || (((((((((((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-11-23 01:25:45,761 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \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) && (((((((((((!(p_dw_i == 1) || !(\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))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || ((((((((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)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((((((((((((!(p_dw_i == 1) || ((((((((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)) || !(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)) || !(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))) || (((((((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)) || (((((((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)) || ((((((((((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)) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 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)) || q_write_ev < 2) || \old(q_free) < 1) || !(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)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == 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))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((!(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)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((((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)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_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) && 2 == q_read_ev) && p_dw_i == 1)) || q_write_ev < 2) || !(\old(q_free) == 0)) || (((((((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)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((((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) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) < 2)) && ((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \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))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || ((((((((!(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) && 2 == q_read_ev) && p_dw_i == 1)) || \old(p_dw_st) < 2)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || (c_num_read == 1 && p_num_write == 1)) || 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(c_num_read))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || 2 == c_dr_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \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_st) < 2) || (((((((((2 <= p_dw_st && q_req_up == 0) && 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))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || (1 <= q_free && q_free <= 1)) || q_write_ev < 2) || \old(p_dw_st) < 2)) && ((((((((((((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) || (((((((((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)) || ((((((((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)) || ((((((((((((!(p_dw_i == 1) || !(\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 == \old(c_dr_st))) || !(\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))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 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) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((!(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)) || 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))) [2018-11-23 01:25:45,761 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \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) && (((((((((((!(p_dw_i == 1) || !(\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))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || ((((((((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)) || !(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) || ((((((((((((!(p_dw_i == 1) || !(\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 == \old(c_dr_st))) || !(\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))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 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)))))) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 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)) || q_write_ev < 2) || \old(q_free) < 1) || !(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)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == 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))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((!(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)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_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) && 2 == q_read_ev) && p_dw_i == 1)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(0 == \old(q_req_up))) || (((((((((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(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((((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) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) < 2)) && ((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \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))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || ((((((((!(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) && 2 == q_read_ev) && p_dw_i == 1)) || \old(p_dw_st) < 2)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || (c_num_read == 1 && p_num_write == 1)) || 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(c_num_read))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || 2 == c_dr_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \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_st) < 2) || (((((((((2 <= p_dw_st && q_req_up == 0) && 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))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || (1 <= q_free && q_free <= 1)) || q_write_ev < 2) || \old(p_dw_st) < 2)) && ((((((((((((((((!(p_dw_i == 1) || ((((((((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)) || !(1 == c_dr_i)) || (((((((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)) || !(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)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((!(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)) || 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))) [2018-11-23 01:25:45,761 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(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)) || (((p_num_write == 1 && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0)) || !(\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)) && ((!(c_num_read == \old(p_num_write)) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(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) || !(p_dw_i == 1) || ((!(\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))) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && (((((((\old(q_free) < c_num_read + 1 || ((((\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)) || (!(2 == c_dr_st) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || \old(p_num_write) + 1 < \old(q_free)) || (((((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)) || c_num_read + 1 < \old(q_free)) [2018-11-23 01:25:45,762 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(c_num_read == \old(p_num_write)) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(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) || !(p_dw_i == 1) || ((!(\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)) || ((((2 <= p_dw_st && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == 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)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((p_dw_st == 2 && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc))) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_last_write == q_buf_0)) && ((((((\old(q_free) < c_num_read + 1 || (!(2 == c_dr_st) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(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))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_pc == \old(p_dw_pc)) || !(1 == \old(p_dw_pc))) [2018-11-23 01:25:45,762 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(q_free) < c_num_read + 1 || (!(2 == c_dr_st) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((c_num_read + 1 <= q_free && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free <= p_num_write + 1) && 0 == p_num_write)) || \old(p_num_write) + 1 < \old(q_free)) || \old(p_dw_pc) == 1) || c_num_read + 1 < \old(q_free)) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && ((((((((((((((!(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))) && ((!(c_num_read == \old(p_num_write)) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(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) || !(p_dw_i == 1) || ((!(\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)) [2018-11-23 01:25:45,762 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_i == 1) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 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))) && ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || (((!(0 == c_dr_st) && c_dr_pc == 0) && c_num_read == 0) && q_free == 0)) || !(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 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) [2018-11-23 01:25:45,762 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && q_free <= 1) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) && (((((((((((((((!(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)) || ((((((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)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && ((((((q_write_ev < 2 || ((!(p_dw_i == 1) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 2) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) || (((((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)) [2018-11-23 01:25:45,762 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_write_ev < 2 || ((!(p_dw_i == 1) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 2) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) || (((!(0 == c_dr_st) && 1 == c_dr_pc) && q_free == 0) && c_num_read + 1 == p_num_write))) && ((((((((((!(p_dw_i == 1) || !(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) [2018-11-23 01:25:45,792 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ae57521f-27b0-49e5-bb39-1c707d3b47ea/bin-2019/utaipan/witness.graphml [2018-11-23 01:25:45,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:25:45,793 INFO L168 Benchmark]: Toolchain (without parser) took 79036.54 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 958.1 MB in the beginning and 1.0 GB in the end (delta: -80.8 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-23 01:25:45,793 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:25:45,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.02 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 942.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:25:45,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.67 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:25:45,793 INFO L168 Benchmark]: Boogie Preprocessor took 59.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 01:25:45,794 INFO L168 Benchmark]: RCFGBuilder took 315.41 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.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:25:45,794 INFO L168 Benchmark]: TraceAbstraction took 78368.59 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.9 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-23 01:25:45,794 INFO L168 Benchmark]: Witness Printer took 73.22 ms. Allocated memory is still 5.0 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:25:45,795 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.02 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 942.0 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 13.67 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 315.41 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.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 78368.59 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.9 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 73.22 ms. Allocated memory is still 5.0 GB. Free memory is still 1.0 GB. 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_write_ev < 2 || ((!(p_dw_i == 1) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 2) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) || (((!(0 == c_dr_st) && 1 == c_dr_pc) && q_free == 0) && c_num_read + 1 == p_num_write))) && ((((((((((!(p_dw_i == 1) || !(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) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((!(c_num_read == \old(p_num_write)) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(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) || !(p_dw_i == 1) || ((!(\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)) || ((((2 <= p_dw_st && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == 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)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((p_dw_st == 2 && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc))) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_last_write == q_buf_0)) && ((((((\old(q_free) < c_num_read + 1 || (!(2 == c_dr_st) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(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))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_pc == \old(p_dw_pc)) || !(1 == \old(p_dw_pc))) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \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) && (((((((((((!(p_dw_i == 1) || !(\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))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || ((((((((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)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((((((((((((!(p_dw_i == 1) || ((((((((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)) || !(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)) || !(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))) || (((((((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)) || (((((((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)) || ((((((((((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)) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 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)) || q_write_ev < 2) || \old(q_free) < 1) || !(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)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == 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))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((!(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)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((((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)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_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) && 2 == q_read_ev) && p_dw_i == 1)) || q_write_ev < 2) || !(\old(q_free) == 0)) || (((((((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)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((((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) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) < 2)) && ((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \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))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || ((((((((!(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) && 2 == q_read_ev) && p_dw_i == 1)) || \old(p_dw_st) < 2)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || (c_num_read == 1 && p_num_write == 1)) || 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(c_num_read))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || 2 == c_dr_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \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_st) < 2) || (((((((((2 <= p_dw_st && q_req_up == 0) && 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))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || (1 <= q_free && q_free <= 1)) || q_write_ev < 2) || \old(p_dw_st) < 2)) && ((((((((((((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) || (((((((((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)) || ((((((((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)) || ((((((((((((!(p_dw_i == 1) || !(\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 == \old(c_dr_st))) || !(\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))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 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) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((!(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)) || 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))) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || 0 == __retres1) || !(c_num_read == p_num_write)) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write)) && ((((((((((((((!(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))) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || !(q_read_ev == 2))) && (((((q_write_ev < 2 || !(c_num_read == p_num_write)) || (((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || q_free < 1) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || 1 < q_free) || !(0 == q_req_up)) || p_dw_st < 2) || q_read_ev == 1) || 0 == __retres1)) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || (1 == p_dw_pc && !(0 == q_read_ev))) || 0 == c_dr_st) || 0 == __retres1)) && (((((((((0 == __retres1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(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)) || !(p_dw_i == 1)) || 0 == c_dr_st) || 0 == __retres1) || p_dw_pc == 1) || !(0 == q_req_up)) || p_dw_st < 2)) && ((((((((((!(p_dw_i == 1) || !(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)) && (((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 0 == c_dr_st) || 0 == __retres1) || p_dw_pc == 1) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write))) && (((((((q_write_ev < 2 || 0 == __retres1) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(0 == q_req_up)) || p_dw_st < 2) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && q_free <= 1) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) && (((((((((((((((!(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)) || ((((((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)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && ((((((q_write_ev < 2 || ((!(p_dw_i == 1) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 2) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) || (((((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)) - 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) && 2 <= q_write_ev) && q_req_up == 0) && p_dw_pc == 1) && (1 == c_dr_pc && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((2 <= p_dw_st && 2 <= q_write_ev) && ((((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) && c_num_read == p_num_write)) || (c_num_read == p_num_write && (((((2 <= p_dw_st && 2 <= q_write_ev) && 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) && ((!(0 == c_dr_st) && q_req_up == 0) && p_last_write == q_buf_0) && 2 == q_read_ev)) || ((((((q_free == 0 && c_num_read + 1 == p_num_write) && 2 <= p_dw_st) && ((2 == c_dr_st && p_dw_i == 1) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_req_up == 0) && p_dw_pc == 1) && !(0 == q_write_ev))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_dw_pc) == 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)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(0 == \old(c_dr_pc))) || (((q_free == 0 && c_num_read + 1 == p_num_write) && (2 <= p_dw_st && ((2 == c_dr_st && p_dw_i == 1) && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 <= q_write_ev) && p_dw_pc == 1)) || ((!(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) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && q_req_up == 0) && p_last_write == q_buf_0)) || \old(q_free) < \old(c_num_read) + 1) || !(2 == \old(q_write_ev))) || ((p_dw_pc == 1 && c_num_read == p_num_write) && 2 <= q_write_ev && (((((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)) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0)) || (((((((!(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)) || !(0 == \old(q_req_up))) || (((((((((((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: (((((((((\old(q_free) < c_num_read + 1 || (!(2 == c_dr_st) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((c_num_read + 1 <= q_free && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free <= p_num_write + 1) && 0 == p_num_write)) || \old(p_num_write) + 1 < \old(q_free)) || \old(p_dw_pc) == 1) || c_num_read + 1 < \old(q_free)) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && ((((((((((((((!(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))) && ((!(c_num_read == \old(p_num_write)) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(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) || !(p_dw_i == 1) || ((!(\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)) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \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) && (((((((((((!(p_dw_i == 1) || !(\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))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || ((((((((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)) || !(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) || ((((((((((((!(p_dw_i == 1) || !(\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 == \old(c_dr_st))) || !(\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))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 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)))))) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 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)) || q_write_ev < 2) || \old(q_free) < 1) || !(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)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == 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))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((!(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)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_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) && 2 == q_read_ev) && p_dw_i == 1)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(0 == \old(q_req_up))) || (((((((((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(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((((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) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) < 2)) && ((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \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))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || ((((((((!(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) && 2 == q_read_ev) && p_dw_i == 1)) || \old(p_dw_st) < 2)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || (c_num_read == 1 && p_num_write == 1)) || 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(c_num_read))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || 2 == c_dr_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \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_st) < 2) || (((((((((2 <= p_dw_st && q_req_up == 0) && 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))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || (1 <= q_free && q_free <= 1)) || q_write_ev < 2) || \old(p_dw_st) < 2)) && ((((((((((((((((!(p_dw_i == 1) || ((((((((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)) || !(1 == c_dr_i)) || (((((((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)) || !(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)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((!(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)) || 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))) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((!(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)) || (((p_num_write == 1 && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0)) || !(\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)) && ((!(c_num_read == \old(p_num_write)) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(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) || !(p_dw_i == 1) || ((!(\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))) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && (((((((\old(q_free) < c_num_read + 1 || ((((\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)) || (!(2 == c_dr_st) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || \old(p_num_write) + 1 < \old(q_free)) || (((((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)) || c_num_read + 1 < \old(q_free)) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: (((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(p_dw_st == 0)) || 1 == __retres1) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || 1 <= __retres1) || !(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 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(c_num_read + 1 == p_num_write)) || q_write_ev < 2) || !(q_free == 0)) || !(0 == q_req_up)) || p_dw_st < 2) || !(0 == c_dr_st))) && (1 == __retres1 || (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || !(c_num_read == p_num_write)) || 1 < q_free) || !(c_last_read == p_last_write)) && (((q_write_ev < 2 || !(p_dw_pc == 1)) || ((((((!(q_buf_0 == p_last_write) || q_free < 1) || !(p_dw_i == 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))))) && ((((((((((((((!(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)) && (((((((((((((q_free < c_num_read + 1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || 1 == __retres1) || !(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_i == 1) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 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))) && ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || (((!(0 == c_dr_st) && c_dr_pc == 0) && c_num_read == 0) && q_free == 0)) || !(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 == \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)) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == __retres1) || !(0 == q_req_up)) || p_dw_st < 2) && (((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || p_dw_pc == 1) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write))) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || 1 == q_write_ev) || !(c_num_read + 1 == p_num_write)) || 0 == q_write_ev) || 0 == __retres1) || !(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)) && ((!(c_num_read == p_num_write) || (q_write_ev < 2 || ((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || q_free < 1) || !(2 == c_dr_st)) || 1 < q_free) || !(0 == q_req_up)) || p_dw_st < 2) || 0 == __retres1)) && ((((((((((!(p_dw_i == 1) || !(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)) || 0 == __retres1) || !(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)) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_pc == 1) || !(0 == q_req_up)) || 0 == __retres1) || 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)) || __retres1 == 0) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(0 == c_dr_pc))) && (((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(c_num_read + 1 == p_num_write)) || !(1 == p_dw_pc)) || q_write_ev < 2) || 0 == __retres1) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || p_dw_st < 2)) && (((((q_write_ev < 2 || ((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || q_free < 1) || 0 == c_dr_st) || 1 < q_free) || !(0 == q_req_up)) || p_dw_st < 2) || !(q_read_ev == 1)) || !(c_num_read == p_num_write)) || 0 == __retres1)) && ((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || 1 == c_dr_pc)) && (((((q_write_ev < 2 || (((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || 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)) || !(q_read_ev == 1)) || 0 == __retres1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 130 locations, 1 error locations. SAFE Result, 78.2s OverallTime, 23 OverallIterations, 8 TraceHistogramMax, 24.3s AutomataDifference, 0.0s DeadEndRemovalTime, 37.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 5140 SDtfs, 8576 SDslu, 13824 SDs, 0 SdLazy, 11968 SolverSat, 2992 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3771 GetRequests, 3446 SyntacticMatches, 46 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19665occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.7s AbstIntTime, 9 AbstIntIterations, 2 AbstIntStrong, 0.9829408920928772 AbsIntWeakeningRatio, 0.751269035532995 AbsIntAvgWeakeningVarsNumRemoved, 23.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 11614 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 47982 PreInvPairs, 51497 NumberOfFragments, 16966 HoareAnnotationTreeSize, 47982 FomulaSimplifications, 436179 FormulaSimplificationTreeSizeReduction, 6.1s HoareSimplificationTime, 56 FomulaSimplificationsInter, 326181 FormulaSimplificationTreeSizeReductionInter, 30.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 4852 NumberOfCodeBlocks, 4852 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 6448 ConstructedInterpolants, 0 QuantifiedInterpolants, 2163187 SizeOfPredicates, 10 NumberOfNonLiveVariables, 7630 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 37 InterpolantComputations, 19 PerfectInterpolantSequences, 4312/4591 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...